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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:42:44,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:42:44,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:42:44,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:42:44,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:42:44,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:42:44,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:42:44,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:42:44,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:42:44,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:42:44,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:42:44,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:42:44,137 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:42:44,138 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:42:44,139 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:42:44,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:42:44,144 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:42:44,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:42:44,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:42:44,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:42:44,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:42:44,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:42:44,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:42:44,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:42:44,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:42:44,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:42:44,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:42:44,155 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:42:44,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:42:44,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:42:44,156 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:42:44,157 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 00:42:44,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:42:44,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:42:44,167 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:42:44,168 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:42:44,168 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:42:44,168 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:42:44,168 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:42:44,168 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:42:44,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:42:44,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:42:44,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:42:44,170 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:42:44,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:42:44,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:42:44,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:42:44,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:42:44,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:42:44,171 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:42:44,171 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:42:44,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:42:44,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:42:44,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:42:44,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:42:44,172 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:42:44,172 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:42:44,172 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:42:44,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:42:44,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:42:44,173 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:42:44,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:42:44,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:42:44,174 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:42:44,174 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:42:44,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:42:44,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:42:44,174 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:42:44,175 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:42:44,175 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:42:44,176 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:42:44,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:42:44,220 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:42:44,224 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:42:44,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:42:44,226 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:42:44,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-21 00:42:44,379 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:42:44,385 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:42:44,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:44,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:42:44,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:42:44,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e082f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44, skipping insertion in model container [2018-01-21 00:42:44,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,412 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:44,448 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:44,568 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:44,591 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:44,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44 WrapperNode [2018-01-21 00:42:44,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:44,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:42:44,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:42:44,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:42:44,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (1/1) ... [2018-01-21 00:42:44,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:42:44,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:42:44,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:42:44,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:42:44,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (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 00:42:44,687 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:42:44,687 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:42:44,688 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:42:44,688 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:42:44,689 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 00:42:44,689 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:42:44,689 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:42:44,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:42:44,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:42:44,999 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:42:45,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:44 BoogieIcfgContainer [2018-01-21 00:42:45,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:42:45,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:42:45,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:42:45,004 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:42:45,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:42:44" (1/3) ... [2018-01-21 00:42:45,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb418f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:45, skipping insertion in model container [2018-01-21 00:42:45,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:44" (2/3) ... [2018-01-21 00:42:45,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb418f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:45, skipping insertion in model container [2018-01-21 00:42:45,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:44" (3/3) ... [2018-01-21 00:42:45,008 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-21 00:42:45,018 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:42:45,026 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:42:45,075 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:45,076 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:45,076 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:45,076 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:45,076 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:45,076 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:45,076 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:45,076 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:42:45,077 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:42:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:42:45,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:45,096 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:42:45,096 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:42:45,100 INFO L82 PathProgramCache]: Analyzing trace with hash 161638, now seen corresponding path program 1 times [2018-01-21 00:42:45,102 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:45,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:45,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:45,198 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:45,205 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:45,213 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:45,214 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:45,214 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:45,214 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:45,214 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:45,214 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:45,215 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:45,215 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:42:45,215 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:42:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-21 00:42:45,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:45,220 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:45,221 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1534673087, now seen corresponding path program 1 times [2018-01-21 00:42:45,221 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:45,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:45,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,223 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:45,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:45,268 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 00:42:45,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:45,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:45,270 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:45,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:45,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:45,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:45,293 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-21 00:42:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:45,396 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2018-01-21 00:42:45,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:45,397 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-21 00:42:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:45,406 INFO L225 Difference]: With dead ends: 119 [2018-01-21 00:42:45,407 INFO L226 Difference]: Without dead ends: 60 [2018-01-21 00:42:45,409 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 00:42:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-21 00:42:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-21 00:42:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 00:42:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-01-21 00:42:45,442 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 12 [2018-01-21 00:42:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:45,443 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-01-21 00:42:45,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-01-21 00:42:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 00:42:45,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:45,443 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:45,444 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:45,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1359962435, now seen corresponding path program 1 times [2018-01-21 00:42:45,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:45,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:45,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:45,478 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:45,482 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:45,484 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:45,484 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:45,491 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:45,492 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:45,492 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:45,492 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:45,492 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:45,492 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:45,492 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:45,492 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:42:45,492 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:42:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-21 00:42:45,494 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:45,494 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:45,494 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1736948604, now seen corresponding path program 1 times [2018-01-21 00:42:45,495 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:45,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:45,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,496 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:45,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:45,513 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 00:42:45,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:45,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:45,513 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:45,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:45,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:45,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:45,515 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-21 00:42:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:45,522 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2018-01-21 00:42:45,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:45,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-21 00:42:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:45,524 INFO L225 Difference]: With dead ends: 119 [2018-01-21 00:42:45,524 INFO L226 Difference]: Without dead ends: 58 [2018-01-21 00:42:45,525 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 00:42:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-21 00:42:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-21 00:42:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-21 00:42:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-01-21 00:42:45,532 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 10 [2018-01-21 00:42:45,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:45,532 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-01-21 00:42:45,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-01-21 00:42:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 00:42:45,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:45,534 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:45,534 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1755007480, now seen corresponding path program 1 times [2018-01-21 00:42:45,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:45,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:45,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,536 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:45,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:45,597 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 00:42:45,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:45,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:45,597 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:45,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:42:45,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:42:45,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:45,598 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 3 states. [2018-01-21 00:42:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:45,632 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-01-21 00:42:45,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:42:45,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-21 00:42:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:45,636 INFO L225 Difference]: With dead ends: 80 [2018-01-21 00:42:45,636 INFO L226 Difference]: Without dead ends: 77 [2018-01-21 00:42:45,637 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-21 00:42:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2018-01-21 00:42:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 00:42:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-01-21 00:42:45,647 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 14 [2018-01-21 00:42:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:45,647 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-01-21 00:42:45,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:42:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-01-21 00:42:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:42:45,648 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:45,649 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] [2018-01-21 00:42:45,649 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -108495441, now seen corresponding path program 1 times [2018-01-21 00:42:45,649 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:45,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:45,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,651 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:45,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:42:45,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:45,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:42:45,704 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:45,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:42:45,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:42:45,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:45,705 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 3 states. [2018-01-21 00:42:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:45,728 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-01-21 00:42:45,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:42:45,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-21 00:42:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:45,729 INFO L225 Difference]: With dead ends: 81 [2018-01-21 00:42:45,730 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 00:42:45,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 00:42:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-21 00:42:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 00:42:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-01-21 00:42:45,735 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 23 [2018-01-21 00:42:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:45,735 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-01-21 00:42:45,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:42:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-01-21 00:42:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 00:42:45,736 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:45,736 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] [2018-01-21 00:42:45,737 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1477939535, now seen corresponding path program 1 times [2018-01-21 00:42:45,737 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:45,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:45,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:45,738 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:45,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:45,827 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 00:42:45,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:42:45,827 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:42:45,828 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-21 00:42:45,830 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [27], [28], [29], [30], [31], [35], [37], [40], [46], [70], [73], [85], [89], [123], [125], [126], [127], [133], [134], [135] [2018-01-21 00:42:45,874 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:42:45,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:42:46,103 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 00:42:46,107 INFO L168 Benchmark]: Toolchain (without parser) took 1727.00 ms. Allocated memory was 303.6 MB in the beginning and 457.7 MB in the end (delta: 154.1 MB). Free memory was 261.5 MB in the beginning and 359.3 MB in the end (delta: -97.8 MB). Peak memory consumption was 56.3 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:46,108 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 303.6 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:42:46,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.86 ms. Allocated memory is still 303.6 MB. Free memory was 260.5 MB in the beginning and 249.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:46,109 INFO L168 Benchmark]: Boogie Preprocessor took 38.09 ms. Allocated memory is still 303.6 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:46,109 INFO L168 Benchmark]: RCFGBuilder took 360.38 ms. Allocated memory is still 303.6 MB. Free memory was 247.5 MB in the beginning and 223.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:46,109 INFO L168 Benchmark]: TraceAbstraction took 1104.60 ms. Allocated memory was 303.6 MB in the beginning and 457.7 MB in the end (delta: 154.1 MB). Free memory was 223.6 MB in the beginning and 359.3 MB in the end (delta: -135.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:46,111 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.11 ms. Allocated memory is still 303.6 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.86 ms. Allocated memory is still 303.6 MB. Free memory was 260.5 MB in the beginning and 249.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.09 ms. Allocated memory is still 303.6 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 360.38 ms. Allocated memory is still 303.6 MB. Free memory was 247.5 MB in the beginning and 223.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1104.60 ms. Allocated memory was 303.6 MB in the beginning and 457.7 MB in the end (delta: 154.1 MB). Free memory was 223.6 MB in the beginning and 359.3 MB in the end (delta: -135.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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, 63 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=63occurred 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; VAL [c1=0, c2=0, first={0:0}, last={0:0}] [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, c1=0, c1 < 5 && __VERIFIER_nondet_int()=0, c2=0, first={0:0}, last={0:0}] [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND FALSE !(c1 > 0) VAL [c1=0, c2=0, first={0:0}, last={0:0}] [L682] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 63 locations, 3 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-42-46-119.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-42-46-119.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-42-46-119.csv Received shutdown request...