/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:44:22,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:44:22,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:44:22,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:44:22,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:44:22,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:44:22,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:44:22,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:44:22,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:44:22,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:44:22,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:44:22,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:44:22,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:44:22,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:44:22,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:44:22,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:44:22,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:44:22,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:44:22,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:44:22,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:44:22,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:44:22,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:44:22,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:44:22,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:44:22,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:44:22,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:44:22,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:44:22,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:44:22,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:44:22,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:44:22,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:44:22,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:44:22,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:44:22,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:44:22,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:44:22,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:44:22,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:44:22,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:44:22,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:44:22,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:44:22,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:44:22,540 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:44:22,555 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:44:22,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:44:22,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:44:22,556 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:44:22,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:44:22,556 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:44:22,557 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:44:22,557 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:44:22,557 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:44:22,557 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:44:22,557 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:44:22,557 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:44:22,558 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:44:22,558 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:44:22,558 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:44:22,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:44:22,558 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:44:22,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:44:22,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:44:22,559 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:44:22,559 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:44:22,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:44:22,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:44:22,560 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:44:22,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:44:22,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:44:22,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:44:22,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:44:22,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:44:22,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:44:22,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:44:22,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:44:22,741 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:44:22,742 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:44:22,743 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:44:22,810 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_4z5oGN/tmp/f30c93bc09a44184ba9d620c3cbe51e8/FLAGcc14513a7 [2020-07-01 12:44:23,143 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:44:23,144 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:44:23,144 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:44:23,151 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_4z5oGN/tmp/f30c93bc09a44184ba9d620c3cbe51e8/FLAGcc14513a7 [2020-07-01 12:44:23,552 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_4z5oGN/tmp/f30c93bc09a44184ba9d620c3cbe51e8 [2020-07-01 12:44:23,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:44:23,564 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:44:23,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:44:23,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:44:23,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:44:23,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f642ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23, skipping insertion in model container [2020-07-01 12:44:23,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:44:23,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:44:23,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:44:23,846 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:44:23,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:44:23,879 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:44:23,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23 WrapperNode [2020-07-01 12:44:23,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:44:23,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:44:23,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:44:23,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:44:23,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:44:23,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:44:23,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:44:23,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:44:23,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... [2020-07-01 12:44:23,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:44:23,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:44:23,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:44:23,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:44:23,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 12:44:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:44:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:44:24,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:44:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:44:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:44:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:44:24,334 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:44:24,334 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:44:24,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:24 BoogieIcfgContainer [2020-07-01 12:44:24,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:44:24,339 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:44:24,339 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:44:24,341 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:44:24,342 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,358 INFO L313 BlockEncoder]: Initial Icfg 57 locations, 61 edges [2020-07-01 12:44:24,359 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:44:24,360 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:44:24,361 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:44:24,361 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:44:24,363 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:44:24,364 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:44:24,364 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:44:24,394 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:44:24,432 INFO L200 BlockEncoder]: SBE split 31 edges [2020-07-01 12:44:24,437 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:44:24,439 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:44:24,475 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:44:24,478 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:44:24,480 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:44:24,480 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:44:24,480 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:44:24,481 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:44:24,481 INFO L313 BlockEncoder]: Encoded RCFG 49 locations, 89 edges [2020-07-01 12:44:24,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:24 BasicIcfg [2020-07-01 12:44:24,482 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:44:24,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:44:24,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:44:24,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:44:24,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:44:23" (1/4) ... [2020-07-01 12:44:24,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6419cd2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:44:24, skipping insertion in model container [2020-07-01 12:44:24,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (2/4) ... [2020-07-01 12:44:24,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6419cd2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:44:24, skipping insertion in model container [2020-07-01 12:44:24,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:24" (3/4) ... [2020-07-01 12:44:24,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6419cd2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:24, skipping insertion in model container [2020-07-01 12:44:24,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:24" (4/4) ... [2020-07-01 12:44:24,491 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:44:24,502 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:44:24,510 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 12:44:24,523 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 12:44:24,547 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:44:24,547 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:44:24,547 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:44:24,548 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:44:24,548 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:44:24,548 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:44:24,548 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:44:24,548 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:44:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-07-01 12:44:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:24,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:24,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:24,571 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 12:44:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash 135471, now seen corresponding path program 1 times [2020-07-01 12:44:24,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:24,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580391504] [2020-07-01 12:44:24,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:24,743 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 12:44:24,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580391504] [2020-07-01 12:44:24,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:24,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:24,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264148453] [2020-07-01 12:44:24,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:24,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:24,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:24,783 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-07-01 12:44:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:24,953 INFO L93 Difference]: Finished difference Result 96 states and 169 transitions. [2020-07-01 12:44:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:24,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:24,967 INFO L225 Difference]: With dead ends: 96 [2020-07-01 12:44:24,967 INFO L226 Difference]: Without dead ends: 49 [2020-07-01 12:44:24,971 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 12:44:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-01 12:44:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-01 12:44:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 12:44:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2020-07-01 12:44:25,009 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 3 [2020-07-01 12:44:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,010 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2020-07-01 12:44:25,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2020-07-01 12:44:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:25,011 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:25,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:44:25,013 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 12:44:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 135502, now seen corresponding path program 1 times [2020-07-01 12:44:25,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140411478] [2020-07-01 12:44:25,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,071 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 12:44:25,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140411478] [2020-07-01 12:44:25,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951191281] [2020-07-01 12:44:25,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,075 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand 3 states. [2020-07-01 12:44:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,212 INFO L93 Difference]: Finished difference Result 49 states and 82 transitions. [2020-07-01 12:44:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,213 INFO L225 Difference]: With dead ends: 49 [2020-07-01 12:44:25,214 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:44:25,215 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 12:44:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:44:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 12:44:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 12:44:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 72 transitions. [2020-07-01 12:44:25,221 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 72 transitions. Word has length 3 [2020-07-01 12:44:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,221 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 72 transitions. [2020-07-01 12:44:25,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 72 transitions. [2020-07-01 12:44:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:25,222 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:25,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:44:25,222 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 12:44:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 135504, now seen corresponding path program 1 times [2020-07-01 12:44:25,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138016263] [2020-07-01 12:44:25,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,248 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 12:44:25,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138016263] [2020-07-01 12:44:25,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610782161] [2020-07-01 12:44:25,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,251 INFO L87 Difference]: Start difference. First operand 44 states and 72 transitions. Second operand 3 states. [2020-07-01 12:44:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,331 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2020-07-01 12:44:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,332 INFO L225 Difference]: With dead ends: 49 [2020-07-01 12:44:25,332 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:44:25,333 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 12:44:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:44:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-01 12:44:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 12:44:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2020-07-01 12:44:25,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 3 [2020-07-01 12:44:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,339 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2020-07-01 12:44:25,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2020-07-01 12:44:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:25,339 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:25,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:44:25,340 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 12:44:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash 135505, now seen corresponding path program 1 times [2020-07-01 12:44:25,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489809755] [2020-07-01 12:44:25,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,381 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 12:44:25,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489809755] [2020-07-01 12:44:25,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293842104] [2020-07-01 12:44:25,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,383 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand 3 states. [2020-07-01 12:44:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,495 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2020-07-01 12:44:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,496 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:44:25,497 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:44:25,497 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 12:44:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:44:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 12:44:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 12:44:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 62 transitions. [2020-07-01 12:44:25,502 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 62 transitions. Word has length 3 [2020-07-01 12:44:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,502 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 62 transitions. [2020-07-01 12:44:25,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 62 transitions. [2020-07-01 12:44:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:44:25,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:44:25,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:44:25,503 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 12:44:25,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,504 INFO L82 PathProgramCache]: Analyzing trace with hash 4197654, now seen corresponding path program 1 times [2020-07-01 12:44:25,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780755154] [2020-07-01 12:44:25,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,536 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 12:44:25,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780755154] [2020-07-01 12:44:25,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285571714] [2020-07-01 12:44:25,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,538 INFO L87 Difference]: Start difference. First operand 39 states and 62 transitions. Second operand 3 states. [2020-07-01 12:44:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,626 INFO L93 Difference]: Finished difference Result 39 states and 62 transitions. [2020-07-01 12:44:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:44:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,628 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:44:25,628 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:44:25,628 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 12:44:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:44:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 12:44:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:44:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2020-07-01 12:44:25,633 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 52 transitions. Word has length 4 [2020-07-01 12:44:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,633 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 52 transitions. [2020-07-01 12:44:25,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 52 transitions. [2020-07-01 12:44:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:44:25,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:44:25,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:44:25,634 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 12:44:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash 4197655, now seen corresponding path program 1 times [2020-07-01 12:44:25,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970086264] [2020-07-01 12:44:25,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,676 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 12:44:25,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970086264] [2020-07-01 12:44:25,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534522203] [2020-07-01 12:44:25,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,678 INFO L87 Difference]: Start difference. First operand 34 states and 52 transitions. Second operand 3 states. [2020-07-01 12:44:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,746 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2020-07-01 12:44:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:44:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,747 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:44:25,747 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:44:25,747 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 12:44:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:44:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:44:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:44:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-07-01 12:44:25,751 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 4 [2020-07-01 12:44:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,752 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-07-01 12:44:25,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2020-07-01 12:44:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:44:25,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:44:25,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:44:25,753 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 12:44:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 130125671, now seen corresponding path program 1 times [2020-07-01 12:44:25,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230305173] [2020-07-01 12:44:25,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,787 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 12:44:25,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230305173] [2020-07-01 12:44:25,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341782546] [2020-07-01 12:44:25,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,789 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 3 states. [2020-07-01 12:44:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,841 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2020-07-01 12:44:25,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:44:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,843 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:44:25,843 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:44:25,843 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 12:44:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:44:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:44:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:44:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-07-01 12:44:25,847 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 5 [2020-07-01 12:44:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,847 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-01 12:44:25,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-07-01 12:44:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:44:25,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:44:25,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:44:25,849 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 12:44:25,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash 130125673, now seen corresponding path program 1 times [2020-07-01 12:44:25,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607399823] [2020-07-01 12:44:25,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,885 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 12:44:25,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607399823] [2020-07-01 12:44:25,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172221941] [2020-07-01 12:44:25,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,887 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. [2020-07-01 12:44:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:25,933 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-07-01 12:44:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:25,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:44:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:25,934 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:44:25,934 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:44:25,935 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 12:44:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:44:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:44:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:44:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:44:25,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 12:44:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:25,936 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:44:25,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:44:25,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:44:25,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:44:25,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:44:26,000 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:44:26,000 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:44:26,001 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:44:26,001 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:26,001 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:44:26,001 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:44:26,001 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:44:26,001 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:26,001 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:26,001 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:26,002 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:26,002 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:44:26,002 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:26,002 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,002 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:44:26,002 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:44:26,002 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,002 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:26,003 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,003 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:44:26,003 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:26,003 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:44:26,003 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:44:26,004 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,004 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,004 INFO L268 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,004 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,004 INFO L268 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,004 INFO L268 CegarLoopResult]: For program point L13-6(lines 13 19) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point L13-8(lines 13 19) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:26,005 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:44:26,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,006 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2020-07-01 12:44:26,006 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:26,006 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 18) 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 12:44:26,007 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:44:26,007 INFO L264 CegarLoopResult]: At program point L14-4(lines 12 19) 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 12:44:26,007 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:44:26,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:26,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:26,007 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:44:26,010 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:44:26,020 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,021 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,021 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:26,021 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:26,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:26,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:26,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:26 BasicIcfg [2020-07-01 12:44:26,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:44:26,035 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:44:26,035 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:44:26,038 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:44:26,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:26,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:44:23" (1/5) ... [2020-07-01 12:44:26,039 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ab7535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:44:26, skipping insertion in model container [2020-07-01 12:44:26,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:26,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:23" (2/5) ... [2020-07-01 12:44:26,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ab7535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:44:26, skipping insertion in model container [2020-07-01 12:44:26,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:26,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:24" (3/5) ... [2020-07-01 12:44:26,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ab7535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:44:26, skipping insertion in model container [2020-07-01 12:44:26,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:26,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:24" (4/5) ... [2020-07-01 12:44:26,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ab7535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:44:26, skipping insertion in model container [2020-07-01 12:44:26,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:26,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:26" (5/5) ... [2020-07-01 12:44:26,042 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:44:26,063 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:44:26,064 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:44:26,064 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:44:26,064 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:44:26,064 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:44:26,064 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:44:26,064 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:44:26,064 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:44:26,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-07-01 12:44:26,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-01 12:44:26,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:44:26,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:44:26,080 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:44:26,081 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:26,081 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:44:26,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2020-07-01 12:44:26,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-01 12:44:26,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:44:26,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:44:26,084 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:44:26,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:26,090 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue [104] 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] 7#L-1true [186] 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~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~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_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~short6=|v_ULTIMATE.start_test_fun_#t~short6_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~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, 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~short6, 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] 9#L10true [87] 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] 44#L10-1true [134] 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] 21#L11true [105] L11-->L14-4: 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] 10#L14-4true [2020-07-01 12:44:26,091 INFO L796 eck$LassoCheckResult]: Loop: 10#L14-4true [91] L14-4-->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 [143] L13-->L13-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 49#L13-1true [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 48#L13-2true [141] L13-2-->L13-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short6_5|) InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} AuxVars[] AssignedVars[] 32#L13-6true [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_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~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 11#L14-3true [95] L14-3-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 15#L14-1true [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 10#L14-4true [2020-07-01 12:44:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 1 times [2020-07-01 12:44:26,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12465689] [2020-07-01 12:44:26,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,111 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 12:44:26,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12465689] [2020-07-01 12:44:26,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279683960] [2020-07-01 12:44:26,113 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:44:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,113 INFO L82 PathProgramCache]: Analyzing trace with hash 899451794, now seen corresponding path program 1 times [2020-07-01 12:44:26,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865330183] [2020-07-01 12:44:26,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,133 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 12:44:26,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865330183] [2020-07-01 12:44:26,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:44:26,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789871041] [2020-07-01 12:44:26,135 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:44:26,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,137 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-07-01 12:44:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,242 INFO L93 Difference]: Finished difference Result 49 states and 82 transitions. [2020-07-01 12:44:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,245 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 12:44:26,249 INFO L168 Benchmark]: Toolchain (without parser) took 2684.10 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 556.1 MB in the beginning and 402.5 MB in the end (delta: 153.6 MB). Peak memory consumption was 198.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:26,250 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:44:26,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.15 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 556.1 MB in the beginning and 656.3 MB in the end (delta: -100.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:26,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.83 ms. Allocated memory is still 694.2 MB. Free memory was 656.3 MB in the beginning and 653.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:26,252 INFO L168 Benchmark]: Boogie Preprocessor took 25.20 ms. Allocated memory is still 694.2 MB. Free memory was 653.6 MB in the beginning and 652.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:26,252 INFO L168 Benchmark]: RCFGBuilder took 389.99 ms. Allocated memory is still 694.2 MB. Free memory was 652.2 MB in the beginning and 624.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:26,253 INFO L168 Benchmark]: BlockEncodingV2 took 143.12 ms. Allocated memory is still 694.2 MB. Free memory was 624.4 MB in the beginning and 612.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:26,253 INFO L168 Benchmark]: TraceAbstraction took 1550.86 ms. Allocated memory is still 694.2 MB. Free memory was 610.9 MB in the beginning and 429.6 MB in the end (delta: 181.3 MB). Peak memory consumption was 181.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:26,254 INFO L168 Benchmark]: BuchiAutomizer took 212.16 ms. Allocated memory is still 694.2 MB. Free memory was 429.6 MB in the beginning and 402.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:26,257 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 57 locations, 61 edges - StatisticsResult: Encoded RCFG 49 locations, 89 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 315.15 ms. Allocated memory was 649.6 MB in the beginning and 694.2 MB in the end (delta: 44.6 MB). Free memory was 556.1 MB in the beginning and 656.3 MB in the end (delta: -100.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.83 ms. Allocated memory is still 694.2 MB. Free memory was 656.3 MB in the beginning and 653.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.20 ms. Allocated memory is still 694.2 MB. Free memory was 653.6 MB in the beginning and 652.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 389.99 ms. Allocated memory is still 694.2 MB. Free memory was 652.2 MB in the beginning and 624.4 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 143.12 ms. Allocated memory is still 694.2 MB. Free memory was 624.4 MB in the beginning and 612.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1550.86 ms. Allocated memory is still 694.2 MB. Free memory was 610.9 MB in the beginning and 429.6 MB in the end (delta: 181.3 MB). Peak memory consumption was 181.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 212.16 ms. Allocated memory is still 694.2 MB. Free memory was 429.6 MB in the beginning and 402.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 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 - 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: 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: 10]: 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: 16]: 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: 17]: 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: 20]: 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: 20]: 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: 14]: 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: 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: 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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 12:44:26,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:26,269 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,270 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,271 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:26,271 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 - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:44:26,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:26,272 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,273 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:26,274 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:26,274 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, 49 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: 69 SDtfs, 416 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=49occurred 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, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 86 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 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 12:44:20.332 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp/BenchExec_run_4z5oGN/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:44:26.498 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check