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.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:42:41,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:42:41,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:42:41,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:42:41,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:42:41,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:42:41,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:42:41,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:42:41,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:42:41,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:42:41,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:42:41,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:42:41,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:42:41,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:42:41,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:42:41,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:42:41,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:42:41,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:42:41,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:42:41,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:42:41,410 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:42:41,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:42:41,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:42:41,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:42:41,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:42:41,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:42:41,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:42:41,414 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:42:41,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:42:41,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:42:41,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:42:41,416 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.epf [2018-01-20 23:42:41,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:42:41,426 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:42:41,427 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:42:41,427 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:42:41,427 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:42:41,427 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:42:41,427 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:42:41,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:42:41,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:42:41,428 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:42:41,429 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:42:41,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:42:41,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:42:41,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:42:41,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:42:41,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:42:41,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:42:41,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:42:41,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:42:41,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:42:41,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:42:41,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:42:41,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:42:41,431 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:42:41,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:42:41,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:42:41,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:42:41,432 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:42:41,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:42:41,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:42:41,432 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:42:41,432 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:42:41,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:42:41,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:42:41,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:42:41,433 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:42:41,434 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:42:41,434 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:42:41,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:42:41,482 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:42:41,486 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:42:41,487 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:42:41,488 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:42:41,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-01-20 23:42:41,657 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:42:41,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:42:41,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:42:41,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:42:41,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:42:41,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4b61a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41, skipping insertion in model container [2018-01-20 23:42:41,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,689 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:42:41,729 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:42:41,840 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:42:41,858 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:42:41,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41 WrapperNode [2018-01-20 23:42:41,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:42:41,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:42:41,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:42:41,867 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:42:41,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (1/1) ... [2018-01-20 23:42:41,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:42:41,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:42:41,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:42:41,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:42:41,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (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-20 23:42:41,954 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:42:41,954 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:42:41,954 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-20 23:42:41,955 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-20 23:42:41,955 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-20 23:42:41,955 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:42:41,955 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:42:41,955 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:42:41,955 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:42:41,955 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:42:41,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:42:41,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:42:41,956 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:42:41,956 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:42:41,956 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:42:41,956 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:42:41,956 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-20 23:42:41,956 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-20 23:42:41,956 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-20 23:42:41,957 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:42:41,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:42:41,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:42:42,259 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:42:42,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:42:42 BoogieIcfgContainer [2018-01-20 23:42:42,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:42:42,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:42:42,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:42:42,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:42:42,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:42:41" (1/3) ... [2018-01-20 23:42:42,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17017aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:42:42, skipping insertion in model container [2018-01-20 23:42:42,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:42:41" (2/3) ... [2018-01-20 23:42:42,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17017aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:42:42, skipping insertion in model container [2018-01-20 23:42:42,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:42:42" (3/3) ... [2018-01-20 23:42:42,266 INFO L105 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i [2018-01-20 23:42:42,273 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:42:42,280 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-20 23:42:42,317 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:42:42,317 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:42:42,317 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:42:42,318 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:42:42,318 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:42:42,318 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:42:42,318 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:42:42,318 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_dataErr0EnsuresViolation======== [2018-01-20 23:42:42,318 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:42:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-20 23:42:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:42:42,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:42,342 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-20 23:42:42,342 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:42:42,346 INFO L82 PathProgramCache]: Analyzing trace with hash -870275047, now seen corresponding path program 1 times [2018-01-20 23:42:42,348 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:42,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:42,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:42,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:42,389 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:42:42,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:42:42,524 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-20 23:42:42,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:42:42,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:42:42,527 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:42:42,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:42:42,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:42:42,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:42:42,542 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-20 23:42:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:42:42,747 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2018-01-20 23:42:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:42:42,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-20 23:42:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:42:42,756 INFO L225 Difference]: With dead ends: 158 [2018-01-20 23:42:42,756 INFO L226 Difference]: Without dead ends: 47 [2018-01-20 23:42:42,760 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-20 23:42:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-20 23:42:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-20 23:42:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-20 23:42:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-20 23:42:42,790 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2018-01-20 23:42:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:42:42,791 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-20 23:42:42,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:42:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-20 23:42:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:42:42,792 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:42,792 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-20 23:42:42,792 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:42:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2022582004, now seen corresponding path program 1 times [2018-01-20 23:42:42,793 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:42,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:42,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:42,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:42,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:42:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:42:42,887 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:42:42,900 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:42:42,904 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:42:42,919 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:42:42,919 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:42:42,919 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:42:42,920 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:42:42,920 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:42:42,920 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:42:42,920 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:42:42,920 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == freeDataErr0EnsuresViolation======== [2018-01-20 23:42:42,920 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:42:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-20 23:42:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 23:42:42,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:42,924 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-20 23:42:42,925 INFO L371 AbstractCegarLoop]: === Iteration 1 === [freeDataErr0EnsuresViolation]=== [2018-01-20 23:42:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash 18446588, now seen corresponding path program 1 times [2018-01-20 23:42:42,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:42,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:42,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:42,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:42,927 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:42:42,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:42:42,949 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-20 23:42:42,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:42:42,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:42:42,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:42:42,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:42:42,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:42:42,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:42:42,951 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-20 23:42:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:42:42,960 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-20 23:42:42,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:42:42,961 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-20 23:42:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:42:42,962 INFO L225 Difference]: With dead ends: 155 [2018-01-20 23:42:42,963 INFO L226 Difference]: Without dead ends: 70 [2018-01-20 23:42:42,964 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-20 23:42:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-20 23:42:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-20 23:42:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-20 23:42:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-20 23:42:42,972 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 21 [2018-01-20 23:42:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:42:42,972 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-20 23:42:42,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:42:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-20 23:42:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-20 23:42:42,974 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:42,974 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-20 23:42:42,975 INFO L371 AbstractCegarLoop]: === Iteration 2 === [freeDataErr0EnsuresViolation]=== [2018-01-20 23:42:42,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1906944541, now seen corresponding path program 1 times [2018-01-20 23:42:42,975 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:42,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:42,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:42,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:42,977 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:42:43,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:42:43,052 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-20 23:42:43,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:42:43,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:42:43,052 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:42:43,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:42:43,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:42:43,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:42:43,054 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-01-20 23:42:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:42:43,094 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-01-20 23:42:43,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:42:43,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-01-20 23:42:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:42:43,096 INFO L225 Difference]: With dead ends: 74 [2018-01-20 23:42:43,096 INFO L226 Difference]: Without dead ends: 73 [2018-01-20 23:42:43,097 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-20 23:42:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-20 23:42:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-20 23:42:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-20 23:42:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-20 23:42:43,103 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 40 [2018-01-20 23:42:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:42:43,103 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-20 23:42:43,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:42:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-20 23:42:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-20 23:42:43,104 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:43,104 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-20 23:42:43,104 INFO L371 AbstractCegarLoop]: === Iteration 3 === [freeDataErr0EnsuresViolation]=== [2018-01-20 23:42:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash 253062134, now seen corresponding path program 1 times [2018-01-20 23:42:43,105 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:43,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:43,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,106 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:42:43,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:42:43,179 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-20 23:42:43,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:42:43,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:42:43,180 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:42:43,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:42:43,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:42:43,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:42:43,181 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 4 states. [2018-01-20 23:42:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:42:43,218 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-01-20 23:42:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:42:43,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-01-20 23:42:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:42:43,219 INFO L225 Difference]: With dead ends: 110 [2018-01-20 23:42:43,219 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:42:43,219 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-20 23:42:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:42:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:42:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:42:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:42:43,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-20 23:42:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:42:43,220 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:42:43,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:42:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:42:43,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:42:43,223 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:42:43,223 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:42:43,223 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:42:43,223 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:42:43,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:42:43,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:42:43,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:42:43,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:42:43,223 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:42:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-20 23:42:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:42:43,225 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:43,225 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:42:43,225 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:42:43,225 INFO L82 PathProgramCache]: Analyzing trace with hash 156161, now seen corresponding path program 1 times [2018-01-20 23:42:43,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:43,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:43,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:42:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:42:43,232 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:42:43,233 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:42:43,234 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:42:43,235 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:42:43,235 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:42:43,235 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:42:43,235 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:42:43,235 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:42:43,235 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:42:43,235 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:42:43,235 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:42:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-20 23:42:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 23:42:43,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:43,238 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:42:43,238 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:42:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 456996590, now seen corresponding path program 1 times [2018-01-20 23:42:43,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:43,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:43,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:42:43,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:42:43,250 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-20 23:42:43,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:42:43,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:42:43,250 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:42:43,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:42:43,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:42:43,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:42:43,251 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-20 23:42:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:42:43,258 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-20 23:42:43,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:42:43,258 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-20 23:42:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:42:43,259 INFO L225 Difference]: With dead ends: 155 [2018-01-20 23:42:43,259 INFO L226 Difference]: Without dead ends: 76 [2018-01-20 23:42:43,260 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-20 23:42:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-20 23:42:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-20 23:42:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-20 23:42:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-20 23:42:43,268 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 16 [2018-01-20 23:42:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:42:43,268 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-20 23:42:43,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:42:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-20 23:42:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 23:42:43,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:43,270 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-20 23:42:43,270 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:42:43,270 INFO L82 PathProgramCache]: Analyzing trace with hash 943494876, now seen corresponding path program 1 times [2018-01-20 23:42:43,270 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:43,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:43,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,272 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:42:43,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:42:43,330 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-20 23:42:43,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:42:43,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:42:43,330 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:42:43,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:42:43,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:42:43,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:42:43,332 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 4 states. [2018-01-20 23:42:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:42:43,381 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-01-20 23:42:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:42:43,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-20 23:42:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:42:43,382 INFO L225 Difference]: With dead ends: 115 [2018-01-20 23:42:43,382 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:42:43,383 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-20 23:42:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:42:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:42:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:42:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:42:43,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-20 23:42:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:42:43,384 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:42:43,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:42:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:42:43,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:42:43,390 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:42:43,390 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:42:43,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:42:43,391 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:42:43,391 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:42:43,391 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:42:43,391 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:42:43,391 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:42:43,391 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:42:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-20 23:42:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 23:42:43,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:43,394 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:42:43,394 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:42:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1077569315, now seen corresponding path program 1 times [2018-01-20 23:42:43,394 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:43,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:43,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:42:43,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:42:43,406 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-20 23:42:43,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:42:43,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:42:43,407 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:42:43,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:42:43,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:42:43,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:42:43,408 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2018-01-20 23:42:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:42:43,414 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-01-20 23:42:43,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:42:43,414 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-20 23:42:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:42:43,416 INFO L225 Difference]: With dead ends: 155 [2018-01-20 23:42:43,416 INFO L226 Difference]: Without dead ends: 74 [2018-01-20 23:42:43,417 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-20 23:42:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-20 23:42:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-20 23:42:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-20 23:42:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-20 23:42:43,423 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 14 [2018-01-20 23:42:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:42:43,424 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-20 23:42:43,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:42:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-20 23:42:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-20 23:42:43,425 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:43,425 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-20 23:42:43,425 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:42:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash -137565551, now seen corresponding path program 1 times [2018-01-20 23:42:43,426 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:43,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:43,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,427 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:42:43,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:42:43,479 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-20 23:42:43,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:42:43,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:42:43,480 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:42:43,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:42:43,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:42:43,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:42:43,481 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2018-01-20 23:42:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:42:43,520 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-01-20 23:42:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:42:43,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-20 23:42:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:42:43,521 INFO L225 Difference]: With dead ends: 113 [2018-01-20 23:42:43,521 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:42:43,522 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-20 23:42:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:42:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:42:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:42:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:42:43,523 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-20 23:42:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:42:43,523 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:42:43,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:42:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:42:43,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:42:43,525 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:42:43,525 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:42:43,525 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:42:43,525 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:42:43,525 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:42:43,525 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:42:43,525 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:42:43,526 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-20 23:42:43,526 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:42:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-20 23:42:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:42:43,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:42:43,528 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-20 23:42:43,528 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-20 23:42:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1501116752, now seen corresponding path program 1 times [2018-01-20 23:42:43,529 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:42:43,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:42:43,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:42:43,530 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:42:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:42:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:42:43,567 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:42:43,570 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:42:43,572 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:42:43,573 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:42:43,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:42:43 BoogieIcfgContainer [2018-01-20 23:42:43,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:42:43,580 INFO L168 Benchmark]: Toolchain (without parser) took 1922.59 ms. Allocated memory was 306.7 MB in the beginning and 469.2 MB in the end (delta: 162.5 MB). Free memory was 265.0 MB in the beginning and 333.9 MB in the end (delta: -68.9 MB). Peak memory consumption was 93.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:42:43,582 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:42:43,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.71 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 253.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:42:43,582 INFO L168 Benchmark]: Boogie Preprocessor took 40.14 ms. Allocated memory is still 306.7 MB. Free memory was 253.8 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:42:43,583 INFO L168 Benchmark]: RCFGBuilder took 352.69 ms. Allocated memory is still 306.7 MB. Free memory was 251.9 MB in the beginning and 227.0 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-01-20 23:42:43,583 INFO L168 Benchmark]: TraceAbstraction took 1318.29 ms. Allocated memory was 306.7 MB in the beginning and 469.2 MB in the end (delta: 162.5 MB). Free memory was 226.0 MB in the beginning and 333.9 MB in the end (delta: -107.9 MB). Peak memory consumption was 54.6 MB. Max. memory is 5.3 GB. [2018-01-20 23:42:43,585 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.20 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.71 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 253.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.14 ms. Allocated memory is still 306.7 MB. Free memory was 253.8 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 352.69 ms. Allocated memory is still 306.7 MB. Free memory was 251.9 MB in the beginning and 227.0 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1318.29 ms. Allocated memory was 306.7 MB in the beginning and 469.2 MB in the end (delta: 162.5 MB). Free memory was 226.0 MB in the beginning and 333.9 MB in the end (delta: -107.9 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.0s 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_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-42-43-595.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-42-43-595.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-42-43-595.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-42-43-595.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-42-43-595.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-42-43-595.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_23-42-43-595.csv Received shutdown request...