/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/cart.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:29:58,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:29:58,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:29:58,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:29:58,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:29:58,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:29:58,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:29:58,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:29:58,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:29:58,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:29:58,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:29:58,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:29:58,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:29:58,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:29:58,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:29:58,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:29:58,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:29:58,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:29:58,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:29:58,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:29:58,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:29:58,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:29:58,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:29:58,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:29:58,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:29:58,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:29:58,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:29:58,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:29:58,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:29:58,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:29:58,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:29:58,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:29:58,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:29:58,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:29:58,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:29:58,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:29:58,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:29:58,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:29:58,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:29:58,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:29:58,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:29:58,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:29:58,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:29:58,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:29:58,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:29:58,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:29:58,525 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:29:58,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:29:58,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:29:58,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:29:58,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:29:58,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:29:58,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:29:58,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:29:58,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:29:58,527 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:29:58,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:29:58,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:29:58,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:29:58,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:29:58,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:29:58,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:29:58,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:29:58,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:29:58,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:29:58,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:29:58,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:29:58,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:29:58,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:29:58,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:29:58,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:29:58,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:29:58,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:29:58,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:29:58,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:29:58,807 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:29:58,808 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:29:58,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/cart.i [2019-11-23 21:29:58,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59555a67/2f5adf20d3694851b980827a63833b2f/FLAG8f56e3ef6 [2019-11-23 21:29:59,432 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:29:59,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart.i [2019-11-23 21:29:59,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59555a67/2f5adf20d3694851b980827a63833b2f/FLAG8f56e3ef6 [2019-11-23 21:29:59,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59555a67/2f5adf20d3694851b980827a63833b2f [2019-11-23 21:29:59,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:29:59,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:29:59,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:29:59,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:29:59,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:29:59,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:59" (1/1) ... [2019-11-23 21:29:59,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd88be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:59, skipping insertion in model container [2019-11-23 21:29:59,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:59" (1/1) ... [2019-11-23 21:29:59,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:29:59,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:30:00,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:30:00,145 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:30:00,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:30:00,251 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:30:00,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00 WrapperNode [2019-11-23 21:30:00,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:30:00,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:30:00,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:30:00,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:30:00,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:30:00,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:30:00,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:30:00,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:30:00,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... [2019-11-23 21:30:00,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:30:00,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:30:00,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:30:00,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:30:00,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:30:00,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:30:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:30:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:30:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:30:00,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:30:00,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:30:00,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:30:00,724 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:30:00,725 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:30:00,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:30:00 BoogieIcfgContainer [2019-11-23 21:30:00,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:30:00,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:30:00,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:30:00,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:30:00,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:29:59" (1/3) ... [2019-11-23 21:30:00,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f143729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:30:00, skipping insertion in model container [2019-11-23 21:30:00,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:00" (2/3) ... [2019-11-23 21:30:00,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f143729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:30:00, skipping insertion in model container [2019-11-23 21:30:00,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:30:00" (3/3) ... [2019-11-23 21:30:00,732 INFO L109 eAbstractionObserver]: Analyzing ICFG cart.i [2019-11-23 21:30:00,741 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:30:00,748 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:30:00,755 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:30:00,774 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:30:00,775 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:30:00,775 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:30:00,775 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:30:00,775 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:30:00,775 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:30:00,775 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:30:00,775 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:30:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-23 21:30:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 21:30:00,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:00,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:00,795 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:00,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2019-11-23 21:30:00,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:00,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371505299] [2019-11-23 21:30:00,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:00,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371505299] [2019-11-23 21:30:00,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:00,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:30:00,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338060577] [2019-11-23 21:30:00,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:30:00,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:30:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:30:00,946 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-23 21:30:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:00,966 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-11-23 21:30:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:30:00,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-23 21:30:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:00,979 INFO L225 Difference]: With dead ends: 34 [2019-11-23 21:30:00,980 INFO L226 Difference]: Without dead ends: 17 [2019-11-23 21:30:00,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:30:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-23 21:30:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-23 21:30:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-23 21:30:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-23 21:30:01,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2019-11-23 21:30:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:01,027 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-23 21:30:01,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:30:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-11-23 21:30:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 21:30:01,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:01,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:01,029 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:01,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2019-11-23 21:30:01,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:01,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215602801] [2019-11-23 21:30:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:01,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215602801] [2019-11-23 21:30:01,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:01,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:30:01,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925189804] [2019-11-23 21:30:01,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:30:01,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:30:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:30:01,163 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2019-11-23 21:30:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:01,265 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2019-11-23 21:30:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:30:01,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-23 21:30:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:01,267 INFO L225 Difference]: With dead ends: 36 [2019-11-23 21:30:01,267 INFO L226 Difference]: Without dead ends: 21 [2019-11-23 21:30:01,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:30:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-23 21:30:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-23 21:30:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 21:30:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-23 21:30:01,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2019-11-23 21:30:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:01,275 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-23 21:30:01,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:30:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-11-23 21:30:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:30:01,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:01,276 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:01,276 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:01,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2019-11-23 21:30:01,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:01,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223089426] [2019-11-23 21:30:01,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:01,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223089426] [2019-11-23 21:30:01,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:01,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:30:01,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72325861] [2019-11-23 21:30:01,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:30:01,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:30:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:30:01,351 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2019-11-23 21:30:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:01,423 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-11-23 21:30:01,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:30:01,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-23 21:30:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:01,425 INFO L225 Difference]: With dead ends: 36 [2019-11-23 21:30:01,425 INFO L226 Difference]: Without dead ends: 30 [2019-11-23 21:30:01,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:30:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-23 21:30:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-11-23 21:30:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 21:30:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-23 21:30:01,432 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2019-11-23 21:30:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:01,433 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-23 21:30:01,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:30:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-23 21:30:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:30:01,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:01,434 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:01,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2019-11-23 21:30:01,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:01,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964975485] [2019-11-23 21:30:01,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:30:01,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964975485] [2019-11-23 21:30:01,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:01,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:30:01,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168863955] [2019-11-23 21:30:01,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:30:01,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:30:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:30:01,497 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 3 states. [2019-11-23 21:30:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:01,516 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-23 21:30:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:30:01,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 21:30:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:01,518 INFO L225 Difference]: With dead ends: 37 [2019-11-23 21:30:01,518 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 21:30:01,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:30:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 21:30:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-23 21:30:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 21:30:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-23 21:30:01,525 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-11-23 21:30:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:01,526 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-23 21:30:01,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:30:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-23 21:30:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:30:01,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:01,527 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:01,527 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:01,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2019-11-23 21:30:01,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:01,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377051724] [2019-11-23 21:30:01,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:01,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377051724] [2019-11-23 21:30:01,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75924539] [2019-11-23 21:30:01,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:01,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 21:30:01,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:01,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:02,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-11-23 21:30:02,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:30:02,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,116 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,127 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2019-11-23 21:30:02,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-11-23 21:30:02,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-11-23 21:30:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:02,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:02,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-23 21:30:02,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319430945] [2019-11-23 21:30:02,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:30:02,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:30:02,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:30:02,162 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 10 states. [2019-11-23 21:30:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:02,480 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-11-23 21:30:02,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:30:02,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-23 21:30:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:02,481 INFO L225 Difference]: With dead ends: 48 [2019-11-23 21:30:02,482 INFO L226 Difference]: Without dead ends: 46 [2019-11-23 21:30:02,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:30:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-23 21:30:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2019-11-23 21:30:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 21:30:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-11-23 21:30:02,495 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2019-11-23 21:30:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:02,495 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-11-23 21:30:02,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:30:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-11-23 21:30:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 21:30:02,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:02,497 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:02,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:02,698 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2019-11-23 21:30:02,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:02,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359140222] [2019-11-23 21:30:02,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:30:02,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359140222] [2019-11-23 21:30:02,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177419336] [2019-11-23 21:30:02,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:02,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 21:30:02,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:02,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-11-23 21:30:02,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-23 21:30:02,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:02,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:02,949 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:02,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:02,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-23 21:30:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:30:02,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:02,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-23 21:30:02,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540534251] [2019-11-23 21:30:02,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:30:02,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:30:02,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:30:02,966 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 7 states. [2019-11-23 21:30:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:03,159 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2019-11-23 21:30:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:30:03,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-23 21:30:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:03,161 INFO L225 Difference]: With dead ends: 52 [2019-11-23 21:30:03,161 INFO L226 Difference]: Without dead ends: 42 [2019-11-23 21:30:03,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:30:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-23 21:30:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-23 21:30:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-23 21:30:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-23 21:30:03,168 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 23 [2019-11-23 21:30:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:03,168 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-23 21:30:03,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:30:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-23 21:30:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:30:03,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:03,170 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:03,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:03,373 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:03,373 INFO L82 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2019-11-23 21:30:03,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:03,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305557706] [2019-11-23 21:30:03,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:03,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305557706] [2019-11-23 21:30:03,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043560388] [2019-11-23 21:30:03,584 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:03,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:03,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:03,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 21:30:03,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:03,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:03,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:03,668 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-23 21:30:03,725 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:03,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-11-23 21:30:03,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:30:03,800 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-23 21:30:03,827 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:03,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:30:03,845 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:03,855 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:03,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:03,860 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:105, output treesize:7 [2019-11-23 21:30:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:03,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:03,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-23 21:30:03,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236831177] [2019-11-23 21:30:03,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:30:03,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:03,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:30:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:30:03,865 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 8 states. [2019-11-23 21:30:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:04,029 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2019-11-23 21:30:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:30:04,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-23 21:30:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:04,030 INFO L225 Difference]: With dead ends: 59 [2019-11-23 21:30:04,030 INFO L226 Difference]: Without dead ends: 36 [2019-11-23 21:30:04,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:30:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-23 21:30:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-23 21:30:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-23 21:30:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-11-23 21:30:04,042 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 24 [2019-11-23 21:30:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:04,043 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-23 21:30:04,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:30:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2019-11-23 21:30:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 21:30:04,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:04,045 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:04,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:04,246 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2019-11-23 21:30:04,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:04,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523034659] [2019-11-23 21:30:04,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:04,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523034659] [2019-11-23 21:30:04,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682504921] [2019-11-23 21:30:04,582 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:04,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 21:30:04,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:04,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 21:30:04,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:04,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:30:04,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:30:04,710 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:04,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:04,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,751 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:8 [2019-11-23 21:30:04,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:04,907 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_int_11|], 2=[|v_#memory_$Pointer$.base_17|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_16|]} [2019-11-23 21:30:04,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2019-11-23 21:30:04,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:04,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:04,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:04,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-23 21:30:04,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,935 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:04,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2019-11-23 21:30:04,964 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:04,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:04,981 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:05,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:05,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-11-23 21:30:05,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:05,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:05,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-23 21:30:05,027 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:05,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:05,029 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:05,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:05,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:05,037 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:92, output treesize:20 [2019-11-23 21:30:05,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-23 21:30:05,088 INFO L343 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2019-11-23 21:30:05,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2019-11-23 21:30:05,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:05,096 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimArr_2], 1=[v_arrayElimArr_1]} [2019-11-23 21:30:05,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:05,299 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) 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) [2019-11-23 21:30:05,306 INFO L168 Benchmark]: Toolchain (without parser) took 5617.98 ms. Allocated memory was 138.4 MB in the beginning and 247.5 MB in the end (delta: 109.1 MB). Free memory was 100.8 MB in the beginning and 178.1 MB in the end (delta: -77.3 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,307 INFO L168 Benchmark]: CDTParser took 1.33 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.17 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 169.6 MB in the end (delta: -69.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.97 ms. Allocated memory is still 202.9 MB. Free memory was 169.6 MB in the beginning and 167.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,309 INFO L168 Benchmark]: Boogie Preprocessor took 32.10 ms. Allocated memory is still 202.9 MB. Free memory was 167.6 MB in the beginning and 166.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,310 INFO L168 Benchmark]: RCFGBuilder took 388.05 ms. Allocated memory is still 202.9 MB. Free memory was 166.3 MB in the beginning and 148.0 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,316 INFO L168 Benchmark]: TraceAbstraction took 4577.04 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 147.3 MB in the beginning and 178.1 MB in the end (delta: -30.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:30:05,322 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 563.17 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 169.6 MB in the end (delta: -69.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.97 ms. Allocated memory is still 202.9 MB. Free memory was 169.6 MB in the beginning and 167.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.10 ms. Allocated memory is still 202.9 MB. Free memory was 167.6 MB in the beginning and 166.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 388.05 ms. Allocated memory is still 202.9 MB. Free memory was 166.3 MB in the beginning and 148.0 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4577.04 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 147.3 MB in the beginning and 178.1 MB in the end (delta: -30.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...