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-reverse_simple_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:05:37,181 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:05:37,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:05:37,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:05:37,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:05:37,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:05:37,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:05:37,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:05:37,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:05:37,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:05:37,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:05:37,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:05:37,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:05:37,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:05:37,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:05:37,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:05:37,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:05:37,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:05:37,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:05:37,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:05:37,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:05:37,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:05:37,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:05:37,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:05:37,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:05:37,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:05:37,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:05:37,224 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:05:37,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:05:37,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:05:37,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:05:37,226 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:05:37,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:05:37,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:05:37,236 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:05:37,236 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:05:37,236 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:05:37,236 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:05:37,236 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:05:37,236 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:05:37,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:05:37,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:05:37,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:05:37,237 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:05:37,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:05:37,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:05:37,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:05:37,238 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:05:37,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:05:37,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:05:37,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:05:37,238 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:05:37,238 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:05:37,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:05:37,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:05:37,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:05:37,239 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:05:37,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:05:37,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:05:37,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:05:37,240 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:05:37,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:05:37,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:05:37,240 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:05:37,240 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:05:37,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:05:37,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:05:37,241 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:05:37,241 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:05:37,241 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:05:37,242 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:05:37,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:05:37,285 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:05:37,289 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:05:37,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:05:37,290 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:05:37,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:05:37,459 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:05:37,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:05:37,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:05:37,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:05:37,470 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:05:37,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6479bd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37, skipping insertion in model container [2018-01-21 01:05:37,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,489 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:05:37,531 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:05:37,659 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:05:37,684 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:05:37,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37 WrapperNode [2018-01-21 01:05:37,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:05:37,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:05:37,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:05:37,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:05:37,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (1/1) ... [2018-01-21 01:05:37,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:05:37,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:05:37,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:05:37,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:05:37,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (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:05:37,792 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:05:37,792 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:05:37,792 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:05:37,792 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:05:37,793 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:05:37,793 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:05:37,793 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:05:37,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:05:37,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:05:37,793 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:05:37,794 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:05:37,794 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 01:05:37,794 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:05:37,794 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:05:37,794 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:05:37,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:05:37,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:05:38,185 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:05:38,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:05:38 BoogieIcfgContainer [2018-01-21 01:05:38,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:05:38,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:05:38,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:05:38,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:05:38,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:05:37" (1/3) ... [2018-01-21 01:05:38,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4662ddff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:05:38, skipping insertion in model container [2018-01-21 01:05:38,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:05:37" (2/3) ... [2018-01-21 01:05:38,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4662ddff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:05:38, skipping insertion in model container [2018-01-21 01:05:38,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:05:38" (3/3) ... [2018-01-21 01:05:38,194 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-01-21 01:05:38,203 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:05:38,211 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 01:05:38,249 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:05:38,249 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:05:38,250 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:05:38,250 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:05:38,250 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:05:38,250 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:05:38,250 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:05:38,250 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:05:38,251 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:05:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-21 01:05:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:05:38,280 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:38,281 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:05:38,281 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:05:38,285 INFO L82 PathProgramCache]: Analyzing trace with hash 227176, now seen corresponding path program 1 times [2018-01-21 01:05:38,287 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:38,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:38,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:38,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:38,329 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:05:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:05:38,388 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:05:38,396 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:05:38,405 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:05:38,405 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:05:38,405 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:05:38,406 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:05:38,406 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:05:38,406 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:05:38,406 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:05:38,406 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:05:38,406 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:05:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-21 01:05:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 01:05:38,412 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:38,412 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:05:38,413 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1937358689, now seen corresponding path program 1 times [2018-01-21 01:05:38,413 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:38,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:38,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:38,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:38,415 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:38,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:38,581 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:05:38,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:38,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:05:38,583 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:38,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:05:38,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:05:38,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:05:38,599 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-01-21 01:05:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:38,621 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2018-01-21 01:05:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:05:38,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-01-21 01:05:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:38,635 INFO L225 Difference]: With dead ends: 148 [2018-01-21 01:05:38,635 INFO L226 Difference]: Without dead ends: 81 [2018-01-21 01:05:38,639 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:05:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-21 01:05:38,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-21 01:05:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-21 01:05:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-01-21 01:05:38,677 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 30 [2018-01-21 01:05:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:38,677 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-01-21 01:05:38,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:05:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-01-21 01:05:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-21 01:05:38,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:38,679 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:38,679 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:38,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1988690091, now seen corresponding path program 1 times [2018-01-21 01:05:38,679 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:38,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:38,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:38,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:38,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:38,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:39,117 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:05:39,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:39,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 01:05:39,118 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:39,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 01:05:39,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 01:05:39,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-21 01:05:39,121 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 8 states. [2018-01-21 01:05:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:39,555 INFO L93 Difference]: Finished difference Result 170 states and 191 transitions. [2018-01-21 01:05:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 01:05:39,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-01-21 01:05:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:39,559 INFO L225 Difference]: With dead ends: 170 [2018-01-21 01:05:39,560 INFO L226 Difference]: Without dead ends: 109 [2018-01-21 01:05:39,561 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-21 01:05:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-21 01:05:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2018-01-21 01:05:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-21 01:05:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-01-21 01:05:39,569 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 41 [2018-01-21 01:05:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:39,569 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-01-21 01:05:39,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 01:05:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-01-21 01:05:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-21 01:05:39,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:39,571 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:39,571 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:39,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1854676585, now seen corresponding path program 1 times [2018-01-21 01:05:39,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:39,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:39,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:39,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:39,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:39,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:39,726 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:05:39,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:39,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 01:05:39,727 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:39,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 01:05:39,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 01:05:39,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 01:05:39,728 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 6 states. [2018-01-21 01:05:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:39,930 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-01-21 01:05:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 01:05:39,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-21 01:05:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:39,932 INFO L225 Difference]: With dead ends: 140 [2018-01-21 01:05:39,932 INFO L226 Difference]: Without dead ends: 101 [2018-01-21 01:05:39,932 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-21 01:05:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-21 01:05:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-01-21 01:05:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-21 01:05:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-01-21 01:05:39,939 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 41 [2018-01-21 01:05:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:39,939 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-01-21 01:05:39,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 01:05:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-01-21 01:05:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 01:05:39,941 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:39,941 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:39,941 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:39,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1544345424, now seen corresponding path program 1 times [2018-01-21 01:05:39,941 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:39,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:39,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:39,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:39,943 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:39,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:40,043 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:05:40,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:40,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:05:40,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:40,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:05:40,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:05:40,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:05:40,045 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 5 states. [2018-01-21 01:05:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:40,170 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2018-01-21 01:05:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:05:40,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-01-21 01:05:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:40,172 INFO L225 Difference]: With dead ends: 166 [2018-01-21 01:05:40,172 INFO L226 Difference]: Without dead ends: 137 [2018-01-21 01:05:40,172 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:05:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-21 01:05:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2018-01-21 01:05:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-21 01:05:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-21 01:05:40,180 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 44 [2018-01-21 01:05:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:40,180 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-21 01:05:40,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:05:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-21 01:05:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 01:05:40,181 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:40,182 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, 1, 1] [2018-01-21 01:05:40,182 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:40,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1172413608, now seen corresponding path program 1 times [2018-01-21 01:05:40,182 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:40,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:40,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:40,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:40,183 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:40,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:40,283 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:05:40,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:40,283 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:40,284 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-21 01:05:40,286 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [8], [10], [13], [25], [29], [31], [32], [37], [41], [69], [74], [78], [84], [85], [88], [89], [90], [91], [92], [93], [94], [101], [105], [109], [111], [112], [113], [114], [115], [119], [123], [127], [172], [176], [180], [189], [190], [192], [193], [198], [199], [200], [201], [202] [2018-01-21 01:05:40,335 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:40,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:40,691 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:05:40,693 INFO L268 AbstractInterpreter]: Visited 49 different actions 66 times. Merged at 9 different actions 15 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-01-21 01:05:40,703 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:05:40,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:40,703 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:05:40,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:40,740 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:40,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:40,853 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:05:40,853 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:40,924 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:05:40,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:40,946 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:05:40,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:40,958 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:41,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:41,053 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:05:41,053 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:05:41,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:05:41,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:05:41,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 6 [2018-01-21 01:05:41,088 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:05:41,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 01:05:41,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 01:05:41,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 01:05:41,090 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 6 states. [2018-01-21 01:05:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:41,383 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-01-21 01:05:41,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 01:05:41,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-01-21 01:05:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:41,387 INFO L225 Difference]: With dead ends: 208 [2018-01-21 01:05:41,387 INFO L226 Difference]: Without dead ends: 197 [2018-01-21 01:05:41,388 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 193 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-21 01:05:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-21 01:05:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2018-01-21 01:05:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-21 01:05:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-01-21 01:05:41,406 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 50 [2018-01-21 01:05:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:41,407 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-01-21 01:05:41,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 01:05:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-01-21 01:05:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-21 01:05:41,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:41,409 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:05:41,409 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash 613220352, now seen corresponding path program 2 times [2018-01-21 01:05:41,410 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:41,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:41,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:41,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:41,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:41,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:41,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:05:41,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 01:05:41,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:05:41,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:05:41,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:05:41,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:05:41,493 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 4 states. [2018-01-21 01:05:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:05:41,565 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-01-21 01:05:41,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:05:41,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-21 01:05:41,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:05:41,567 INFO L225 Difference]: With dead ends: 145 [2018-01-21 01:05:41,567 INFO L226 Difference]: Without dead ends: 134 [2018-01-21 01:05:41,567 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:05:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-21 01:05:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2018-01-21 01:05:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-21 01:05:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2018-01-21 01:05:41,580 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 56 [2018-01-21 01:05:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:05:41,580 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2018-01-21 01:05:41,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:05:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2018-01-21 01:05:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-21 01:05:41,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:05:41,582 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:41,582 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:05:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash 919803955, now seen corresponding path program 1 times [2018-01-21 01:05:41,583 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:05:41,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:41,583 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 01:05:41,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:05:41,584 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:05:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:41,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:05:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:05:42,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:42,111 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:05:42,111 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-01-21 01:05:42,111 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [8], [10], [13], [25], [29], [31], [32], [37], [41], [69], [74], [78], [84], [85], [88], [89], [90], [91], [92], [93], [94], [101], [105], [109], [111], [112], [113], [114], [115], [119], [123], [127], [129], [130], [131], [139], [143], [148], [152], [158], [165], [167], [168], [172], [176], [180], [182], [183], [184], [185], [189], [190], [192], [193], [198], [199], [200], [201], [202] [2018-01-21 01:05:42,114 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:05:42,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:05:42,676 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:05:42,676 INFO L268 AbstractInterpreter]: Visited 64 different actions 159 times. Merged at 32 different actions 84 times. Widened at 1 different actions 3 times. Found 11 fixpoints after 6 different actions. Largest state had 46 variables. [2018-01-21 01:05:42,683 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:05:42,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:05:42,683 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:05:42,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:05:42,695 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:05:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:05:42,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:05:42,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:05:42,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-21 01:05:42,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2018-01-21 01:05:42,865 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 11574 column 44: unknown constant v_DerPreprocessor_1 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:582) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:105) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:297) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:239) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:198) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:998) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:942) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:573) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) 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:05:42,868 INFO L168 Benchmark]: Toolchain (without parser) took 5408.93 ms. Allocated memory was 303.6 MB in the beginning and 562.6 MB in the end (delta: 259.0 MB). Free memory was 261.9 MB in the beginning and 358.7 MB in the end (delta: -96.8 MB). Peak memory consumption was 162.2 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:42,869 INFO L168 Benchmark]: CDTParser took 0.15 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:05:42,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.67 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:05:42,870 INFO L168 Benchmark]: Boogie Preprocessor took 45.88 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:05:42,870 INFO L168 Benchmark]: RCFGBuilder took 444.58 ms. Allocated memory is still 303.6 MB. Free memory was 246.8 MB in the beginning and 220.2 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:42,871 INFO L168 Benchmark]: TraceAbstraction took 4680.48 ms. Allocated memory was 303.6 MB in the beginning and 562.6 MB in the end (delta: 259.0 MB). Free memory was 220.2 MB in the beginning and 358.7 MB in the end (delta: -138.5 MB). Peak memory consumption was 120.5 MB. Max. memory is 5.3 GB. [2018-01-21 01:05:42,872 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.15 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 230.67 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 45.88 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 444.58 ms. Allocated memory is still 303.6 MB. Free memory was 246.8 MB in the beginning and 220.2 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4680.48 ms. Allocated memory was 303.6 MB in the beginning and 562.6 MB in the end (delta: 259.0 MB). Free memory was 220.2 MB in the beginning and 358.7 MB in the end (delta: -138.5 MB). Peak memory consumption was 120.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 48 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 574 LocStat_NO_SUPPORTING_DISEQUALITIES : 179 LocStat_NO_DISJUNCTIONS : -96 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 90 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 57 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.230939 RENAME_VARIABLES(MILLISECONDS) : 0.095343 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.190816 PROJECTAWAY(MILLISECONDS) : 0.088731 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000907 DISJOIN(MILLISECONDS) : 0.803918 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.117863 ADD_EQUALITY(MILLISECONDS) : 0.028299 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020298 #CONJOIN_DISJUNCTIVE : 114 #RENAME_VARIABLES : 177 #UNFREEZE : 0 #CONJOIN : 184 #PROJECTAWAY : 145 #ADD_WEAK_EQUALITY : 47 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 170 #ADD_EQUALITY : 120 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 61 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 714 LocStat_NO_SUPPORTING_DISEQUALITIES : 228 LocStat_NO_DISJUNCTIONS : -122 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 68 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 121 TransStat_NO_SUPPORTING_DISEQUALITIES : 24 TransStat_NO_DISJUNCTIONS : 78 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.566046 RENAME_VARIABLES(MILLISECONDS) : 0.021685 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.346762 PROJECTAWAY(MILLISECONDS) : 1.323455 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001878 DISJOIN(MILLISECONDS) : 0.659184 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.045056 ADD_EQUALITY(MILLISECONDS) : 0.020935 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012115 #CONJOIN_DISJUNCTIVE : 264 #RENAME_VARIABLES : 527 #UNFREEZE : 0 #CONJOIN : 431 #PROJECTAWAY : 348 #ADD_WEAK_EQUALITY : 48 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 477 #ADD_EQUALITY : 141 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 17 * 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, 84 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=84occurred 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: SMTLIBException: line 11574 column 44: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 11574 column 44: unknown constant v_DerPreprocessor_1: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) 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-reverse_simple_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-05-42-882.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-05-42-882.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-05-42-882.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_01-05-42-882.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_01-05-42-882.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-05-42-882.csv Received shutdown request...