java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:43:16,645 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:43:16,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:43:16,664 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:43:16,664 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:43:16,665 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:43:16,666 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:43:16,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:43:16,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:43:16,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:43:16,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:43:16,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:43:16,673 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:43:16,674 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:43:16,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:43:16,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:43:16,677 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:43:16,679 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:43:16,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:43:16,683 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:43:16,684 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:43:16,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:43:16,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:43:16,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:43:16,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:43:16,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:43:16,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:43:16,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:43:16,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:43:16,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:43:16,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:43:16,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:43:16,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:43:16,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:43:16,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:43:16,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:43:16,702 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:43:16,732 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:43:16,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:43:16,735 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:43:16,735 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:43:16,735 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:43:16,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:43:16,737 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:43:16,737 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:43:16,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:43:16,737 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:43:16,738 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:43:16,738 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:43:16,738 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:43:16,738 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:43:16,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:43:16,738 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:43:16,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:43:16,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:43:16,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:43:16,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:43:16,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:16,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:43:16,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:43:16,741 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:43:16,741 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:43:16,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:43:16,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:43:16,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:43:16,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:43:16,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:43:16,830 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:43:16,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i [2018-10-10 14:43:17,171 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a01a4147/1bf8cce62a5c495497d6ed07f7b9c36a/FLAGa9f808f09 [2018-10-10 14:43:17,473 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:43:17,474 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i [2018-10-10 14:43:17,492 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a01a4147/1bf8cce62a5c495497d6ed07f7b9c36a/FLAGa9f808f09 [2018-10-10 14:43:17,514 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a01a4147/1bf8cce62a5c495497d6ed07f7b9c36a [2018-10-10 14:43:17,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:43:17,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:43:17,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:17,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:43:17,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:43:17,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:17" (1/1) ... [2018-10-10 14:43:17,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685bfbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:17, skipping insertion in model container [2018-10-10 14:43:17,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:17" (1/1) ... [2018-10-10 14:43:17,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:43:17,606 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:43:17,879 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:17,890 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:43:17,968 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:18,029 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:43:18,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18 WrapperNode [2018-10-10 14:43:18,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:18,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:18,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:43:18,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:43:18,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:18,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:43:18,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:43:18,098 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:43:18,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:43:18,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:43:18,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:43:18,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:43:18,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (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 [2018-10-10 14:43:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:43:18,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:43:19,530 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:43:19,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:19 BoogieIcfgContainer [2018-10-10 14:43:19,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:43:19,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:43:19,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:43:19,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:43:19,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:43:17" (1/3) ... [2018-10-10 14:43:19,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f50149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:19, skipping insertion in model container [2018-10-10 14:43:19,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (2/3) ... [2018-10-10 14:43:19,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f50149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:19, skipping insertion in model container [2018-10-10 14:43:19,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:19" (3/3) ... [2018-10-10 14:43:19,539 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-10-10 14:43:19,549 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:43:19,558 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-10-10 14:43:19,576 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-10-10 14:43:19,605 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:43:19,605 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:43:19,606 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:43:19,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:43:19,606 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:43:19,606 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:43:19,607 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:43:19,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:43:19,607 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:43:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2018-10-10 14:43:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-10 14:43:19,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:19,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:19,644 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:19,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1128459374, now seen corresponding path program 1 times [2018-10-10 14:43:19,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:19,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:19,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:19,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:19,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:43:19,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-10 14:43:19,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-10 14:43:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:43:19,810 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 2 states. [2018-10-10 14:43:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:19,838 INFO L93 Difference]: Finished difference Result 221 states and 238 transitions. [2018-10-10 14:43:19,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-10 14:43:19,839 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-10-10 14:43:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:19,869 INFO L225 Difference]: With dead ends: 221 [2018-10-10 14:43:19,869 INFO L226 Difference]: Without dead ends: 216 [2018-10-10 14:43:19,871 INFO L605 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 [2018-10-10 14:43:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-10 14:43:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-10-10 14:43:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 14:43:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 233 transitions. [2018-10-10 14:43:19,923 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 233 transitions. Word has length 23 [2018-10-10 14:43:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:19,924 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 233 transitions. [2018-10-10 14:43:19,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-10 14:43:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 233 transitions. [2018-10-10 14:43:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-10 14:43:19,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:19,926 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:19,927 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:19,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash 67342139, now seen corresponding path program 1 times [2018-10-10 14:43:19,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:19,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:19,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:19,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:43:19,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:19,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:19,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:19,989 INFO L87 Difference]: Start difference. First operand 216 states and 233 transitions. Second operand 3 states. [2018-10-10 14:43:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:20,139 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2018-10-10 14:43:20,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:20,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-10 14:43:20,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:20,151 INFO L225 Difference]: With dead ends: 217 [2018-10-10 14:43:20,151 INFO L226 Difference]: Without dead ends: 217 [2018-10-10 14:43:20,154 INFO L605 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 [2018-10-10 14:43:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-10 14:43:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-10-10 14:43:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-10 14:43:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 234 transitions. [2018-10-10 14:43:20,181 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 234 transitions. Word has length 28 [2018-10-10 14:43:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:20,181 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 234 transitions. [2018-10-10 14:43:20,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 234 transitions. [2018-10-10 14:43:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 14:43:20,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:20,183 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:20,184 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:20,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash 76387166, now seen corresponding path program 1 times [2018-10-10 14:43:20,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:20,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:20,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:20,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:43:20,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:20,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:20,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:20,274 INFO L87 Difference]: Start difference. First operand 217 states and 234 transitions. Second operand 3 states. [2018-10-10 14:43:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:20,344 INFO L93 Difference]: Finished difference Result 383 states and 417 transitions. [2018-10-10 14:43:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:20,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-10 14:43:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:20,348 INFO L225 Difference]: With dead ends: 383 [2018-10-10 14:43:20,348 INFO L226 Difference]: Without dead ends: 383 [2018-10-10 14:43:20,349 INFO L605 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 [2018-10-10 14:43:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-10 14:43:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 346. [2018-10-10 14:43:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 14:43:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 390 transitions. [2018-10-10 14:43:20,371 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 390 transitions. Word has length 30 [2018-10-10 14:43:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:20,372 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 390 transitions. [2018-10-10 14:43:20,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 390 transitions. [2018-10-10 14:43:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-10 14:43:20,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:20,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:20,375 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:20,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1040636351, now seen corresponding path program 1 times [2018-10-10 14:43:20,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:20,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:20,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:20,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:20,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:43:20,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:20,465 INFO L87 Difference]: Start difference. First operand 346 states and 390 transitions. Second operand 3 states. [2018-10-10 14:43:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:20,744 INFO L93 Difference]: Finished difference Result 611 states and 695 transitions. [2018-10-10 14:43:20,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:20,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-10 14:43:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:20,750 INFO L225 Difference]: With dead ends: 611 [2018-10-10 14:43:20,750 INFO L226 Difference]: Without dead ends: 600 [2018-10-10 14:43:20,751 INFO L605 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 [2018-10-10 14:43:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-10-10 14:43:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 557. [2018-10-10 14:43:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-10 14:43:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 650 transitions. [2018-10-10 14:43:20,796 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 650 transitions. Word has length 34 [2018-10-10 14:43:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:20,799 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 650 transitions. [2018-10-10 14:43:20,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 650 transitions. [2018-10-10 14:43:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 14:43:20,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:20,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:20,806 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:20,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:20,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1809141084, now seen corresponding path program 1 times [2018-10-10 14:43:20,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:20,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:20,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:21,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:21,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:21,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:21,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:21,076 INFO L87 Difference]: Start difference. First operand 557 states and 650 transitions. Second operand 5 states. [2018-10-10 14:43:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:21,376 INFO L93 Difference]: Finished difference Result 1089 states and 1258 transitions. [2018-10-10 14:43:21,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:21,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-10 14:43:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:21,385 INFO L225 Difference]: With dead ends: 1089 [2018-10-10 14:43:21,386 INFO L226 Difference]: Without dead ends: 1089 [2018-10-10 14:43:21,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-10-10 14:43:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 698. [2018-10-10 14:43:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-10 14:43:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 820 transitions. [2018-10-10 14:43:21,409 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 820 transitions. Word has length 38 [2018-10-10 14:43:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:21,409 INFO L481 AbstractCegarLoop]: Abstraction has 698 states and 820 transitions. [2018-10-10 14:43:21,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 820 transitions. [2018-10-10 14:43:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-10 14:43:21,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:21,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:21,412 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:21,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:21,413 INFO L82 PathProgramCache]: Analyzing trace with hash -565958905, now seen corresponding path program 1 times [2018-10-10 14:43:21,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:21,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:21,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:21,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:21,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:21,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:43:21,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:21,529 INFO L87 Difference]: Start difference. First operand 698 states and 820 transitions. Second operand 6 states. [2018-10-10 14:43:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:21,859 INFO L93 Difference]: Finished difference Result 1414 states and 1626 transitions. [2018-10-10 14:43:21,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:21,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-10 14:43:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:21,868 INFO L225 Difference]: With dead ends: 1414 [2018-10-10 14:43:21,868 INFO L226 Difference]: Without dead ends: 1414 [2018-10-10 14:43:21,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2018-10-10 14:43:21,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1061. [2018-10-10 14:43:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2018-10-10 14:43:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1247 transitions. [2018-10-10 14:43:21,896 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1247 transitions. Word has length 40 [2018-10-10 14:43:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:21,896 INFO L481 AbstractCegarLoop]: Abstraction has 1061 states and 1247 transitions. [2018-10-10 14:43:21,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1247 transitions. [2018-10-10 14:43:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 14:43:21,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:21,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:21,899 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:21,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:21,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1190606965, now seen corresponding path program 1 times [2018-10-10 14:43:21,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:21,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:21,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:21,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:22,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:22,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:22,048 INFO L87 Difference]: Start difference. First operand 1061 states and 1247 transitions. Second operand 7 states. [2018-10-10 14:43:22,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:22,304 INFO L93 Difference]: Finished difference Result 2159 states and 2493 transitions. [2018-10-10 14:43:22,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:22,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-10 14:43:22,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:22,315 INFO L225 Difference]: With dead ends: 2159 [2018-10-10 14:43:22,316 INFO L226 Difference]: Without dead ends: 2159 [2018-10-10 14:43:22,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2018-10-10 14:43:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 1593. [2018-10-10 14:43:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2018-10-10 14:43:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1865 transitions. [2018-10-10 14:43:22,358 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1865 transitions. Word has length 41 [2018-10-10 14:43:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:22,359 INFO L481 AbstractCegarLoop]: Abstraction has 1593 states and 1865 transitions. [2018-10-10 14:43:22,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1865 transitions. [2018-10-10 14:43:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 14:43:22,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:22,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:22,362 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:22,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2047573667, now seen corresponding path program 1 times [2018-10-10 14:43:22,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:22,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:22,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:22,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:22,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:22,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:22,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:22,745 INFO L87 Difference]: Start difference. First operand 1593 states and 1865 transitions. Second operand 6 states. [2018-10-10 14:43:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:24,256 INFO L93 Difference]: Finished difference Result 2602 states and 3000 transitions. [2018-10-10 14:43:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:43:24,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-10-10 14:43:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:24,269 INFO L225 Difference]: With dead ends: 2602 [2018-10-10 14:43:24,270 INFO L226 Difference]: Without dead ends: 2602 [2018-10-10 14:43:24,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2018-10-10 14:43:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 1592. [2018-10-10 14:43:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2018-10-10 14:43:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 1855 transitions. [2018-10-10 14:43:24,311 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 1855 transitions. Word has length 51 [2018-10-10 14:43:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:24,312 INFO L481 AbstractCegarLoop]: Abstraction has 1592 states and 1855 transitions. [2018-10-10 14:43:24,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1855 transitions. [2018-10-10 14:43:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 14:43:24,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:24,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:24,314 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:24,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash -949725660, now seen corresponding path program 1 times [2018-10-10 14:43:24,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:24,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:24,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:24,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:24,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:24,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:24,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:24,519 INFO L87 Difference]: Start difference. First operand 1592 states and 1855 transitions. Second operand 8 states. [2018-10-10 14:43:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:25,002 INFO L93 Difference]: Finished difference Result 1908 states and 2186 transitions. [2018-10-10 14:43:25,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:43:25,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-10-10 14:43:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:25,011 INFO L225 Difference]: With dead ends: 1908 [2018-10-10 14:43:25,011 INFO L226 Difference]: Without dead ends: 1908 [2018-10-10 14:43:25,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2018-10-10 14:43:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1591. [2018-10-10 14:43:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2018-10-10 14:43:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 1845 transitions. [2018-10-10 14:43:25,046 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 1845 transitions. Word has length 52 [2018-10-10 14:43:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:25,047 INFO L481 AbstractCegarLoop]: Abstraction has 1591 states and 1845 transitions. [2018-10-10 14:43:25,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1845 transitions. [2018-10-10 14:43:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 14:43:25,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:25,048 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:25,049 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:25,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:25,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1740692477, now seen corresponding path program 1 times [2018-10-10 14:43:25,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:25,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:25,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:25,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:25,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:25,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:25,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:25,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:25,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:25,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:25,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-10 14:43:25,904 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_main_#t~short8's outvar occurs in several conjuncts [(let ((.cse2 (= v_~pc4~0_2 1)) (.cse0 (= v_~S~0.base_2 0)) (.cse1 (= v_~S~0.offset_2 0))) (or (and (or (not .cse0) (not .cse1) (not .cse2)) |v_ULTIMATE.start_main_#t~short8_2|) (and (not |v_ULTIMATE.start_main_#t~short8_2|) .cse2 .cse0 .cse1)))] at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.addStatementsAndVariables(PathProgramDumper.java:634) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructTransitionStatements(PathProgramDumper.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.processTransition(PathProgramDumper.java:521) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructProcedureStatements(PathProgramDumper.java:489) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructNewImplementation(PathProgramDumper.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.(PathProgramDumper.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.doDump(PathProgramDumpController.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.reportPathProgram(PathProgramDumpController.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) 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:123) 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) [2018-10-10 14:43:25,911 INFO L168 Benchmark]: Toolchain (without parser) took 8385.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -361.8 MB). Peak memory consumption was 366.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,914 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:25,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:25,918 INFO L168 Benchmark]: Boogie Preprocessor took 129.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,919 INFO L168 Benchmark]: RCFGBuilder took 1303.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,922 INFO L168 Benchmark]: TraceAbstraction took 6379.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 359.3 MB). Peak memory consumption was 359.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,933 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 502.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1303.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6379.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 359.3 MB). Peak memory consumption was 359.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_main_#t~short8's outvar occurs in several conjuncts [(let ((.cse2 (= v_~pc4~0_2 1)) (.cse0 (= v_~S~0.base_2 0)) (.cse1 (= v_~S~0.offset_2 0))) (or (and (or (not .cse0) (not .cse1) (not .cse2)) |v_ULTIMATE.start_main_#t~short8_2|) (and (not |v_ULTIMATE.start_main_#t~short8_2|) .cse2 .cse0 .cse1)))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_main_#t~short8's outvar occurs in several conjuncts [(let ((.cse2 (= v_~pc4~0_2 1)) (.cse0 (= v_~S~0.base_2 0)) (.cse1 (= v_~S~0.offset_2 0))) (or (and (or (not .cse0) (not .cse1) (not .cse2)) |v_ULTIMATE.start_main_#t~short8_2|) (and (not |v_ULTIMATE.start_main_#t~short8_2|) .cse2 .cse0 .cse1)))]: de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...