/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/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:09:55,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:09:55,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:09:55,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:09:55,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:09:55,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:09:55,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:09:55,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:09:55,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:09:55,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:09:55,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:09:55,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:09:55,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:09:55,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:09:55,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:09:55,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:09:55,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:09:55,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:09:55,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:09:55,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:09:55,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:09:55,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:09:55,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:09:55,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:09:55,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:09:55,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:09:55,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:09:55,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:09:55,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:09:55,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:09:55,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:09:55,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:09:55,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:09:55,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:09:55,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:09:55,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:09:55,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:09:55,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:09:55,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:09:55,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:09:55,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:09:55,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:09:55,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:09:55,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:09:55,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:09:55,677 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:09:55,677 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:09:55,677 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:09:55,677 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:09:55,678 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:09:55,678 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:09:55,678 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:09:55,678 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:09:55,678 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:09:55,679 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:09:55,679 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:09:55,679 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:09:55,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:09:55,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:09:55,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:09:55,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:09:55,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:09:55,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:09:55,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:09:55,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:09:55,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:09:55,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:09:55,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:09:55,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:09:55,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:09:55,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:09:55,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:09:55,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:09:55,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:09:55,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:09:55,683 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:09:55,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:09:55,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:09:55,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:09:55,684 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:09:55,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:09:55,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:09:55,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:09:55,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:09:55,977 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:09:55,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_append_equal.i [2019-11-24 04:09:56,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85034753/7f4bac2414ba439d931ffd44a2aed496/FLAG82f70769f [2019-11-24 04:09:56,591 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:09:56,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_equal.i [2019-11-24 04:09:56,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85034753/7f4bac2414ba439d931ffd44a2aed496/FLAG82f70769f [2019-11-24 04:09:56,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85034753/7f4bac2414ba439d931ffd44a2aed496 [2019-11-24 04:09:56,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:09:56,879 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:09:56,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:09:56,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:09:56,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:09:56,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:09:56" (1/1) ... [2019-11-24 04:09:56,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117fe4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:56, skipping insertion in model container [2019-11-24 04:09:56,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:09:56" (1/1) ... [2019-11-24 04:09:56,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:09:56,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:09:57,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:09:57,411 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:09:57,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:09:57,551 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:09:57,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57 WrapperNode [2019-11-24 04:09:57,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:09:57,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:09:57,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:09:57,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:09:57,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:09:57,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:09:57,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:09:57,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:09:57,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (1/1) ... [2019-11-24 04:09:57,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:09:57,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:09:57,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:09:57,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:09:57,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (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-24 04:09:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 04:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 04:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 04:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 04:09:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 04:09:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 04:09:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 04:09:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:09:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:09:58,465 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:09:58,466 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-11-24 04:09:58,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:09:58 BoogieIcfgContainer [2019-11-24 04:09:58,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:09:58,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:09:58,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:09:58,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:09:58,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:09:56" (1/3) ... [2019-11-24 04:09:58,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52725dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:09:58, skipping insertion in model container [2019-11-24 04:09:58,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:09:57" (2/3) ... [2019-11-24 04:09:58,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52725dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:09:58, skipping insertion in model container [2019-11-24 04:09:58,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:09:58" (3/3) ... [2019-11-24 04:09:58,475 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2019-11-24 04:09:58,484 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:09:58,492 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 04:09:58,503 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 04:09:58,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:09:58,528 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:09:58,528 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:09:58,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:09:58,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:09:58,529 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:09:58,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:09:58,530 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:09:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-24 04:09:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:09:58,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:09:58,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:09:58,553 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:09:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:09:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash 528796504, now seen corresponding path program 1 times [2019-11-24 04:09:58,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:09:58,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217822549] [2019-11-24 04:09:58,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:09:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:09:58,826 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-24 04:09:58,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217822549] [2019-11-24 04:09:58,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:09:58,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:09:58,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463098902] [2019-11-24 04:09:58,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:09:58,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:09:58,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:09:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:09:58,849 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-24 04:09:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:09:58,893 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2019-11-24 04:09:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:09:58,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:09:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:09:58,905 INFO L225 Difference]: With dead ends: 45 [2019-11-24 04:09:58,905 INFO L226 Difference]: Without dead ends: 18 [2019-11-24 04:09:58,909 INFO L630 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 [2019-11-24 04:09:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-24 04:09:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-24 04:09:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-24 04:09:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-24 04:09:58,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-24 04:09:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:09:58,945 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-24 04:09:58,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:09:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-24 04:09:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:09:58,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:09:58,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:09:58,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:09:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:09:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1548127216, now seen corresponding path program 1 times [2019-11-24 04:09:58,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:09:58,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101489089] [2019-11-24 04:09:58,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:09:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:09:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:09:59,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101489089] [2019-11-24 04:09:59,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:09:59,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:09:59,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29412486] [2019-11-24 04:09:59,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:09:59,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:09:59,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:09:59,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:09:59,184 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 7 states. [2019-11-24 04:09:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:09:59,387 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-24 04:09:59,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:09:59,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-24 04:09:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:09:59,389 INFO L225 Difference]: With dead ends: 24 [2019-11-24 04:09:59,389 INFO L226 Difference]: Without dead ends: 17 [2019-11-24 04:09:59,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:09:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-24 04:09:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-24 04:09:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-24 04:09:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-24 04:09:59,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2019-11-24 04:09:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:09:59,401 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-24 04:09:59,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:09:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-24 04:09:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:09:59,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:09:59,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:09:59,403 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:09:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:09:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1060787107, now seen corresponding path program 1 times [2019-11-24 04:09:59,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:09:59,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420915519] [2019-11-24 04:09:59,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:09:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:09:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:09:59,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420915519] [2019-11-24 04:09:59,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384267679] [2019-11-24 04:09:59,687 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-24 04:09:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:09:59,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 91 conjunts are in the unsatisfiable core [2019-11-24 04:09:59,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:09:59,929 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-24 04:09:59,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-24 04:09:59,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:09:59,977 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.8 percent of original size [2019-11-24 04:09:59,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 04:09:59,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:35 [2019-11-24 04:10:00,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:00,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:00,237 INFO L343 Elim1Store]: treesize reduction 8, result has 89.9 percent of original size [2019-11-24 04:10:00,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 111 [2019-11-24 04:10:00,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:00,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:00,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:00,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 76 [2019-11-24 04:10:00,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:00,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:00,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:00,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 76 [2019-11-24 04:10:00,364 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:00,614 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-11-24 04:10:00,615 INFO L567 ElimStorePlain]: treesize reduction 72, result has 64.4 percent of original size [2019-11-24 04:10:00,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-24 04:10:00,616 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:132, output treesize:130 [2019-11-24 04:10:00,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:00,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:00,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2019-11-24 04:10:00,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:00,951 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-24 04:10:00,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:00,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:00,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2019-11-24 04:10:00,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:00,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:00,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2019-11-24 04:10:00,987 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:01,119 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-24 04:10:01,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:01,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2019-11-24 04:10:01,142 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:01,259 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-24 04:10:01,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:01,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-24 04:10:01,260 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:235, output treesize:191 [2019-11-24 04:10:01,449 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-24 04:10:01,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 04:10:01,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,732 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:01,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 153 [2019-11-24 04:10:01,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:01,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:01,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 117 [2019-11-24 04:10:01,777 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:01,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,818 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:01,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 121 [2019-11-24 04:10:01,820 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:01,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:01,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:01,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 114 [2019-11-24 04:10:01,863 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:02,062 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-24 04:10:02,064 INFO L567 ElimStorePlain]: treesize reduction 198, result has 46.6 percent of original size [2019-11-24 04:10:02,096 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 86 treesize of output 74 [2019-11-24 04:10:02,097 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:02,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2019-11-24 04:10:02,105 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:02,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:02,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 04:10:02,179 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:408, output treesize:131 [2019-11-24 04:10:02,304 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_73|, |v_#memory_int_76|], 4=[|v_#memory_$Pointer$.base_69|, |v_#memory_$Pointer$.offset_69|]} [2019-11-24 04:10:02,311 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-24 04:10:02,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:02,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2019-11-24 04:10:02,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:02,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:02,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2019-11-24 04:10:02,433 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:02,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:02,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,489 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 47 treesize of output 31 [2019-11-24 04:10:02,490 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:02,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:02,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 04:10:02,527 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:131, output treesize:67 [2019-11-24 04:10:02,691 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_77|, |v_#memory_int_74|], 19=[|v_#memory_$Pointer$.offset_70|, |v_#memory_$Pointer$.base_70|]} [2019-11-24 04:10:02,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-24 04:10:02,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:02,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:02,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 15 [2019-11-24 04:10:02,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:02,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:02,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:02,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 04:10:02,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 58 [2019-11-24 04:10:02,896 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 04:10:03,016 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-24 04:10:03,017 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.1 percent of original size [2019-11-24 04:10:03,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:03,202 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-24 04:10:03,203 INFO L343 Elim1Store]: treesize reduction 78, result has 65.0 percent of original size [2019-11-24 04:10:03,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 212 [2019-11-24 04:10:03,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 04:10:03,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:10:03,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 04:10:03,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:10:03,526 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.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-24 04:10:03,532 INFO L168 Benchmark]: Toolchain (without parser) took 6653.83 ms. Allocated memory was 144.7 MB in the beginning and 287.8 MB in the end (delta: 143.1 MB). Free memory was 100.8 MB in the beginning and 113.8 MB in the end (delta: -13.0 MB). Peak memory consumption was 130.1 MB. Max. memory is 7.1 GB. [2019-11-24 04:10:03,533 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 04:10:03,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.01 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 166.6 MB in the end (delta: -65.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-11-24 04:10:03,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.59 ms. Allocated memory is still 202.4 MB. Free memory was 166.6 MB in the beginning and 163.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:10:03,536 INFO L168 Benchmark]: Boogie Preprocessor took 45.00 ms. Allocated memory is still 202.4 MB. Free memory was 163.6 MB in the beginning and 161.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:10:03,536 INFO L168 Benchmark]: RCFGBuilder took 789.03 ms. Allocated memory is still 202.4 MB. Free memory was 161.6 MB in the beginning and 118.0 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-11-24 04:10:03,537 INFO L168 Benchmark]: TraceAbstraction took 5062.26 ms. Allocated memory was 202.4 MB in the beginning and 287.8 MB in the end (delta: 85.5 MB). Free memory was 117.0 MB in the beginning and 113.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:10:03,542 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 672.01 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 166.6 MB in the end (delta: -65.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.59 ms. Allocated memory is still 202.4 MB. Free memory was 166.6 MB in the beginning and 163.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.00 ms. Allocated memory is still 202.4 MB. Free memory was 163.6 MB in the beginning and 161.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.03 ms. Allocated memory is still 202.4 MB. Free memory was 161.6 MB in the beginning and 118.0 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5062.26 ms. Allocated memory was 202.4 MB in the beginning and 287.8 MB in the end (delta: 85.5 MB). Free memory was 117.0 MB in the beginning and 113.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 88.7 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...