java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:04:11,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:04:11,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:04:11,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:04:11,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:04:11,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:04:11,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:04:11,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:04:11,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:04:11,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:04:11,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:04:11,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:04:11,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:04:11,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:04:11,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:04:11,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:04:11,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:04:11,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:04:11,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:04:11,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:04:11,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:04:11,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:04:11,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:04:11,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:04:11,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:04:11,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:04:11,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:04:11,494 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:04:11,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:04:11,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:04:11,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:04:11,495 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 01:04:11,504 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:04:11,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:04:11,505 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:04:11,505 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:04:11,505 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:04:11,505 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:04:11,505 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:04:11,505 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:04:11,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:04:11,506 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:04:11,506 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:04:11,506 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:04:11,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:04:11,506 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:04:11,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:04:11,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:04:11,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:04:11,507 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:04:11,507 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:04:11,507 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:04:11,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:04:11,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:04:11,508 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:04:11,508 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:04:11,508 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:04:11,508 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:04:11,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:04:11,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:04:11,509 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:04:11,509 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:04:11,509 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:04:11,509 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:04:11,509 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:04:11,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:04:11,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:04:11,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:04:11,510 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:04:11,510 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:04:11,510 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:04:11,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:04:11,554 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:04:11,557 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:04:11,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:04:11,558 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:04:11,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:04:11,723 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:04:11,726 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:04:11,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:04:11,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:04:11,732 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:04:11,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eeba7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11, skipping insertion in model container [2018-01-21 01:04:11,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,752 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:04:11,793 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:04:11,915 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:04:11,938 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:04:11,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11 WrapperNode [2018-01-21 01:04:11,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:04:11,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:04:11,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:04:11,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:04:11,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (1/1) ... [2018-01-21 01:04:11,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:04:11,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:04:11,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:04:11,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:04:11,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (1/1) ... No working directory specified, using /storage/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-01-21 01:04:12,041 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:04:12,041 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:04:12,041 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:04:12,042 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:04:12,043 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:04:12,043 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:04:12,043 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:04:12,292 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:04:12,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:04:12 BoogieIcfgContainer [2018-01-21 01:04:12,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:04:12,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:04:12,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:04:12,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:04:12,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:04:11" (1/3) ... [2018-01-21 01:04:12,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce05999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:04:12, skipping insertion in model container [2018-01-21 01:04:12,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:04:11" (2/3) ... [2018-01-21 01:04:12,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce05999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:04:12, skipping insertion in model container [2018-01-21 01:04:12,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:04:12" (3/3) ... [2018-01-21 01:04:12,299 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:04:12,309 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:04:12,317 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:04:12,364 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:12,364 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:12,364 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:12,364 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:12,364 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:12,364 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:12,364 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:12,365 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:04:12,365 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 01:04:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:04:12,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:12,388 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:04:12,388 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:04:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 186463, now seen corresponding path program 1 times [2018-01-21 01:04:12,394 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:12,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:12,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:12,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:12,436 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:04:12,488 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:04:12,494 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:04:12,501 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:04:12,501 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:04:12,501 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:04:12,501 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:04:12,502 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:04:12,502 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:04:12,502 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:04:12,502 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:04:12,502 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:04:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 01:04:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 01:04:12,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:12,508 INFO L322 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] [2018-01-21 01:04:12,508 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash 128587636, now seen corresponding path program 1 times [2018-01-21 01:04:12,509 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:12,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:12,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:12,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:12,511 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:12,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:12,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:12,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:04:12,593 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:12,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:04:12,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:04:12,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:04:12,705 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 01:04:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:12,733 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2018-01-21 01:04:12,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:04:12,735 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 01:04:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:12,747 INFO L225 Difference]: With dead ends: 119 [2018-01-21 01:04:12,747 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 01:04:12,750 INFO L525 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-01-21 01:04:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 01:04:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-21 01:04:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 01:04:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-21 01:04:12,782 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2018-01-21 01:04:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:12,783 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-21 01:04:12,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:04:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-21 01:04:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 01:04:12,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:12,784 INFO L322 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] [2018-01-21 01:04:12,784 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash 724775855, now seen corresponding path program 1 times [2018-01-21 01:04:12,785 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:12,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:12,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:12,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:12,786 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:12,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:13,408 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 26 DAG size of output 20 [2018-01-21 01:04:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:13,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:13,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-21 01:04:13,652 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:13,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 01:04:13,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 01:04:13,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-21 01:04:13,655 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 12 states. [2018-01-21 01:04:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:14,209 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2018-01-21 01:04:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 01:04:14,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-01-21 01:04:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:14,214 INFO L225 Difference]: With dead ends: 128 [2018-01-21 01:04:14,215 INFO L226 Difference]: Without dead ends: 114 [2018-01-21 01:04:14,217 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-01-21 01:04:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-21 01:04:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2018-01-21 01:04:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-21 01:04:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-21 01:04:14,229 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 32 [2018-01-21 01:04:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:14,229 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-21 01:04:14,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 01:04:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-21 01:04:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-21 01:04:14,231 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:14,231 INFO L322 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-01-21 01:04:14,232 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1505215911, now seen corresponding path program 1 times [2018-01-21 01:04:14,232 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:14,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:14,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:14,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:14,234 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:14,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:14,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:14,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 01:04:14,289 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:14,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 01:04:14,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 01:04:14,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 01:04:14,290 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 3 states. [2018-01-21 01:04:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:14,338 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2018-01-21 01:04:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 01:04:14,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-01-21 01:04:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:14,343 INFO L225 Difference]: With dead ends: 175 [2018-01-21 01:04:14,344 INFO L226 Difference]: Without dead ends: 123 [2018-01-21 01:04:14,344 INFO L525 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-01-21 01:04:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-21 01:04:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-01-21 01:04:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 01:04:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-01-21 01:04:14,355 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2018-01-21 01:04:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:14,355 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-01-21 01:04:14,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 01:04:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-01-21 01:04:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 01:04:14,357 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:14,357 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:04:14,357 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash 977083296, now seen corresponding path program 1 times [2018-01-21 01:04:14,358 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:14,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:14,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:14,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:14,359 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:14,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:14,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:04:14,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-21 01:04:14,874 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:04:14,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 01:04:14,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 01:04:14,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-21 01:04:14,874 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 13 states. [2018-01-21 01:04:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:15,245 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-01-21 01:04:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 01:04:15,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-01-21 01:04:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:15,248 INFO L225 Difference]: With dead ends: 159 [2018-01-21 01:04:15,248 INFO L226 Difference]: Without dead ends: 129 [2018-01-21 01:04:15,249 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-01-21 01:04:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-21 01:04:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2018-01-21 01:04:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 01:04:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-01-21 01:04:15,259 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-01-21 01:04:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:15,259 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-01-21 01:04:15,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 01:04:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-01-21 01:04:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 01:04:15,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:15,261 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:04:15,261 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1973007188, now seen corresponding path program 1 times [2018-01-21 01:04:15,262 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:15,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:15,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:15,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:15,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:15,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:15,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:15,717 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:04:15,718 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-01-21 01:04:15,720 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [8], [10], [13], [15], [16], [17], [18], [19], [20], [21], [37], [39], [43], [48], [52], [61], [62], [63], [67], [72], [76], [84], [86], [89], [128], [129], [133], [135], [138], [147], [148], [149], [151], [152], [157], [158], [159], [160], [161] [2018-01-21 01:04:15,767 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:04:15,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:04:16,338 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:04:16,339 INFO L268 AbstractInterpreter]: Visited 44 different actions 104 times. Merged at 34 different actions 59 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-01-21 01:04:16,353 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:04:16,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:16,353 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-21 01:04:16,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:16,369 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:04:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:16,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:04:16,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 01:04:16,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-21 01:04:16,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:16,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:16,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-21 01:04:16,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-21 01:04:16,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 01:04:16,713 INFO L477 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:04:16,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 01:04:16,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:04:16,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-01-21 01:04:16,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-21 01:04:16,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 01:04:16,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-01-21 01:04:16,867 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:16,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-01-21 01:04:16,872 INFO L477 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:04:16,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:25 [2018-01-21 01:04:16,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-21 01:04:16,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:16,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:04:16,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2018-01-21 01:04:16,979 INFO L477 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 19 treesize of output 12 [2018-01-21 01:04:16,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-21 01:04:16,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:16,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-01-21 01:04:17,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-01-21 01:04:17,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:31 [2018-01-21 01:04:17,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-01-21 01:04:17,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:04:17,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-01-21 01:04:17,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,107 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2018-01-21 01:04:17,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-21 01:04:17,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:04:17,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:17,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:17,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:17,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2018-01-21 01:04:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:17,231 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:04:17,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,398 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,406 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 40 treesize of output 24 [2018-01-21 01:04:17,436 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-21 01:04:17,439 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:17,448 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:43, output treesize:44 [2018-01-21 01:04:17,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,669 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,674 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:17,676 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,680 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,681 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,686 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:17,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-01-21 01:04:17,703 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:88, output treesize:63 [2018-01-21 01:04:18,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-21 01:04:18,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 01:04:18,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:18,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 49 [2018-01-21 01:04:18,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-01-21 01:04:18,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:18,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 48 [2018-01-21 01:04:18,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-21 01:04:18,321 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:18,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-21 01:04:18,361 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:18,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-01-21 01:04:18,364 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:18,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2018-01-21 01:04:18,413 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-01-21 01:04:18,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-01-21 01:04:18,425 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-01-21 01:04:18,453 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:04:18,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-01-21 01:04:18,522 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:18,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 37 [2018-01-21 01:04:18,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:04:18,717 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:18,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-01-21 01:04:18,750 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:18,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-01-21 01:04:18,760 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:18,783 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:04:18,885 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-01-21 01:04:18,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-01-21 01:04:18,923 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:18,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-21 01:04:18,925 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:18,933 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:19,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-01-21 01:04:19,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2018-01-21 01:04:19,256 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2018-01-21 01:04:19,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-01-21 01:04:19,263 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:19,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2018-01-21 01:04:19,278 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-01-21 01:04:19,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-01-21 01:04:19,337 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:19,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-21 01:04:19,339 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,369 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:04:19,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 45 [2018-01-21 01:04:19,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-01-21 01:04:19,480 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 3 xjuncts. [2018-01-21 01:04:19,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2018-01-21 01:04:19,492 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 3 xjuncts. [2018-01-21 01:04:19,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-01-21 01:04:19,534 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:19,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-01-21 01:04:19,541 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:19,574 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:04:19,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 16 [2018-01-21 01:04:19,648 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 19 [2018-01-21 01:04:19,649 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-01-21 01:04:19,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-01-21 01:04:19,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-01-21 01:04:19,733 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,743 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-01-21 01:04:19,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-21 01:04:19,756 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,758 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:19,761 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:19,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-21 01:04:19,762 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,781 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:19,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-01-21 01:04:19,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 6 [2018-01-21 01:04:19,823 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,830 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:19,831 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:19,832 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:19,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-01-21 01:04:19,833 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,841 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:04:19,857 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:04:19,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2018-01-21 01:04:19,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 16 [2018-01-21 01:04:19,865 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-01-21 01:04:19,874 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-21 01:04:19,882 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:19,887 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:19,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-01-21 01:04:19,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-21 01:04:19,929 INFO L202 ElimStorePlain]: Needed 44 recursive calls to eliminate 2 variables, input treesize:44, output treesize:57 [2018-01-21 01:04:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:20,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:20,175 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:04:20,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:20,179 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:04:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:20,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:04:20,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 01:04:20,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:04:20,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:20,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:20,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:20,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:40 [2018-01-21 01:04:20,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:20,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-21 01:04:20,894 INFO L477 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:04:20,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:20,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:20,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:20,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-01-21 01:04:20,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:20,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-21 01:04:20,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:20,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:04:20,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:20,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:21,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:21,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:48 [2018-01-21 01:04:21,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:21,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2018-01-21 01:04:21,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:21,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-21 01:04:21,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:21,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:21,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:21,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:45 [2018-01-21 01:04:21,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:21,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-01-21 01:04:22,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 39 treesize of output 26 [2018-01-21 01:04:22,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:04:22,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-21 01:04:22,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:04:22,052 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,057 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-01-21 01:04:22,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-21 01:04:22,079 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,087 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:22,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-01-21 01:04:22,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-01-21 01:04:22,110 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:04:22,120 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,128 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:22,141 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:129, output treesize:55 [2018-01-21 01:04:22,145 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= |c_main_#t~mem20.base| 0)) (exists ((main_~head~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~head~5.base 1))) (and (= |c_#valid| (store .cse0 |c_main_#t~mem20.base| 1)) (= (select .cse0 |c_main_#t~mem20.base|) 0) (= 0 (select |c_old(#valid)| main_~head~5.base)))))) (and (not (= 0 |c_main_#t~mem20.offset|)) (exists ((v_prenex_35 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_35 1))) (and (= 0 (select .cse1 |c_main_#t~mem20.base|)) (= (store .cse1 |c_main_#t~mem20.base| 1) |c_#valid|) (= 0 (select |c_old(#valid)| v_prenex_35))))))) is different from true [2018-01-21 01:04:22,256 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~5.base Int) (main_~head~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~head~5.base 1))) (and (= 0 (select .cse0 main_~x~5.base)) (not (= 0 main_~x~5.base)) (= 0 (select |c_old(#valid)| main_~head~5.base)) (= (store .cse0 main_~x~5.base 0) |c_#valid|)))) is different from true [2018-01-21 01:04:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:22,275 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:04:22,552 WARN L146 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 93 DAG size of output 88 [2018-01-21 01:04:22,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-21 01:04:22,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-21 01:04:22,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:22,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-01-21 01:04:22,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:22,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:22,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:22,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:39 [2018-01-21 01:04:23,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:23,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:23,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:23,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:23,036 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:23,043 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:23,045 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:23,050 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:23,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-01-21 01:04:23,076 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:59, output treesize:202 [2018-01-21 01:04:23,079 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_main_~head~5.base c_main_~x~5.base)) (.cse1 (= c_main_~head~5.offset (+ c_main_~x~5.offset 4)))) (and (or (not .cse0) (not .cse1) (forall ((v_DerPreprocessor_18 Int)) (or (= v_DerPreprocessor_18 0) (not (= (store |c_#valid| v_DerPreprocessor_18 0) |c_old(#valid)|))))) (or (forall ((v_DerPreprocessor_26 Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| c_main_~x~5.base (store (select |c_#memory_$Pointer$.base| c_main_~x~5.base) (+ c_main_~x~5.offset 4) v_DerPreprocessor_26)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= .cse2 0) (not (= (store |c_#valid| .cse2 0) |c_old(#valid)|))))) .cse1 .cse0) (or (forall ((v_DerPreprocessor_22 Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| c_main_~x~5.base (store (select |c_#memory_$Pointer$.base| c_main_~x~5.base) (+ c_main_~x~5.offset 4) v_DerPreprocessor_22)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= .cse3 0) (not (= (store |c_#valid| .cse3 0) |c_old(#valid)|))))) .cse1 .cse0) (or .cse0 (forall ((v_prenex_36 Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| c_main_~x~5.base (store (select |c_#memory_$Pointer$.base| c_main_~x~5.base) (+ c_main_~x~5.offset 4) v_prenex_36)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= .cse4 0) (not (= (store |c_#valid| .cse4 0) |c_old(#valid)|)))))) (or (forall ((v_prenex_37 Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| c_main_~x~5.base (store (select |c_#memory_$Pointer$.base| c_main_~x~5.base) (+ c_main_~x~5.offset 4) v_prenex_37)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= .cse5 0) (not (= |c_old(#valid)| (store |c_#valid| .cse5 0)))))) .cse1))) is different from false [2018-01-21 01:04:23,098 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_main_~head~5.base c_main_~x~5.base))) (and (or (forall ((v_DerPreprocessor_22 Int) (v_prenex_39 Int)) (let ((.cse0 (+ v_prenex_39 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| c_main_~x~5.base (store (store (select |c_#memory_$Pointer$.base| c_main_~x~5.base) v_prenex_39 c_main_~head~5.base) .cse0 v_DerPreprocessor_22)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= c_main_~head~5.offset .cse0) (= 0 .cse1) (not (= |c_old(#valid)| (store |c_#valid| .cse1 0))))))) .cse2) (or .cse2 (forall ((v_prenex_36 Int) (main_~x~5.offset Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| c_main_~x~5.base (store (store (select |c_#memory_$Pointer$.base| c_main_~x~5.base) main_~x~5.offset c_main_~head~5.base) (+ main_~x~5.offset 4) v_prenex_36)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= 0 .cse3) (not (= |c_old(#valid)| (store |c_#valid| .cse3 0))))))) (or (not .cse2) (forall ((v_DerPreprocessor_18 Int)) (or (= v_DerPreprocessor_18 0) (not (= (store |c_#valid| v_DerPreprocessor_18 0) |c_old(#valid)|))))) (forall ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse5 (+ v_prenex_38 4))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| c_main_~x~5.base (store (store (select |c_#memory_$Pointer$.base| c_main_~x~5.base) v_prenex_38 c_main_~head~5.base) .cse5 v_prenex_37)) c_main_~head~5.base) c_main_~head~5.offset))) (or (not (= |c_old(#valid)| (store |c_#valid| .cse4 0))) (= c_main_~head~5.offset .cse5) (= .cse4 0))))) (or (forall ((v_DerPreprocessor_26 Int) (v_prenex_40 Int)) (let ((.cse6 (+ v_prenex_40 4))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| c_main_~x~5.base (store (store (select |c_#memory_$Pointer$.base| c_main_~x~5.base) v_prenex_40 c_main_~head~5.base) .cse6 v_DerPreprocessor_26)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= c_main_~head~5.offset .cse6) (= .cse7 0) (not (= |c_old(#valid)| (store |c_#valid| .cse7 0))))))) .cse2))) is different from false [2018-01-21 01:04:23,107 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_main_#t~mem6.base| c_main_~head~5.base))) (and (or (forall ((v_DerPreprocessor_26 Int) (v_prenex_40 Int)) (let ((.cse1 (+ v_prenex_40 4))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) v_prenex_40 c_main_~head~5.base) .cse1 v_DerPreprocessor_26)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= 0 .cse0) (= c_main_~head~5.offset .cse1) (not (= (store |c_#valid| .cse0 0) |c_old(#valid)|)))))) .cse2) (or (forall ((v_prenex_36 Int) (main_~x~5.offset Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) main_~x~5.offset c_main_~head~5.base) (+ main_~x~5.offset 4) v_prenex_36)) c_main_~head~5.base) c_main_~head~5.offset))) (or (not (= (store |c_#valid| .cse3 0) |c_old(#valid)|)) (= .cse3 0)))) .cse2) (or (not .cse2) (forall ((v_DerPreprocessor_18 Int)) (or (= v_DerPreprocessor_18 0) (not (= (store |c_#valid| v_DerPreprocessor_18 0) |c_old(#valid)|))))) (or (forall ((v_DerPreprocessor_22 Int) (v_prenex_39 Int)) (let ((.cse4 (+ v_prenex_39 4))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) v_prenex_39 c_main_~head~5.base) .cse4 v_DerPreprocessor_22)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= c_main_~head~5.offset .cse4) (not (= (store |c_#valid| .cse5 0) |c_old(#valid)|)) (= .cse5 0))))) .cse2) (forall ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse6 (+ v_prenex_38 4))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) v_prenex_38 c_main_~head~5.base) .cse6 v_prenex_37)) c_main_~head~5.base) c_main_~head~5.offset))) (or (= c_main_~head~5.offset .cse6) (not (= (store |c_#valid| .cse7 0) |c_old(#valid)|)) (= 0 .cse7))))))) is different from false [2018-01-21 01:04:23,128 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_main_~head~5.base (select (select |c_#memory_$Pointer$.base| c_main_~x~5.base) c_main_~x~5.offset)))) (and (or (forall ((v_DerPreprocessor_26 Int) (v_prenex_40 Int)) (let ((.cse0 (+ v_prenex_40 4))) (let ((.cse1 (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~x~5.base) c_main_~x~5.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (store (select |c_#memory_$Pointer$.base| .cse2) v_prenex_40 c_main_~head~5.base) .cse0 v_DerPreprocessor_26))) c_main_~head~5.base) c_main_~head~5.offset))) (or (= c_main_~head~5.offset .cse0) (= 0 .cse1) (not (= (store |c_#valid| .cse1 0) |c_old(#valid)|)))))) .cse3) (or .cse3 (forall ((v_prenex_36 Int) (v_subst_1 Int)) (let ((.cse4 (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_main_~x~5.base) c_main_~x~5.offset))) (store |c_#memory_$Pointer$.base| .cse5 (store (store (select |c_#memory_$Pointer$.base| .cse5) v_subst_1 c_main_~head~5.base) (+ v_subst_1 4) v_prenex_36))) c_main_~head~5.base) c_main_~head~5.offset))) (or (= .cse4 0) (not (= |c_old(#valid)| (store |c_#valid| .cse4 0))))))) (or .cse3 (forall ((v_DerPreprocessor_22 Int) (v_prenex_39 Int)) (let ((.cse6 (+ v_prenex_39 4))) (let ((.cse7 (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_main_~x~5.base) c_main_~x~5.offset))) (store |c_#memory_$Pointer$.base| .cse8 (store (store (select |c_#memory_$Pointer$.base| .cse8) v_prenex_39 c_main_~head~5.base) .cse6 v_DerPreprocessor_22))) c_main_~head~5.base) c_main_~head~5.offset))) (or (= c_main_~head~5.offset .cse6) (not (= |c_old(#valid)| (store |c_#valid| .cse7 0))) (= 0 .cse7)))))) (or (not .cse3) (forall ((v_DerPreprocessor_18 Int)) (or (= v_DerPreprocessor_18 0) (not (= (store |c_#valid| v_DerPreprocessor_18 0) |c_old(#valid)|))))) (forall ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse10 (+ v_prenex_38 4))) (let ((.cse9 (select (select (let ((.cse11 (select (select |c_#memory_$Pointer$.base| c_main_~x~5.base) c_main_~x~5.offset))) (store |c_#memory_$Pointer$.base| .cse11 (store (store (select |c_#memory_$Pointer$.base| .cse11) v_prenex_38 c_main_~head~5.base) .cse10 v_prenex_37))) c_main_~head~5.base) c_main_~head~5.offset))) (or (= 0 .cse9) (not (= (store |c_#valid| .cse9 0) |c_old(#valid)|)) (= c_main_~head~5.offset .cse10))))))) is different from false [2018-01-21 01:04:23,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 62 [2018-01-21 01:04:23,262 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 40 DAG size of output 26 [2018-01-21 01:04:23,269 INFO L477 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 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 01:04:23,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:23,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2018-01-21 01:04:23,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2018-01-21 01:04:23,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:23,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-21 01:04:23,370 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:23,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 14 [2018-01-21 01:04:23,400 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:23,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:23,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:23,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 62 [2018-01-21 01:04:23,905 INFO L477 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 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 01:04:23,905 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:23,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2018-01-21 01:04:23,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2018-01-21 01:04:23,942 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:23,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-21 01:04:23,965 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:23,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 14 [2018-01-21 01:04:23,997 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:24,017 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:24,048 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:24,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 57 [2018-01-21 01:04:24,200 INFO L477 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 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 01:04:24,201 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2018-01-21 01:04:24,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 20 [2018-01-21 01:04:24,215 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:24,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-21 01:04:24,228 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2018-01-21 01:04:24,243 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:24,258 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:24,275 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:24,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2018-01-21 01:04:24,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 01:04:24,484 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2018-01-21 01:04:24,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2018-01-21 01:04:24,598 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:04:24,598 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,598 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:04:24,599 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-01-21 01:04:24,624 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:24,640 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:24,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 44 treesize of output 44 [2018-01-21 01:04:24,685 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:04:24,686 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-01-21 01:04:24,693 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:24,693 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:04:24,693 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,710 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:24,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-01-21 01:04:24,738 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,759 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:24,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-01-21 01:04:24,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2018-01-21 01:04:24,773 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:24,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 23 [2018-01-21 01:04:24,804 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:24,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-01-21 01:04:24,824 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,842 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:24,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 53 [2018-01-21 01:04:24,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-21 01:04:24,864 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 37 treesize of output 33 [2018-01-21 01:04:24,907 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:24,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 33 treesize of output 36 [2018-01-21 01:04:24,969 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:04:24,969 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:24,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-01-21 01:04:24,975 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:24,984 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:25,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 60 [2018-01-21 01:04:25,297 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 123 DAG size of output 99 [2018-01-21 01:04:25,300 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,301 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-01-21 01:04:25,302 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:25,447 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,448 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2018-01-21 01:04:25,453 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:25,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-21 01:04:25,532 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:25,604 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,604 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-01-21 01:04:25,605 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:25,674 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,675 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,676 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-01-21 01:04:25,676 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:25,735 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,738 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:25,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-01-21 01:04:25,739 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:25,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-21 01:04:25,794 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:25,847 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, 7 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-01-21 01:04:25,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 36 [2018-01-21 01:04:25,988 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:26,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 40 treesize of output 43 [2018-01-21 01:04:26,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-01-21 01:04:26,222 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:26,223 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:04:26,223 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:26,238 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:26,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 36 treesize of output 44 [2018-01-21 01:04:26,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-01-21 01:04:26,440 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:26,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-01-21 01:04:26,447 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:26,447 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-01-21 01:04:26,447 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:26,488 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:26,490 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:26,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 39 [2018-01-21 01:04:26,499 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-01-21 01:04:26,534 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:04:26,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-01-21 01:04:26,857 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:26,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-01-21 01:04:26,866 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:27,246 INFO L267 ElimStorePlain]: Start of recursive call 36: 8 dim-1 vars, End of recursive call: 10 dim-0 vars, and 13 xjuncts. [2018-01-21 01:04:27,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 54 [2018-01-21 01:04:27,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 58 [2018-01-21 01:04:27,525 WARN L146 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 56 DAG size of output 51 [2018-01-21 01:04:27,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-01-21 01:04:27,528 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:27,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2018-01-21 01:04:27,586 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:27,656 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:27,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-21 01:04:27,725 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:27,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-01-21 01:04:27,729 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:27,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 46 treesize of output 63 [2018-01-21 01:04:28,212 WARN L146 SmtUtils]: Spent 388ms on a formula simplification. DAG size of input: 91 DAG size of output 82 [2018-01-21 01:04:28,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2018-01-21 01:04:28,216 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:28,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2018-01-21 01:04:28,688 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:28,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-01-21 01:04:28,806 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:28,848 INFO L267 ElimStorePlain]: Start of recursive call 67: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:28,929 INFO L267 ElimStorePlain]: Start of recursive call 61: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 01:04:30,595 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 18 xjuncts. [2018-01-21 01:04:37,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 23 dim-0 vars, and 26 xjuncts. [2018-01-21 01:04:37,880 INFO L202 ElimStorePlain]: Needed 70 recursive calls to eliminate 13 variables, input treesize:348, output treesize:476 [2018-01-21 01:04:38,872 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_10| Int) (|v_main_#t~malloc4.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_10| 1))) (or (not (= (store .cse0 |v_main_#t~malloc4.base_12| 0) |c_old(#valid)|)) (not (= (select |c_#valid| |v_main_#t~malloc0.base_10|) 0)) (= |v_main_#t~malloc4.base_12| 0) (not (= (select .cse0 |v_main_#t~malloc4.base_12|) 0))))) is different from false [2018-01-21 01:04:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:38,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:04:38,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15, 19, 19] total 73 [2018-01-21 01:04:38,903 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:04:38,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-21 01:04:38,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-21 01:04:38,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=3926, Unknown=44, NotChecked=938, Total=5256 [2018-01-21 01:04:38,906 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 28 states. [2018-01-21 01:04:41,660 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-01-21 01:04:41,943 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 50 DAG size of output 47 [2018-01-21 01:04:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:44,074 INFO L93 Difference]: Finished difference Result 235 states and 258 transitions. [2018-01-21 01:04:44,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-21 01:04:44,075 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-01-21 01:04:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:44,077 INFO L225 Difference]: With dead ends: 235 [2018-01-21 01:04:44,077 INFO L226 Difference]: Without dead ends: 226 [2018-01-21 01:04:44,079 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 118 SyntacticMatches, 9 SemanticMatches, 97 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=961, Invalid=7395, Unknown=44, NotChecked=1302, Total=9702 [2018-01-21 01:04:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-21 01:04:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 143. [2018-01-21 01:04:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-21 01:04:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-01-21 01:04:44,094 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 46 [2018-01-21 01:04:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:44,095 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-01-21 01:04:44,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-21 01:04:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-01-21 01:04:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 01:04:44,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:44,097 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:04:44,097 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash 217316508, now seen corresponding path program 1 times [2018-01-21 01:04:44,098 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:44,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:44,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:44,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:44,099 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:44,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:04:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:44,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:44,908 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:04:44,909 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-21 01:04:44,909 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [8], [10], [13], [61], [62], [63], [67], [72], [76], [84], [86], [89], [91], [95], [96], [97], [98], [103], [104], [105], [106], [107], [113], [117], [123], [124], [128], [129], [133], [135], [138], [147], [148], [149], [151], [152], [157], [158], [159], [160], [161] [2018-01-21 01:04:44,911 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:04:44,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:04:45,182 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) 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:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 01:04:45,186 INFO L168 Benchmark]: Toolchain (without parser) took 33462.73 ms. Allocated memory was 302.0 MB in the beginning and 659.0 MB in the end (delta: 357.0 MB). Free memory was 260.1 MB in the beginning and 407.8 MB in the end (delta: -147.6 MB). Peak memory consumption was 209.4 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:45,187 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 302.0 MB. Free memory is still 266.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:04:45,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.76 ms. Allocated memory is still 302.0 MB. Free memory was 259.1 MB in the beginning and 247.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:45,187 INFO L168 Benchmark]: Boogie Preprocessor took 41.59 ms. Allocated memory is still 302.0 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:45,188 INFO L168 Benchmark]: RCFGBuilder took 303.17 ms. Allocated memory is still 302.0 MB. Free memory was 245.1 MB in the beginning and 223.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:45,188 INFO L168 Benchmark]: TraceAbstraction took 32891.30 ms. Allocated memory was 302.0 MB in the beginning and 659.0 MB in the end (delta: 357.0 MB). Free memory was 223.1 MB in the beginning and 407.8 MB in the end (delta: -184.6 MB). Peak memory consumption was 172.4 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:45,190 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 302.0 MB. Free memory is still 266.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.76 ms. Allocated memory is still 302.0 MB. Free memory was 259.1 MB in the beginning and 247.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.59 ms. Allocated memory is still 302.0 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 303.17 ms. Allocated memory is still 302.0 MB. Free memory was 245.1 MB in the beginning and 223.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 32891.30 ms. Allocated memory was 302.0 MB in the beginning and 659.0 MB in the end (delta: 357.0 MB). Free memory was 223.1 MB in the beginning and 407.8 MB in the end (delta: -184.6 MB). Peak memory consumption was 172.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 43 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 478 LocStat_NO_SUPPORTING_DISEQUALITIES : 120 LocStat_NO_DISJUNCTIONS : -86 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 48 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 77 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 53 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.604765 RENAME_VARIABLES(MILLISECONDS) : 0.020380 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.404382 PROJECTAWAY(MILLISECONDS) : 3.253195 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001259 DISJOIN(MILLISECONDS) : 0.519665 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.037878 ADD_EQUALITY(MILLISECONDS) : 0.028399 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009257 #CONJOIN_DISJUNCTIVE : 177 #RENAME_VARIABLES : 347 #UNFREEZE : 0 #CONJOIN : 286 #PROJECTAWAY : 240 #ADD_WEAK_EQUALITY : 42 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 325 #ADD_EQUALITY : 96 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 65 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-04-45-199.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-04-45-199.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-04-45-199.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-circular_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-04-45-199.csv Received shutdown request...