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-buckets_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:03:57,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:03:57,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:03:57,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:03:57,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:03:57,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:03:57,046 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:03:57,048 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:03:57,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:03:57,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:03:57,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:03:57,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:03:57,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:03:57,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:03:57,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:03:57,055 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:03:57,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:03:57,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:03:57,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:03:57,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:03:57,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:03:57,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:03:57,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:03:57,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:03:57,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:03:57,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:03:57,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:03:57,068 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:03:57,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:03:57,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:03:57,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:03:57,070 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:03:57,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:03:57,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:03:57,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:03:57,081 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:03:57,081 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:03:57,082 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:03:57,082 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:03:57,082 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:03:57,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:03:57,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:03:57,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:03:57,083 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:03:57,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:03:57,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:03:57,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:03:57,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:03:57,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:03:57,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:03:57,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:03:57,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:03:57,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:03:57,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:03:57,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:03:57,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:03:57,086 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:03:57,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:03:57,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:03:57,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:03:57,086 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:03:57,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:03:57,087 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:03:57,087 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:03:57,087 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:03:57,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:03:57,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:03:57,088 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:03:57,088 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:03:57,089 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:03:57,089 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:03:57,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:03:57,134 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:03:57,138 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:03:57,140 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:03:57,140 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:03:57,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:03:57,324 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:03:57,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:03:57,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:03:57,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:03:57,335 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:03:57,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50990cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57, skipping insertion in model container [2018-01-21 01:03:57,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,358 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:03:57,398 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:03:57,519 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:03:57,541 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:03:57,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57 WrapperNode [2018-01-21 01:03:57,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:03:57,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:03:57,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:03:57,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:03:57,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (1/1) ... [2018-01-21 01:03:57,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:03:57,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:03:57,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:03:57,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:03:57,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (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:03:57,638 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:03:57,638 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:03:57,639 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:03:57,639 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:03:57,639 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:03:57,639 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:03:57,639 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:03:57,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:03:57,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:03:57,640 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:03:57,640 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:03:57,640 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:03:57,640 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:03:57,640 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:03:57,640 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:03:57,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:03:57,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:03:58,021 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:03:58,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:03:58 BoogieIcfgContainer [2018-01-21 01:03:58,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:03:58,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:03:58,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:03:58,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:03:58,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:03:57" (1/3) ... [2018-01-21 01:03:58,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fe7807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:03:58, skipping insertion in model container [2018-01-21 01:03:58,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:03:57" (2/3) ... [2018-01-21 01:03:58,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fe7807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:03:58, skipping insertion in model container [2018-01-21 01:03:58,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:03:58" (3/3) ... [2018-01-21 01:03:58,027 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:03:58,033 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:03:58,039 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:03:58,078 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:03:58,078 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:03:58,078 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:03:58,078 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:03:58,079 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:03:58,079 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:03:58,079 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:03:58,079 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:03:58,080 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:03:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-21 01:03:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:03:58,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:58,107 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:03:58,108 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:03:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash 258952, now seen corresponding path program 1 times [2018-01-21 01:03:58,113 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:58,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:58,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:58,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:58,155 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:03:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:03:58,220 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:03:58,226 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:03:58,233 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:03:58,233 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:03:58,234 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:03:58,234 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:03:58,234 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:03:58,234 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:03:58,234 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:03:58,234 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:03:58,235 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:03:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-21 01:03:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 01:03:58,240 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:58,240 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] [2018-01-21 01:03:58,240 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -806241979, now seen corresponding path program 1 times [2018-01-21 01:03:58,241 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:58,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:58,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:58,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:58,242 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:58,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:58,457 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:03:58,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:58,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:03:58,460 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:58,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:03:58,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:03:58,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:03:58,476 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-21 01:03:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:58,503 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2018-01-21 01:03:58,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:03:58,504 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-01-21 01:03:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:58,516 INFO L225 Difference]: With dead ends: 164 [2018-01-21 01:03:58,516 INFO L226 Difference]: Without dead ends: 91 [2018-01-21 01:03:58,518 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:03:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-21 01:03:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-21 01:03:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-21 01:03:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-01-21 01:03:58,555 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 30 [2018-01-21 01:03:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:58,556 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-01-21 01:03:58,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:03:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-01-21 01:03:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 01:03:58,557 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:58,557 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] [2018-01-21 01:03:58,557 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash -956225716, now seen corresponding path program 1 times [2018-01-21 01:03:58,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:58,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:58,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:58,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:58,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:58,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:58,711 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:03:58,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:03:58,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:03:58,712 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:03:58,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:03:58,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:03:58,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:03:58,714 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 5 states. [2018-01-21 01:03:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:03:58,889 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2018-01-21 01:03:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:03:58,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-21 01:03:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:03:58,894 INFO L225 Difference]: With dead ends: 153 [2018-01-21 01:03:58,894 INFO L226 Difference]: Without dead ends: 148 [2018-01-21 01:03:58,896 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:03:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-21 01:03:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 93. [2018-01-21 01:03:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-21 01:03:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-01-21 01:03:58,907 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 33 [2018-01-21 01:03:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:03:58,908 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-01-21 01:03:58,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:03:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-01-21 01:03:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 01:03:58,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:03:58,910 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-21 01:03:58,910 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:03:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash -912780865, now seen corresponding path program 1 times [2018-01-21 01:03:58,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:03:58,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:58,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:03:58,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:03:58,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:03:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:03:58,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:03:59,407 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 33 DAG size of output 31 [2018-01-21 01:03:59,655 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 47 DAG size of output 35 [2018-01-21 01:03:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:03:59,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:03:59,793 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:03:59,795 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-21 01:03:59,797 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [21], [23], [26], [146], [150], [154], [156], [157], [158], [159], [163], [167], [198], [203], [207], [213], [214], [215], [216], [217], [221], [222], [224], [225], [230], [231], [232], [233], [234] [2018-01-21 01:03:59,854 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:03:59,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:04:00,400 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:04:00,402 INFO L268 AbstractInterpreter]: Visited 47 different actions 78 times. Merged at 18 different actions 29 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 38 variables. [2018-01-21 01:04:00,412 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:04:00,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:00,412 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:00,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:00,427 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:04:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:00,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:04:00,693 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 11 treesize of output 8 [2018-01-21 01:04:00,695 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:00,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:00,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:00,703 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:00,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-01-21 01:04:00,737 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 33 treesize of output 27 [2018-01-21 01:04:00,742 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 18 [2018-01-21 01:04:00,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:00,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:00,754 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:00,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-01-21 01:04:01,058 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (main_~bucket~5.base Int) (v_prenex_1 Int)) (let ((.cse0 (store |c_old(#valid)| main_~bucket~5.base 1))) (let ((.cse1 (store .cse0 v_prenex_2 1))) (and (= 0 (select .cse0 v_prenex_2)) (= 0 (select .cse1 v_prenex_1)) (= |c_#valid| (store (store .cse1 v_prenex_1 1) main_~bucket~5.base 0)) (not (= 0 main_~bucket~5.base)))))) is different from true [2018-01-21 01:04:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-21 01:04:01,090 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:04:01,245 WARN L1007 $PredicateComparison]: unable to prove that (and (or (forall ((|v_main_#t~malloc8.base_6| Int)) (not (= 0 (select |c_#valid| |v_main_#t~malloc8.base_6|)))) (not (= 0 c_main_~bucket~5.base))) (forall ((v_prenex_3 Int)) (or (not (= 0 (select |c_#valid| v_prenex_3))) (not (= (store (store |c_#valid| v_prenex_3 1) c_main_~bucket~5.base 0) |c_old(#valid)|))))) is different from false [2018-01-21 01:04:01,272 WARN L1007 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse0 (store |c_#valid| v_prenex_4 1))) (or (not (= (select .cse0 v_prenex_3) 0)) (not (= 0 (select |c_#valid| v_prenex_4))) (not (= (store (store .cse0 v_prenex_3 1) c_main_~bucket~5.base 0) |c_old(#valid)|))))) (or (forall ((|v_main_#t~malloc3.base_6| Int) (|v_main_#t~malloc8.base_6| Int)) (or (not (= (select (store |c_#valid| |v_main_#t~malloc3.base_6| 1) |v_main_#t~malloc8.base_6|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_6|))))) (not (= 0 c_main_~bucket~5.base)))) is different from false [2018-01-21 01:04:01,290 WARN L1007 $PredicateComparison]: unable to prove that (and (or (forall ((|v_main_#t~malloc3.base_6| Int) (|v_main_#t~malloc8.base_6| Int)) (or (not (= (select (store |c_#valid| |v_main_#t~malloc3.base_6| 1) |v_main_#t~malloc8.base_6|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_6|))))) (not (= |c_main_#t~malloc0.base| 0))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse0 (store |c_#valid| v_prenex_4 1))) (or (not (= (select .cse0 v_prenex_3) 0)) (not (= |c_old(#valid)| (store (store .cse0 v_prenex_3 1) |c_main_#t~malloc0.base| 0))) (not (= 0 (select |c_#valid| v_prenex_4))))))) is different from false [2018-01-21 01:04:01,295 WARN L1007 $PredicateComparison]: unable to prove that (forall ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_#t~malloc0.base_6| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc0.base_6| 1))) (let ((.cse0 (store .cse1 v_prenex_4 1))) (or (not (= (store (store .cse0 v_prenex_3 1) |v_main_#t~malloc0.base_6| 0) |c_old(#valid)|)) (not (= 0 (select .cse1 v_prenex_4))) (= 0 |v_main_#t~malloc0.base_6|) (not (= (select .cse0 v_prenex_3) 0)))))) is different from false [2018-01-21 01:04:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:01,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:01,355 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:01,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:01,361 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:04:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:01,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:04:01,496 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 11 treesize of output 8 [2018-01-21 01:04:01,498 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:01,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:01,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:01,506 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:01,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-01-21 01:04:01,509 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 33 treesize of output 27 [2018-01-21 01:04:01,510 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 18 [2018-01-21 01:04:01,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:01,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:01,518 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:01,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-01-21 01:04:01,588 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:01,590 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:01,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:01,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:01,600 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:01,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:44 [2018-01-21 01:04:01,634 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 39 treesize of output 33 [2018-01-21 01:04:01,636 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 33 treesize of output 24 [2018-01-21 01:04:01,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:01,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:01,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:01,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:36 [2018-01-21 01:04:01,847 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_5 Int) (main_~bucket~5.base Int)) (let ((.cse1 (store |c_old(#valid)| main_~bucket~5.base 1))) (let ((.cse0 (store .cse1 v_prenex_6 1))) (and (= (store (store .cse0 v_prenex_5 1) main_~bucket~5.base 0) |c_#valid|) (= 0 (select .cse0 v_prenex_5)) (not (= 0 main_~bucket~5.base)) (= 0 (select .cse1 v_prenex_6)))))) is different from true [2018-01-21 01:04:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-21 01:04:01,871 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:04:02,003 WARN L1007 $PredicateComparison]: unable to prove that (and (or (not (= 0 c_main_~bucket~5.base)) (forall ((|v_main_#t~malloc8.base_10| Int)) (not (= 0 (select |c_#valid| |v_main_#t~malloc8.base_10|))))) (forall ((v_prenex_7 Int)) (or (not (= 0 (select |c_#valid| v_prenex_7))) (not (= (store (store |c_#valid| v_prenex_7 1) c_main_~bucket~5.base 0) |c_old(#valid)|))))) is different from false [2018-01-21 01:04:02,015 WARN L1007 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 Int) (|v_main_#t~malloc3.base_10| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc3.base_10| 1))) (or (not (= (store (store .cse0 v_prenex_7 1) c_main_~bucket~5.base 0) |c_old(#valid)|)) (not (= (select .cse0 v_prenex_7) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_10|)))))) (or (forall ((|v_main_#t~malloc8.base_10| Int) (v_prenex_8 Int)) (or (not (= 0 (select |c_#valid| v_prenex_8))) (not (= (select (store |c_#valid| v_prenex_8 1) |v_main_#t~malloc8.base_10|) 0)))) (not (= 0 c_main_~bucket~5.base)))) is different from false [2018-01-21 01:04:02,024 WARN L1007 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 Int) (|v_main_#t~malloc3.base_10| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc3.base_10| 1))) (or (not (= (store (store .cse0 v_prenex_7 1) |c_main_#t~malloc0.base| 0) |c_old(#valid)|)) (not (= (select .cse0 v_prenex_7) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_10|)))))) (or (forall ((|v_main_#t~malloc8.base_10| Int) (v_prenex_8 Int)) (or (not (= 0 (select |c_#valid| v_prenex_8))) (not (= (select (store |c_#valid| v_prenex_8 1) |v_main_#t~malloc8.base_10|) 0)))) (not (= |c_main_#t~malloc0.base| 0)))) is different from false [2018-01-21 01:04:02,060 WARN L1007 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int) (|v_main_#t~malloc0.base_10| Int) (|v_main_#t~malloc3.base_10| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc0.base_10| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc3.base_10| 1))) (or (not (= (store (store .cse0 v_prenex_7 1) |v_main_#t~malloc0.base_10| 0) |c_old(#valid)|)) (= |v_main_#t~malloc0.base_10| 0) (not (= (select .cse1 |v_main_#t~malloc3.base_10|) 0)) (not (= 0 (select .cse0 v_prenex_7))))))) is different from false [2018-01-21 01:04:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:02,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:04:02,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9, 16, 9] total 36 [2018-01-21 01:04:02,084 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:04:02,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-21 01:04:02,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-21 01:04:02,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=554, Unknown=15, NotChecked=570, Total=1260 [2018-01-21 01:04:02,086 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 20 states. [2018-01-21 01:04:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:04:02,916 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-01-21 01:04:02,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-21 01:04:02,917 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-01-21 01:04:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:04:02,921 INFO L225 Difference]: With dead ends: 207 [2018-01-21 01:04:02,921 INFO L226 Difference]: Without dead ends: 202 [2018-01-21 01:04:02,923 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 163 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=193, Invalid=943, Unknown=26, NotChecked=730, Total=1892 [2018-01-21 01:04:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-21 01:04:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 112. [2018-01-21 01:04:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-21 01:04:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-21 01:04:02,939 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 48 [2018-01-21 01:04:02,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:04:02,940 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-21 01:04:02,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-21 01:04:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-21 01:04:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-21 01:04:02,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:04:02,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:04:02,943 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:04:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash 773059570, now seen corresponding path program 1 times [2018-01-21 01:04:02,943 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:04:02,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:02,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:02,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:04:02,945 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:04:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:02,980 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:03,551 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 36 DAG size of output 34 [2018-01-21 01:04:03,731 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 68 DAG size of output 43 [2018-01-21 01:04:03,977 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 75 DAG size of output 45 [2018-01-21 01:04:04,180 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 73 DAG size of output 45 [2018-01-21 01:04:04,318 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 63 DAG size of output 39 [2018-01-21 01:04:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:04:04,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:04,867 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:04:04,867 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-01-21 01:04:04,867 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [21], [23], [26], [146], [150], [154], [156], [157], [158], [159], [163], [167], [169], [170], [171], [175], [176], [177], [182], [186], [192], [198], [203], [207], [213], [214], [215], [216], [217], [221], [222], [224], [225], [230], [231], [232], [233], [234] [2018-01-21 01:04:04,870 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:04:04,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:04:05,628 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:04:05,629 INFO L268 AbstractInterpreter]: Visited 56 different actions 137 times. Merged at 27 different actions 75 times. Never widened. Found 7 fixpoints after 4 different actions. Largest state had 42 variables. [2018-01-21 01:04:05,631 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:04:05,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:04:05,631 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:04:05,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:04:05,646 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:04:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:04:05,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:04:05,692 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:05,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:05,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:05,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-21 01:04:05,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:05,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:05,832 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-21 01:04:05,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:05,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:05,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2018-01-21 01:04:05,897 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 11 treesize of output 8 [2018-01-21 01:04:05,898 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:04:05,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:05,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:05,907 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:05,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-01-21 01:04:06,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,028 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 52 treesize of output 53 [2018-01-21 01:04:06,031 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 16 treesize of output 1 [2018-01-21 01:04:06,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:38 [2018-01-21 01:04:06,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,059 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 46 treesize of output 47 [2018-01-21 01:04:06,067 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 10 treesize of output 9 [2018-01-21 01:04:06,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-21 01:04:06,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,133 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 20 treesize of output 21 [2018-01-21 01:04:06,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-01-21 01:04:06,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 51 [2018-01-21 01:04:06,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,205 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-21 01:04:06,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,221 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:06,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:53 [2018-01-21 01:04:06,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 88 [2018-01-21 01:04:06,403 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 16 treesize of output 1 [2018-01-21 01:04:06,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,422 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:06,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:61 [2018-01-21 01:04:06,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2018-01-21 01:04:06,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 10 treesize of output 9 [2018-01-21 01:04:06,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,502 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:06,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:70 [2018-01-21 01:04:06,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2018-01-21 01:04:06,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:06,568 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 24 treesize of output 39 [2018-01-21 01:04:06,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:06,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:04:06,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:90 [2018-01-21 01:04:06,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 78 [2018-01-21 01:04:06,722 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 80 [2018-01-21 01:04:06,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:06,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:06,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:06,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:172 [2018-01-21 01:04:07,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2018-01-21 01:04:07,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:07,079 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 13 treesize of output 6 [2018-01-21 01:04:07,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:07,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:07,095 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 13 treesize of output 6 [2018-01-21 01:04:07,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:07,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:07,106 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 20 treesize of output 15 [2018-01-21 01:04:07,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:07,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:04:07,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 68 [2018-01-21 01:04:07,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:07,237 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 22 treesize of output 17 [2018-01-21 01:04:07,237 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:07,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:07,253 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 25 treesize of output 29 [2018-01-21 01:04:07,254 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:07,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:07,270 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 13 treesize of output 6 [2018-01-21 01:04:07,270 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:07,279 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:07,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:04:07,290 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:186, output treesize:28 [2018-01-21 01:04:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:04:07,488 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:04:07,934 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:07,939 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:07,941 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:07,943 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:07,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:07,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:51 [2018-01-21 01:04:08,538 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:08,543 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:08,544 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:08,558 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:08,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-01-21 01:04:08,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:101 [2018-01-21 01:04:08,964 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 91 treesize of output 68 [2018-01-21 01:04:08,966 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:08,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:08,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 88 [2018-01-21 01:04:09,085 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 70 treesize of output 66 [2018-01-21 01:04:09,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:09,087 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 64 treesize of output 60 [2018-01-21 01:04:09,088 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:09,189 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2018-01-21 01:04:09,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:09,280 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 71 treesize of output 70 [2018-01-21 01:04:09,281 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:09,295 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 1 case distinctions, treesize of input 65 treesize of output 71 [2018-01-21 01:04:09,296 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:09,400 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 63 treesize of output 62 [2018-01-21 01:04:09,401 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:09,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-01-21 01:04:09,404 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:04:09,475 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-01-21 01:04:09,484 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 2 case distinctions, treesize of input 21 treesize of output 31 [2018-01-21 01:04:09,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2018-01-21 01:04:09,505 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 8 xjuncts. [2018-01-21 01:04:09,537 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 21 treesize of output 17 [2018-01-21 01:04:09,537 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:09,555 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:04:09,571 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:04:09,572 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:04:09,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-01-21 01:04:09,586 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 8 [2018-01-21 01:04:09,586 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-01-21 01:04:09,591 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:04:09,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:04:09,595 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 57 treesize of output 49 [2018-01-21 01:04:09,628 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_41 term size 36 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) 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) [2018-01-21 01:04:09,631 INFO L168 Benchmark]: Toolchain (without parser) took 12306.00 ms. Allocated memory was 303.6 MB in the beginning and 632.3 MB in the end (delta: 328.7 MB). Free memory was 261.9 MB in the beginning and 530.2 MB in the end (delta: -268.3 MB). Peak memory consumption was 287.8 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:09,631 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 303.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:04:09,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.53 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 248.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:09,632 INFO L168 Benchmark]: Boogie Preprocessor took 37.12 ms. Allocated memory is still 303.6 MB. Free memory was 248.8 MB in the beginning and 246.8 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:09,632 INFO L168 Benchmark]: RCFGBuilder took 431.77 ms. Allocated memory is still 303.6 MB. Free memory was 246.8 MB in the beginning and 217.9 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:09,632 INFO L168 Benchmark]: TraceAbstraction took 11607.14 ms. Allocated memory was 303.6 MB in the beginning and 632.3 MB in the end (delta: 328.7 MB). Free memory was 217.9 MB in the beginning and 530.2 MB in the end (delta: -312.3 MB). Peak memory consumption was 243.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:04:09,634 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.17 ms. Allocated memory is still 303.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.53 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 248.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.12 ms. Allocated memory is still 303.6 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 431.77 ms. Allocated memory is still 303.6 MB. Free memory was 246.8 MB in the beginning and 217.9 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11607.14 ms. Allocated memory was 303.6 MB in the beginning and 632.3 MB in the end (delta: 328.7 MB). Free memory was 217.9 MB in the beginning and 530.2 MB in the end (delta: -312.3 MB). Peak memory consumption was 243.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 46 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 600 LocStat_NO_SUPPORTING_DISEQUALITIES : 226 LocStat_NO_DISJUNCTIONS : -92 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 51 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 101 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 55 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.742400 RENAME_VARIABLES(MILLISECONDS) : 0.491965 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.682140 PROJECTAWAY(MILLISECONDS) : 0.382956 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002249 DISJOIN(MILLISECONDS) : 1.476711 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.549361 ADD_EQUALITY(MILLISECONDS) : 0.042094 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.023192 #CONJOIN_DISJUNCTIVE : 139 #RENAME_VARIABLES : 230 #UNFREEZE : 0 #CONJOIN : 249 #PROJECTAWAY : 173 #ADD_WEAK_EQUALITY : 68 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 219 #ADD_EQUALITY : 136 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 54 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 691 LocStat_NO_SUPPORTING_DISEQUALITIES : 277 LocStat_NO_DISJUNCTIONS : -108 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 60 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 126 TransStat_NO_SUPPORTING_DISEQUALITIES : 21 TransStat_NO_DISJUNCTIONS : 68 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.049580 RENAME_VARIABLES(MILLISECONDS) : 0.437178 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.485837 PROJECTAWAY(MILLISECONDS) : 0.272786 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001943 DISJOIN(MILLISECONDS) : 0.828258 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.478907 ADD_EQUALITY(MILLISECONDS) : 0.022890 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016402 #CONJOIN_DISJUNCTIVE : 246 #RENAME_VARIABLES : 486 #UNFREEZE : 0 #CONJOIN : 435 #PROJECTAWAY : 321 #ADD_WEAK_EQUALITY : 69 #DISJOIN : 21 #RENAME_VARIABLES_DISJUNCTIVE : 434 #ADD_EQUALITY : 151 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * 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, 94 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=94occurred 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: var is still there: v_arrayElimCell_41 term size 36 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_41 term size 36: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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-buckets_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-09-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_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-09-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_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-09-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_01-04-09-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_01-04-09-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_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-09-641.csv Received shutdown request...