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_precise.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 05:51:50,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 05:51:50,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 05:51:50,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 05:51:50,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 05:51:50,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 05:51:50,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 05:51:50,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 05:51:50,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 05:51:50,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 05:51:50,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 05:51:50,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 05:51:50,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 05:51:50,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 05:51:50,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 05:51:50,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 05:51:50,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 05:51:50,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 05:51:50,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 05:51:50,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 05:51:50,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 05:51:50,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 05:51:50,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 05:51:50,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 05:51:50,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 05:51:50,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 05:51:50,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 05:51:50,142 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 05:51:50,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 05:51:50,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 05:51:50,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 05:51:50,143 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_precise.epf [2018-01-21 05:51:50,153 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 05:51:50,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 05:51:50,154 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 05:51:50,154 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 05:51:50,154 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 05:51:50,154 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 05:51:50,155 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 05:51:50,155 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 05:51:50,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 05:51:50,156 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 05:51:50,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 05:51:50,156 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 05:51:50,156 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 05:51:50,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 05:51:50,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 05:51:50,157 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 05:51:50,157 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 05:51:50,157 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 05:51:50,157 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 05:51:50,157 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 05:51:50,157 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 05:51:50,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 05:51:50,158 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 05:51:50,158 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 05:51:50,158 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 05:51:50,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 05:51:50,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 05:51:50,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 05:51:50,159 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 05:51:50,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 05:51:50,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 05:51:50,159 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 05:51:50,160 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 05:51:50,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 05:51:50,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 05:51:50,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 05:51:50,160 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 05:51:50,161 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 05:51:50,161 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 05:51:50,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 05:51:50,206 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 05:51:50,210 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 05:51:50,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 05:51:50,212 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 05:51:50,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i [2018-01-21 05:51:50,378 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 05:51:50,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 05:51:50,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 05:51:50,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 05:51:50,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 05:51:50,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c1589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50, skipping insertion in model container [2018-01-21 05:51:50,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,414 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:51:50,451 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:51:50,567 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:51:50,585 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:51:50,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50 WrapperNode [2018-01-21 05:51:50,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 05:51:50,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 05:51:50,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 05:51:50,595 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 05:51:50,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (1/1) ... [2018-01-21 05:51:50,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 05:51:50,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 05:51:50,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 05:51:50,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 05:51:50,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (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 05:51:50,681 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 05:51:50,681 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 05:51:50,681 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-21 05:51:50,681 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-21 05:51:50,681 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 05:51:50,681 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 05:51:50,682 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-21 05:51:50,683 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-21 05:51:50,683 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 05:51:50,683 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 05:51:50,683 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 05:51:50,683 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 05:51:51,004 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 05:51:51,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:51:51 BoogieIcfgContainer [2018-01-21 05:51:51,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 05:51:51,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 05:51:51,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 05:51:51,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 05:51:51,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 05:51:50" (1/3) ... [2018-01-21 05:51:51,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660485aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:51:51, skipping insertion in model container [2018-01-21 05:51:51,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:51:50" (2/3) ... [2018-01-21 05:51:51,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660485aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:51:51, skipping insertion in model container [2018-01-21 05:51:51,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:51:51" (3/3) ... [2018-01-21 05:51:51,016 INFO L105 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i [2018-01-21 05:51:51,025 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 05:51:51,031 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 05:51:51,074 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:51:51,075 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:51:51,075 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:51:51,075 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:51:51,075 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:51:51,075 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:51:51,075 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:51:51,075 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_dataErr0EnsuresViolation======== [2018-01-21 05:51:51,076 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:51:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 05:51:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 05:51:51,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:51,103 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] [2018-01-21 05:51:51,103 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0EnsuresViolation]=== [2018-01-21 05:51:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash -870275047, now seen corresponding path program 1 times [2018-01-21 05:51:51,109 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:51,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:51,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,150 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:51:51,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:51:51,312 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 05:51:51,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:51:51,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:51:51,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:51:51,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 05:51:51,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 05:51:51,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 05:51:51,331 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-21 05:51:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:51:51,526 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2018-01-21 05:51:51,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 05:51:51,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-21 05:51:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:51:51,536 INFO L225 Difference]: With dead ends: 158 [2018-01-21 05:51:51,536 INFO L226 Difference]: Without dead ends: 47 [2018-01-21 05:51:51,540 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 05:51:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-21 05:51:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-21 05:51:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-21 05:51:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-21 05:51:51,577 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2018-01-21 05:51:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:51:51,578 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-21 05:51:51,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 05:51:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-21 05:51:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 05:51:51,579 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:51,580 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] [2018-01-21 05:51:51,580 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0EnsuresViolation]=== [2018-01-21 05:51:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2022582004, now seen corresponding path program 1 times [2018-01-21 05:51:51,580 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:51,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:51,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,582 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:51:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:51:51,679 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:51:51,693 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:51:51,697 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:51:51,715 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:51:51,716 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:51:51,716 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:51:51,716 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:51:51,716 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:51:51,716 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:51:51,716 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:51:51,716 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == freeDataErr0EnsuresViolation======== [2018-01-21 05:51:51,716 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:51:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 05:51:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 05:51:51,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:51,721 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] [2018-01-21 05:51:51,721 INFO L371 AbstractCegarLoop]: === Iteration 1 === [freeDataErr0EnsuresViolation]=== [2018-01-21 05:51:51,721 INFO L82 PathProgramCache]: Analyzing trace with hash 18446588, now seen corresponding path program 1 times [2018-01-21 05:51:51,721 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:51,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:51,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,723 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:51:51,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:51:51,747 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 05:51:51,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:51:51,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:51:51,748 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:51:51,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:51:51,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:51:51,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:51:51,749 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-21 05:51:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:51:51,759 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-21 05:51:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:51:51,760 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 05:51:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:51:51,761 INFO L225 Difference]: With dead ends: 155 [2018-01-21 05:51:51,762 INFO L226 Difference]: Without dead ends: 70 [2018-01-21 05:51:51,763 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 05:51:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-21 05:51:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-21 05:51:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-21 05:51:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-21 05:51:51,771 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 21 [2018-01-21 05:51:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:51:51,771 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-21 05:51:51,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:51:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-21 05:51:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 05:51:51,773 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:51,773 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] [2018-01-21 05:51:51,773 INFO L371 AbstractCegarLoop]: === Iteration 2 === [freeDataErr0EnsuresViolation]=== [2018-01-21 05:51:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1906944541, now seen corresponding path program 1 times [2018-01-21 05:51:51,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:51,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:51,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,775 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:51:51,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:51:51,840 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 05:51:51,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:51:51,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:51:51,840 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:51:51,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 05:51:51,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 05:51:51,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 05:51:51,841 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-01-21 05:51:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:51:51,889 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-01-21 05:51:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 05:51:51,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-01-21 05:51:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:51:51,891 INFO L225 Difference]: With dead ends: 74 [2018-01-21 05:51:51,891 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 05:51:51,892 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 05:51:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 05:51:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-21 05:51:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-21 05:51:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-21 05:51:51,898 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 40 [2018-01-21 05:51:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:51:51,898 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-21 05:51:51,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 05:51:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-21 05:51:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 05:51:51,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:51,900 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] [2018-01-21 05:51:51,900 INFO L371 AbstractCegarLoop]: === Iteration 3 === [freeDataErr0EnsuresViolation]=== [2018-01-21 05:51:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash 253062134, now seen corresponding path program 1 times [2018-01-21 05:51:51,900 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:51,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:51,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:51,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:51:51,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:51:51,981 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 05:51:51,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:51:51,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 05:51:51,981 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:51:51,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:51:51,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:51:51,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:51:51,982 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 4 states. [2018-01-21 05:51:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:51:52,031 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-01-21 05:51:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 05:51:52,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-01-21 05:51:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:51:52,032 INFO L225 Difference]: With dead ends: 110 [2018-01-21 05:51:52,032 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:51:52,033 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:51:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:51:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:51:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:51:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:51:52,034 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-21 05:51:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:51:52,034 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:51:52,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:51:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:51:52,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:51:52,038 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:51:52,038 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:51:52,039 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:51:52,039 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:51:52,039 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:51:52,039 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:51:52,039 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:51:52,039 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 05:51:52,039 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:51:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 05:51:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 05:51:52,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:52,042 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 05:51:52,042 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 05:51:52,042 INFO L82 PathProgramCache]: Analyzing trace with hash 156161, now seen corresponding path program 1 times [2018-01-21 05:51:52,043 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:52,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:52,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:51:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:51:52,051 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:51:52,052 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:51:52,054 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:51:52,055 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:51:52,055 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:51:52,055 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:51:52,055 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:51:52,055 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:51:52,055 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:51:52,055 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 05:51:52,055 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:51:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 05:51:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 05:51:52,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:52,058 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:51:52,058 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:51:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash 456996590, now seen corresponding path program 1 times [2018-01-21 05:51:52,059 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:52,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:52,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,060 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:51:52,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:51:52,072 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 05:51:52,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:51:52,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:51:52,073 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:51:52,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:51:52,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:51:52,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:51:52,074 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-21 05:51:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:51:52,081 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-21 05:51:52,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:51:52,081 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-21 05:51:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:51:52,082 INFO L225 Difference]: With dead ends: 155 [2018-01-21 05:51:52,083 INFO L226 Difference]: Without dead ends: 76 [2018-01-21 05:51:52,083 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 05:51:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-21 05:51:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-21 05:51:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-21 05:51:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-21 05:51:52,091 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 16 [2018-01-21 05:51:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:51:52,091 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-21 05:51:52,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:51:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-21 05:51:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 05:51:52,093 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:52,093 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] [2018-01-21 05:51:52,093 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:51:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 943494876, now seen corresponding path program 1 times [2018-01-21 05:51:52,093 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:52,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:52,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,095 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:51:52,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:51:52,165 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 05:51:52,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:51:52,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 05:51:52,166 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:51:52,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:51:52,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:51:52,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:51:52,167 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 4 states. [2018-01-21 05:51:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:51:52,226 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-01-21 05:51:52,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 05:51:52,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-21 05:51:52,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:51:52,227 INFO L225 Difference]: With dead ends: 115 [2018-01-21 05:51:52,228 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:51:52,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:51:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:51:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:51:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:51:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:51:52,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-21 05:51:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:51:52,230 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:51:52,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:51:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:51:52,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:51:52,232 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:51:52,232 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:51:52,232 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:51:52,233 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:51:52,233 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:51:52,233 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:51:52,233 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:51:52,233 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 05:51:52,233 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:51:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 05:51:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 05:51:52,236 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:52,236 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:51:52,236 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 05:51:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1077569315, now seen corresponding path program 1 times [2018-01-21 05:51:52,236 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:52,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:52,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,238 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:51:52,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:51:52,249 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 05:51:52,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:51:52,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:51:52,250 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:51:52,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:51:52,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:51:52,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:51:52,251 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-21 05:51:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:51:52,257 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-21 05:51:52,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:51:52,258 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-21 05:51:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:51:52,259 INFO L225 Difference]: With dead ends: 155 [2018-01-21 05:51:52,259 INFO L226 Difference]: Without dead ends: 74 [2018-01-21 05:51:52,259 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 05:51:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-21 05:51:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-21 05:51:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-21 05:51:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-21 05:51:52,266 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 14 [2018-01-21 05:51:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:51:52,266 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-21 05:51:52,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:51:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-21 05:51:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 05:51:52,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:52,267 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] [2018-01-21 05:51:52,267 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 05:51:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash -137565551, now seen corresponding path program 1 times [2018-01-21 05:51:52,267 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:52,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:52,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,268 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:51:52,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:51:52,321 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 05:51:52,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:51:52,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 05:51:52,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:51:52,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:51:52,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:51:52,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:51:52,323 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2018-01-21 05:51:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:51:52,364 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-01-21 05:51:52,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 05:51:52,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-21 05:51:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:51:52,365 INFO L225 Difference]: With dead ends: 113 [2018-01-21 05:51:52,365 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:51:52,366 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:51:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:51:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:51:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:51:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:51:52,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-21 05:51:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:51:52,367 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:51:52,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:51:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:51:52,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:51:52,369 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:51:52,369 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:51:52,369 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:51:52,369 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:51:52,370 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:51:52,370 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:51:52,370 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:51:52,370 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 05:51:52,370 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:51:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-21 05:51:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 05:51:52,372 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:51:52,373 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] [2018-01-21 05:51:52,373 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 05:51:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1501116752, now seen corresponding path program 1 times [2018-01-21 05:51:52,373 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:51:52,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:51:52,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:51:52,374 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:51:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:51:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:51:52,410 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:51:52,414 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:51:52,415 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:51:52,416 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:51:52,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 05:51:52 BoogieIcfgContainer [2018-01-21 05:51:52,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 05:51:52,421 INFO L168 Benchmark]: Toolchain (without parser) took 2041.89 ms. Allocated memory was 306.2 MB in the beginning and 465.0 MB in the end (delta: 158.9 MB). Free memory was 264.5 MB in the beginning and 330.2 MB in the end (delta: -65.7 MB). Peak memory consumption was 93.1 MB. Max. memory is 5.3 GB. [2018-01-21 05:51:52,422 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:51:52,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.02 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 252.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 05:51:52,422 INFO L168 Benchmark]: Boogie Preprocessor took 36.50 ms. Allocated memory is still 306.2 MB. Free memory was 252.5 MB in the beginning and 251.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-21 05:51:52,422 INFO L168 Benchmark]: RCFGBuilder took 377.05 ms. Allocated memory is still 306.2 MB. Free memory was 251.5 MB in the beginning and 226.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-21 05:51:52,423 INFO L168 Benchmark]: TraceAbstraction took 1410.37 ms. Allocated memory was 306.2 MB in the beginning and 465.0 MB in the end (delta: 158.9 MB). Free memory was 226.0 MB in the beginning and 330.2 MB in the end (delta: -104.3 MB). Peak memory consumption was 54.6 MB. Max. memory is 5.3 GB. [2018-01-21 05:51:52,424 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.22 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.02 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 252.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 36.50 ms. Allocated memory is still 306.2 MB. Free memory was 252.5 MB in the beginning and 251.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 377.05 ms. Allocated memory is still 306.2 MB. Free memory was 251.5 MB in the beginning and 226.0 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1410.37 ms. Allocated memory was 306.2 MB in the beginning and 465.0 MB in the end (delta: 158.9 MB). Free memory was 226.0 MB in the beginning and 330.2 MB in the end (delta: -104.3 MB). Peak memory consumption was 54.6 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) - 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: 538]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L571] FCALL struct node_t *list = ((void *)0); VAL [list={15:0}] [L572] int dataNotFinished = 0; VAL [dataNotFinished=0, list={15:0}] [L574] CALL append(&list) VAL [pointerToList={15:0}] [L565] EXPR, FCALL malloc(sizeof *node) VAL [malloc(sizeof *node)={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L565] struct node_t *node = malloc(sizeof *node); VAL [malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L566] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L566] FCALL node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L567] CALL create_data() [L539] COND FALSE !(__VERIFIER_nondet_int()) [L542] EXPR, FCALL malloc(sizeof *data) VAL [malloc(sizeof *data)={13:0}] [L542] Data data = malloc(sizeof *data); [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] FCALL data->array = ((void *)0) VAL [data={13:0}, malloc(sizeof *data)={13:0}] [L552] FCALL data->number = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, data={13:0}, malloc(sizeof *data)={13:0}] [L553] return data; VAL [\result={13:0}, data={13:0}, malloc(sizeof *data)={13:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: create_dataErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 11 SDslu, 46 SDs, 0 SdLazy, 28 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 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 - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: freeDataErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 22 SDslu, 87 SDs, 0 SdLazy, 44 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 5557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. UNSAFE Result, 0.0s 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=82occurred 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 - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 11 SDslu, 44 SDs, 0 SdLazy, 23 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 2925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 570]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 11 SDslu, 44 SDs, 0 SdLazy, 23 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 2651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 564]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L571] FCALL struct node_t *list = ((void *)0); VAL [list={15:0}] [L572] int dataNotFinished = 0; VAL [dataNotFinished=0, list={15:0}] [L574] CALL append(&list) VAL [pointerToList={15:0}] [L565] EXPR, FCALL malloc(sizeof *node) VAL [malloc(sizeof *node)={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L565] struct node_t *node = malloc(sizeof *node); VAL [malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L566] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L566] FCALL node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L567] CALL, EXPR create_data() [L539] COND TRUE __VERIFIER_nondet_int() [L540] RET return ((void *)0); VAL [\result={0:0}] [L567] EXPR create_data() VAL [create_data()={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L567] FCALL node->data = create_data() VAL [create_data()={0:0}, malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] [L568] FCALL *pointerToList = node VAL [malloc(sizeof *node)={14:0}, node={14:0}, pointerToList={15:0}, pointerToList={15:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 6 procedures, 82 locations, 6 error locations. UNSAFE Result, 0.0s 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=82occurred 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, 25 NumberOfCodeBlocks, 25 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_05-51-52-434.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_05-51-52-434.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_05-51-52-434.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_05-51-52-434.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_05-51-52-434.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_05-51-52-434.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_05-51-52-434.csv Received shutdown request...