/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:16:36,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:16:36,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:16:36,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:16:36,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:16:36,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:16:36,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:16:36,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:16:36,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:16:36,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:16:36,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:16:36,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:16:36,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:16:36,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:16:36,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:16:36,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:16:36,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:16:36,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:16:36,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:16:36,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:16:36,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:16:36,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:16:36,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:16:36,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:16:36,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:16:36,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:16:36,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:16:36,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:16:36,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:16:36,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:16:36,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:16:36,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:16:36,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:16:36,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:16:36,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:16:36,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:16:36,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:16:36,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:16:36,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:16:36,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:16:36,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:16:36,982 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:16:36,996 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:16:36,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:16:36,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:16:36,998 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:16:36,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:16:36,998 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:16:36,998 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:16:36,999 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:16:36,999 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:16:36,999 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:16:36,999 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:16:36,999 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:16:36,999 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:16:37,000 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:16:37,000 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:16:37,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:16:37,000 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:16:37,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:16:37,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:16:37,001 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:16:37,001 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:16:37,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:16:37,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:16:37,001 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:16:37,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:16:37,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:16:37,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:16:37,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:16:37,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:16:37,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:16:37,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:16:37,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:16:37,183 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:16:37,183 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:16:37,184 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:16:37,243 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_l9TVDi/tmp/1e140f7b1d234fb6868430662be651fb/FLAG6bc798851 [2020-07-01 13:16:37,587 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:16:37,588 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:16:37,588 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:16:37,595 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_l9TVDi/tmp/1e140f7b1d234fb6868430662be651fb/FLAG6bc798851 [2020-07-01 13:16:38,004 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_l9TVDi/tmp/1e140f7b1d234fb6868430662be651fb [2020-07-01 13:16:38,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:16:38,016 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:16:38,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:16:38,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:16:38,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:16:38,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ffe9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38, skipping insertion in model container [2020-07-01 13:16:38,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:16:38,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:16:38,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:16:38,294 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:16:38,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:16:38,328 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:16:38,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38 WrapperNode [2020-07-01 13:16:38,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:16:38,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:16:38,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:16:38,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:16:38,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:16:38,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:16:38,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:16:38,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:16:38,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:16:38,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:16:38,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:16:38,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:16:38,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:16:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:16:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:16:38,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:16:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:16:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:16:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:16:38,790 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:16:38,790 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:16:38,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:16:38 BoogieIcfgContainer [2020-07-01 13:16:38,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:16:38,795 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:16:38,795 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:16:38,798 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:16:38,799 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:16:38" (1/1) ... [2020-07-01 13:16:38,815 INFO L313 BlockEncoder]: Initial Icfg 58 locations, 62 edges [2020-07-01 13:16:38,819 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:16:38,820 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:16:38,820 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:16:38,821 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:16:38,823 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:16:38,823 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:16:38,824 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:16:38,851 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:16:38,887 INFO L200 BlockEncoder]: SBE split 31 edges [2020-07-01 13:16:38,892 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:16:38,893 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:16:38,929 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:16:38,932 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:16:38,933 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:16:38,933 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:16:38,934 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:16:38,934 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:16:38,935 INFO L313 BlockEncoder]: Encoded RCFG 50 locations, 90 edges [2020-07-01 13:16:38,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:16:38 BasicIcfg [2020-07-01 13:16:38,936 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:16:38,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:16:38,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:16:38,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:16:38,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:16:38" (1/4) ... [2020-07-01 13:16:38,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe5d152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:16:38, skipping insertion in model container [2020-07-01 13:16:38,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (2/4) ... [2020-07-01 13:16:38,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe5d152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:16:38, skipping insertion in model container [2020-07-01 13:16:38,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:16:38" (3/4) ... [2020-07-01 13:16:38,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe5d152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:16:38, skipping insertion in model container [2020-07-01 13:16:38,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:16:38" (4/4) ... [2020-07-01 13:16:38,944 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:16:38,955 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:16:38,963 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 13:16:38,977 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 13:16:39,001 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:16:39,001 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:16:39,001 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:16:39,001 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:16:39,001 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:16:39,002 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:16:39,002 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:16:39,002 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:16:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-07-01 13:16:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:16:39,024 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:16:39,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:16:39,025 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:16:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:39,031 INFO L82 PathProgramCache]: Analyzing trace with hash 139347, now seen corresponding path program 1 times [2020-07-01 13:16:39,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:39,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834334445] [2020-07-01 13:16:39,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:39,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834334445] [2020-07-01 13:16:39,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:39,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:39,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985721077] [2020-07-01 13:16:39,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:16:39,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:39,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,223 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-07-01 13:16:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:39,391 INFO L93 Difference]: Finished difference Result 98 states and 171 transitions. [2020-07-01 13:16:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:39,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:16:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:16:39,405 INFO L225 Difference]: With dead ends: 98 [2020-07-01 13:16:39,405 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 13:16:39,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 13:16:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-01 13:16:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-01 13:16:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2020-07-01 13:16:39,448 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 3 [2020-07-01 13:16:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:16:39,448 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2020-07-01 13:16:39,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:16:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2020-07-01 13:16:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:16:39,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:16:39,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:16:39,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:16:39,451 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:16:39,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:39,451 INFO L82 PathProgramCache]: Analyzing trace with hash 139378, now seen corresponding path program 1 times [2020-07-01 13:16:39,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:39,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643264630] [2020-07-01 13:16:39,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:39,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643264630] [2020-07-01 13:16:39,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:39,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:39,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317934609] [2020-07-01 13:16:39,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:16:39,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,515 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2020-07-01 13:16:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:39,646 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2020-07-01 13:16:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:39,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:16:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:16:39,648 INFO L225 Difference]: With dead ends: 50 [2020-07-01 13:16:39,649 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 13:16:39,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 13:16:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 13:16:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:16:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 73 transitions. [2020-07-01 13:16:39,655 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 73 transitions. Word has length 3 [2020-07-01 13:16:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:16:39,656 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 73 transitions. [2020-07-01 13:16:39,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:16:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 73 transitions. [2020-07-01 13:16:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:16:39,656 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:16:39,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:16:39,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:16:39,657 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:16:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash 139380, now seen corresponding path program 1 times [2020-07-01 13:16:39,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:39,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543389200] [2020-07-01 13:16:39,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:39,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543389200] [2020-07-01 13:16:39,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:39,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:39,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661929432] [2020-07-01 13:16:39,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:16:39,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:39,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:39,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,685 INFO L87 Difference]: Start difference. First operand 45 states and 73 transitions. Second operand 3 states. [2020-07-01 13:16:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:39,767 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2020-07-01 13:16:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:39,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:16:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:16:39,769 INFO L225 Difference]: With dead ends: 50 [2020-07-01 13:16:39,769 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 13:16:39,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 13:16:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 13:16:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 13:16:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2020-07-01 13:16:39,775 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 3 [2020-07-01 13:16:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:16:39,776 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2020-07-01 13:16:39,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:16:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2020-07-01 13:16:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:16:39,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:16:39,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:16:39,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:16:39,777 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:16:39,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:39,777 INFO L82 PathProgramCache]: Analyzing trace with hash 139381, now seen corresponding path program 1 times [2020-07-01 13:16:39,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:39,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319721928] [2020-07-01 13:16:39,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:39,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319721928] [2020-07-01 13:16:39,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:39,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:39,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515916920] [2020-07-01 13:16:39,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:16:39,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,819 INFO L87 Difference]: Start difference. First operand 45 states and 68 transitions. Second operand 3 states. [2020-07-01 13:16:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:39,944 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2020-07-01 13:16:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:39,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:16:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:16:39,945 INFO L225 Difference]: With dead ends: 45 [2020-07-01 13:16:39,945 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 13:16:39,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 13:16:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 13:16:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 13:16:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-07-01 13:16:39,950 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 3 [2020-07-01 13:16:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:16:39,951 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-07-01 13:16:39,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:16:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-07-01 13:16:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:16:39,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:16:39,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:16:39,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:16:39,952 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:16:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 4317996, now seen corresponding path program 1 times [2020-07-01 13:16:39,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:39,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019043894] [2020-07-01 13:16:39,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:39,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019043894] [2020-07-01 13:16:39,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:39,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:39,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755203434] [2020-07-01 13:16:39,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:16:39,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:39,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:39,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:39,988 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 3 states. [2020-07-01 13:16:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:40,080 INFO L93 Difference]: Finished difference Result 40 states and 63 transitions. [2020-07-01 13:16:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:40,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:16:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:16:40,081 INFO L225 Difference]: With dead ends: 40 [2020-07-01 13:16:40,081 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 13:16:40,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 13:16:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 13:16:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 13:16:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2020-07-01 13:16:40,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 4 [2020-07-01 13:16:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:16:40,086 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2020-07-01 13:16:40,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:16:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2020-07-01 13:16:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:16:40,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:16:40,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:16:40,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:16:40,087 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:16:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash 4317998, now seen corresponding path program 1 times [2020-07-01 13:16:40,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:40,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596770507] [2020-07-01 13:16:40,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:40,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596770507] [2020-07-01 13:16:40,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:40,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:40,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979749172] [2020-07-01 13:16:40,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:16:40,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:40,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:40,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:40,130 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand 3 states. [2020-07-01 13:16:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:40,199 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. [2020-07-01 13:16:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:40,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:16:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:16:40,200 INFO L225 Difference]: With dead ends: 35 [2020-07-01 13:16:40,200 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 13:16:40,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 13:16:40,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 13:16:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 13:16:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2020-07-01 13:16:40,204 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 4 [2020-07-01 13:16:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:16:40,204 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-07-01 13:16:40,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:16:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2020-07-01 13:16:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:16:40,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:16:40,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:16:40,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:16:40,206 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:16:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash 133856305, now seen corresponding path program 1 times [2020-07-01 13:16:40,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:40,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780465650] [2020-07-01 13:16:40,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:40,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780465650] [2020-07-01 13:16:40,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:40,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:40,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523727977] [2020-07-01 13:16:40,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:16:40,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:40,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:40,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:40,236 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 3 states. [2020-07-01 13:16:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:40,293 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2020-07-01 13:16:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:40,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:16:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:16:40,295 INFO L225 Difference]: With dead ends: 30 [2020-07-01 13:16:40,295 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 13:16:40,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 13:16:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 13:16:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 13:16:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-07-01 13:16:40,298 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 5 [2020-07-01 13:16:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:16:40,299 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-07-01 13:16:40,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:16:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2020-07-01 13:16:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:16:40,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:16:40,300 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:16:40,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:16:40,300 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:16:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash 133856307, now seen corresponding path program 1 times [2020-07-01 13:16:40,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:40,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89203167] [2020-07-01 13:16:40,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:40,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89203167] [2020-07-01 13:16:40,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:40,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:40,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49213769] [2020-07-01 13:16:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:16:40,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:40,338 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 3 states. [2020-07-01 13:16:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:40,386 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2020-07-01 13:16:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:40,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:16:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:16:40,387 INFO L225 Difference]: With dead ends: 26 [2020-07-01 13:16:40,387 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:16:40,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:16:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:16:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:16:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:16:40,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:16:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:16:40,388 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:16:40,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:16:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:16:40,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:16:40,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:16:40,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:16:40,427 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 13:16:40,427 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:16:40,427 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:16:40,427 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:16:40,427 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:16:40,427 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:16:40,427 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:16:40,428 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:16:40,429 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:16:40,429 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:16:40,429 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:16:40,429 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:16:40,429 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 13:16:40,429 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2020-07-01 13:16:40,429 INFO L268 CegarLoopResult]: For program point L17-3(lines 14 22) no Hoare annotation was computed. [2020-07-01 13:16:40,429 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:16:40,430 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:16:40,430 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-01 13:16:40,430 INFO L268 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-07-01 13:16:40,430 INFO L268 CegarLoopResult]: For program point L13-5(lines 13 24) no Hoare annotation was computed. [2020-07-01 13:16:40,430 INFO L264 CegarLoopResult]: At program point L13-7(lines 12 24) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:16:40,431 INFO L268 CegarLoopResult]: For program point L13-8(lines 13 24) no Hoare annotation was computed. [2020-07-01 13:16:40,431 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:16:40,431 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:16:40,431 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:16:40,431 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:16:40,431 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:16:40,431 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 22) no Hoare annotation was computed. [2020-07-01 13:16:40,432 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:16:40,433 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:16:40,433 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:16:40,433 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:16:40,433 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:16:40,433 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:16:40,436 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:16:40,445 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:16:40,446 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:16:40,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:16:40 BasicIcfg [2020-07-01 13:16:40,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:16:40,457 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:16:40,457 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:16:40,460 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:16:40,461 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:16:40,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:16:38" (1/5) ... [2020-07-01 13:16:40,461 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39a40b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:16:40, skipping insertion in model container [2020-07-01 13:16:40,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:16:40,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:16:38" (2/5) ... [2020-07-01 13:16:40,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39a40b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:16:40, skipping insertion in model container [2020-07-01 13:16:40,462 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:16:40,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:16:38" (3/5) ... [2020-07-01 13:16:40,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39a40b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:16:40, skipping insertion in model container [2020-07-01 13:16:40,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:16:40,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:16:38" (4/5) ... [2020-07-01 13:16:40,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39a40b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:16:40, skipping insertion in model container [2020-07-01 13:16:40,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:16:40,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:16:40" (5/5) ... [2020-07-01 13:16:40,465 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:16:40,486 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:16:40,486 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:16:40,486 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:16:40,486 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:16:40,486 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:16:40,486 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:16:40,486 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:16:40,486 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:16:40,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2020-07-01 13:16:40,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-01 13:16:40,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:16:40,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:16:40,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:16:40,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:16:40,502 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:16:40,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2020-07-01 13:16:40,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-01 13:16:40,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:16:40,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:16:40,506 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:16:40,506 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:16:40,511 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [108] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [187] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 11#L10true [94] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 45#L10-1true [135] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 22#L11true [109] L11-->L13-7: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 29#L13-7true [2020-07-01 13:16:40,512 INFO L796 eck$LassoCheckResult]: Loop: 29#L13-7true [120] L13-7-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 50#L13true [208] L13-->L13-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 49#L13-1true [141] L13-1-->L13-5: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 33#L13-5true [124] L13-5-->L14: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 16#L14true [101] L14-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 15#L14-1true [97] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem6_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 17#L15true [105] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 25#L15-1true [252] L15-1-->L17-3: Formula: (and (= 1 (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| (- 1)))) |v_#memory_int_25|)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 52#L17-3true [144] L17-3-->L23: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 38#L23true [254] L23-->L13-7: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= |v_#memory_int_29| (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1)))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 29#L13-7true [2020-07-01 13:16:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash 134034964, now seen corresponding path program 1 times [2020-07-01 13:16:40,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:40,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877868923] [2020-07-01 13:16:40,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:16:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:16:40,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877868923] [2020-07-01 13:16:40,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:16:40,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:16:40,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026348602] [2020-07-01 13:16:40,537 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:16:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:16:40,537 INFO L82 PathProgramCache]: Analyzing trace with hash 391787109, now seen corresponding path program 1 times [2020-07-01 13:16:40,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:16:40,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748246187] [2020-07-01 13:16:40,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:16:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:16:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:16:40,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:16:40,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:16:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:16:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:16:40,717 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2020-07-01 13:16:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:16:40,825 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2020-07-01 13:16:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:16:40,828 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:16:40,833 INFO L168 Benchmark]: Toolchain (without parser) took 2815.55 ms. Allocated memory was 514.9 MB in the beginning and 594.5 MB in the end (delta: 79.7 MB). Free memory was 436.5 MB in the beginning and 423.0 MB in the end (delta: 13.5 MB). Peak memory consumption was 93.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:16:40,833 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 456.0 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:16:40,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.36 ms. Allocated memory was 514.9 MB in the beginning and 563.1 MB in the end (delta: 48.2 MB). Free memory was 435.9 MB in the beginning and 531.4 MB in the end (delta: -95.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:16:40,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.25 ms. Allocated memory is still 563.1 MB. Free memory was 531.4 MB in the beginning and 529.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:16:40,835 INFO L168 Benchmark]: Boogie Preprocessor took 24.96 ms. Allocated memory is still 563.1 MB. Free memory was 529.1 MB in the beginning and 527.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:16:40,836 INFO L168 Benchmark]: RCFGBuilder took 398.77 ms. Allocated memory is still 563.1 MB. Free memory was 527.5 MB in the beginning and 501.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:16:40,836 INFO L168 Benchmark]: BlockEncodingV2 took 140.54 ms. Allocated memory is still 563.1 MB. Free memory was 501.8 MB in the beginning and 489.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:16:40,837 INFO L168 Benchmark]: TraceAbstraction took 1519.33 ms. Allocated memory was 563.1 MB in the beginning and 594.5 MB in the end (delta: 31.5 MB). Free memory was 488.9 MB in the beginning and 469.8 MB in the end (delta: 19.1 MB). Peak memory consumption was 50.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:16:40,837 INFO L168 Benchmark]: BuchiAutomizer took 373.50 ms. Allocated memory is still 594.5 MB. Free memory was 469.8 MB in the beginning and 423.0 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:16:40,841 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 58 locations, 62 edges - StatisticsResult: Encoded RCFG 50 locations, 90 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 456.0 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 311.36 ms. Allocated memory was 514.9 MB in the beginning and 563.1 MB in the end (delta: 48.2 MB). Free memory was 435.9 MB in the beginning and 531.4 MB in the end (delta: -95.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.25 ms. Allocated memory is still 563.1 MB. Free memory was 531.4 MB in the beginning and 529.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.96 ms. Allocated memory is still 563.1 MB. Free memory was 529.1 MB in the beginning and 527.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * RCFGBuilder took 398.77 ms. Allocated memory is still 563.1 MB. Free memory was 527.5 MB in the beginning and 501.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 140.54 ms. Allocated memory is still 563.1 MB. Free memory was 501.8 MB in the beginning and 489.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1519.33 ms. Allocated memory was 563.1 MB in the beginning and 594.5 MB in the end (delta: 31.5 MB). Free memory was 488.9 MB in the beginning and 469.8 MB in the end (delta: 19.1 MB). Peak memory consumption was 50.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 373.50 ms. Allocated memory is still 594.5 MB. Free memory was 469.8 MB in the beginning and 423.0 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 13:16:40,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:16:40,852 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:16:40,853 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:16:40,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 77 SDtfs, 424 SDslu, 4 SDs, 0 SdLazy, 371 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:16:34.752 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_l9TVDi/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:16:41.078 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check