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/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:58:43,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:58:43,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:58:43,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:58:43,510 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:58:43,511 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:58:43,512 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:58:43,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:58:43,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:58:43,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:58:43,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:58:43,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:58:43,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:58:43,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:58:43,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:58:43,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:58:43,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:58:43,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:58:43,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:58:43,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:58:43,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:58:43,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:58:43,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:58:43,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:58:43,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:58:43,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:58:43,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:58:43,538 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:58:43,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:58:43,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:58:43,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:58:43,539 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:58:43,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:58:43,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:58:43,548 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:58:43,548 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:58:43,549 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:58:43,549 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:58:43,549 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:58:43,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:58:43,549 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:58:43,549 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:58:43,550 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:58:43,551 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:58:43,551 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:58:43,551 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:58:43,551 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:58:43,551 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:58:43,551 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:58:43,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:58:43,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:58:43,552 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:58:43,552 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:58:43,552 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:58:43,552 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:58:43,553 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:58:43,553 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:58:43,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:58:43,553 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:58:43,553 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:58:43,554 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:58:43,554 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:58:43,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:58:43,599 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:58:43,602 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:58:43,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:58:43,603 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:58:43,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-20 23:58:43,802 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:58:43,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:58:43,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:58:43,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:58:43,815 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:58:43,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:58:43" (1/1) ... [2018-01-20 23:58:43,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30cf31ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:43, skipping insertion in model container [2018-01-20 23:58:43,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:58:43" (1/1) ... [2018-01-20 23:58:43,834 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:58:43,882 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:58:44,006 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:58:44,028 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:58:44,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44 WrapperNode [2018-01-20 23:58:44,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:58:44,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:58:44,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:58:44,039 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:58:44,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (1/1) ... [2018-01-20 23:58:44,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (1/1) ... [2018-01-20 23:58:44,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (1/1) ... [2018-01-20 23:58:44,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (1/1) ... [2018-01-20 23:58:44,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (1/1) ... [2018-01-20 23:58:44,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (1/1) ... [2018-01-20 23:58:44,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (1/1) ... [2018-01-20 23:58:44,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:58:44,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:58:44,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:58:44,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:58:44,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:58:44,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:58:44,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:58:44,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 23:58:44,119 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-20 23:58:44,119 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-20 23:58:44,119 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-20 23:58:44,119 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-20 23:58:44,119 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 23:58:44,119 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:58:44,120 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:58:44,120 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:58:44,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:58:44,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:58:44,120 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:58:44,120 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:58:44,120 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:58:44,121 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:58:44,121 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 23:58:44,121 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-20 23:58:44,121 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-20 23:58:44,121 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-20 23:58:44,121 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-20 23:58:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 23:58:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:58:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:58:44,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:58:44,342 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:58:44,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:58:44 BoogieIcfgContainer [2018-01-20 23:58:44,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:58:44,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:58:44,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:58:44,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:58:44,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:58:43" (1/3) ... [2018-01-20 23:58:44,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fd9541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:58:44, skipping insertion in model container [2018-01-20 23:58:44,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:44" (2/3) ... [2018-01-20 23:58:44,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fd9541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:58:44, skipping insertion in model container [2018-01-20 23:58:44,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:58:44" (3/3) ... [2018-01-20 23:58:44,350 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-20 23:58:44,362 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:58:44,369 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-20 23:58:44,407 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:44,407 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:44,407 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:44,407 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:44,407 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:44,407 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:44,407 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:44,408 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-20 23:58:44,408 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 23:58:44,431 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:44,432 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:44,432 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-20 23:58:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash -5063144, now seen corresponding path program 1 times [2018-01-20 23:58:44,438 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:44,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:44,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:44,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:44,487 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:44,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:44,712 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:58:44,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:44,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:58:44,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:44,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:58:44,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:58:44,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:58:44,796 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-01-20 23:58:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:44,843 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-01-20 23:58:44,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:44,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-20 23:58:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:44,850 INFO L225 Difference]: With dead ends: 103 [2018-01-20 23:58:44,850 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:44,853 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:58:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:44,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-20 23:58:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:44,874 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:44,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:58:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:44,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:44,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 23:58:44,924 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-20 23:58:44,924 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:44,924 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:44,924 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:44,924 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-20 23:58:44,925 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 23:58:44,925 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 23:58:44,925 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:44,925 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:44,925 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:44,925 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 23:58:44,925 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,925 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,926 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1475) the Hoare annotation is: true [2018-01-20 23:58:44,926 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,926 INFO L404 ceAbstractionStarter]: At program point disconnect_2_6ENTRY(lines 1461 1462) the Hoare annotation is: true [2018-01-20 23:58:44,926 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6EXIT(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:44,926 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6FINAL(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:44,926 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6Err0EnsuresViolation(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:44,926 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1475) the Hoare annotation is: true [2018-01-20 23:58:44,927 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,927 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1475) the Hoare annotation is: true [2018-01-20 23:58:44,927 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,927 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,927 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1473 1475) the Hoare annotation is: true [2018-01-20 23:58:44,927 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1473 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,927 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1473 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,928 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1473 1475) no Hoare annotation was computed. [2018-01-20 23:58:44,928 INFO L401 ceAbstractionStarter]: For program point L1466'(line 1466) no Hoare annotation was computed. [2018-01-20 23:58:44,928 INFO L404 ceAbstractionStarter]: At program point L1466(line 1466) the Hoare annotation is: true [2018-01-20 23:58:44,928 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1465 1471) no Hoare annotation was computed. [2018-01-20 23:58:44,928 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1465 1471) no Hoare annotation was computed. [2018-01-20 23:58:44,928 INFO L401 ceAbstractionStarter]: For program point L1468'(lines 1468 1470) no Hoare annotation was computed. [2018-01-20 23:58:44,928 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1465 1471) the Hoare annotation is: true [2018-01-20 23:58:44,929 INFO L404 ceAbstractionStarter]: At program point L1469(line 1469) the Hoare annotation is: true [2018-01-20 23:58:44,929 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1465 1471) no Hoare annotation was computed. [2018-01-20 23:58:44,929 INFO L401 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-01-20 23:58:44,929 INFO L401 ceAbstractionStarter]: For program point L1468(lines 1468 1470) no Hoare annotation was computed. [2018-01-20 23:58:44,929 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:44,929 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:44,929 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-20 23:58:44,929 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:44,930 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-20 23:58:44,930 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-20 23:58:44,930 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-20 23:58:44,930 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-20 23:58:44,930 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-20 23:58:44,930 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-20 23:58:44,931 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-20 23:58:44,931 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-20 23:58:44,931 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:44,931 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-20 23:58:44,931 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-20 23:58:44,931 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-20 23:58:44,931 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:44,932 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-20 23:58:44,932 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-20 23:58:44,932 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-20 23:58:44,932 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:44,936 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:44,936 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:44,936 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:44,936 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:44,936 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:44,936 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:44,936 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:44,937 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 23:58:44,937 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 23:58:44,940 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:44,940 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:44,940 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:58:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash -416946598, now seen corresponding path program 1 times [2018-01-20 23:58:44,940 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:44,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:44,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:44,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:44,943 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:44,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:45,000 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:58:45,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:45,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:58:45,001 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:45,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:58:45,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:58:45,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:58:45,002 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-20 23:58:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:45,116 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-20 23:58:45,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:58:45,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-20 23:58:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:45,118 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:58:45,119 INFO L226 Difference]: Without dead ends: 16 [2018-01-20 23:58:45,119 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:58:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-01-20 23:58:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-01-20 23:58:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-01-20 23:58:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-01-20 23:58:45,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2018-01-20 23:58:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:45,130 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-01-20 23:58:45,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:58:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-01-20 23:58:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 23:58:45,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,131 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:45,131 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:58:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1253814916, now seen corresponding path program 1 times [2018-01-20 23:58:45,131 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,133 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:45,185 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:58:45,192 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,194 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,205 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:45,205 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:45,205 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:45,205 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:45,205 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:45,206 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:45,206 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:45,206 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:58:45,206 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:58:45,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,207 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:58:45,207 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:58:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash 98600, now seen corresponding path program 1 times [2018-01-20 23:58:45,208 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:45,215 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:58:45,216 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,217 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:45,217 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:45,218 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:45,218 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:45,218 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:45,218 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:45,218 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:45,218 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_2_6Err0EnsuresViolation======== [2018-01-20 23:58:45,218 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 23:58:45,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,221 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] [2018-01-20 23:58:45,221 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_2_6Err0EnsuresViolation]=== [2018-01-20 23:58:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2042031145, now seen corresponding path program 1 times [2018-01-20 23:58:45,221 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:45,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:45,259 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:58:45,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:45,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-20 23:58:45,260 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:45,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:58:45,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:58:45,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:58:45,261 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-20 23:58:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:45,265 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:58:45,265 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-20 23:58:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:45,265 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:45,265 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:45,266 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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:58:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:45,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-20 23:58:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:45,267 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:45,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:58:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:45,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:45,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:45,269 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:45,269 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:45,269 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:45,269 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:45,269 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:45,269 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:45,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:58:45,269 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:58:45,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,271 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:58:45,272 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:58:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash -151398166, now seen corresponding path program 1 times [2018-01-20 23:58:45,272 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,273 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:45,309 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:58:45,312 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,313 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,314 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,315 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,315 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,316 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:45,320 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:45,320 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:45,320 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:45,320 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:45,321 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:45,321 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:45,321 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:45,321 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:58:45,321 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:58:45,324 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,324 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:58:45,324 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:58:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash -357699046, now seen corresponding path program 1 times [2018-01-20 23:58:45,325 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,327 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:45,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:45,368 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:58:45,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:45,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:58:45,368 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:45,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:58:45,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:58:45,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:58:45,369 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-20 23:58:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:45,417 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-20 23:58:45,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:58:45,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-20 23:58:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:45,417 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:58:45,418 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:45,418 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:58:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:45,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-20 23:58:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:45,419 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:45,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:58:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:45,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:45,420 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:45,420 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:45,421 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:45,421 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:45,421 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:45,421 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:45,421 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:45,421 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 23:58:45,421 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 23:58:45,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,423 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] [2018-01-20 23:58:45,423 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:58:45,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2042083615, now seen corresponding path program 1 times [2018-01-20 23:58:45,423 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,425 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:45,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:45,512 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:58:45,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:45,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:58:45,513 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:45,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:58:45,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:58:45,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:58:45,514 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2018-01-20 23:58:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:45,665 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-20 23:58:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:45,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-20 23:58:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:45,666 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:58:45,666 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:45,666 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:58:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:45,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-20 23:58:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:45,667 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:45,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:58:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:45,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:45,669 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:45,669 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:45,669 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:45,669 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:45,669 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:45,669 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:45,669 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:45,669 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-20 23:58:45,669 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:58:45,671 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,671 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:58:45,671 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-20 23:58:45,672 INFO L82 PathProgramCache]: Analyzing trace with hash 564380501, now seen corresponding path program 1 times [2018-01-20 23:58:45,672 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,673 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:45,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:45,718 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:58:45,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:45,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:58:45,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:45,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:58:45,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:58:45,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:58:45,720 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-01-20 23:58:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:45,762 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-01-20 23:58:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:45,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-20 23:58:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:45,763 INFO L225 Difference]: With dead ends: 103 [2018-01-20 23:58:45,763 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:45,764 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:58:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:45,765 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-20 23:58:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:45,765 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:45,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:58:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:45,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:45,766 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:45,766 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:45,767 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:45,767 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:45,767 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:45,767 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:45,767 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:45,767 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe1_6Err0EnsuresViolation======== [2018-01-20 23:58:45,767 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 23:58:45,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,769 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:45,769 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe1_6Err0EnsuresViolation]=== [2018-01-20 23:58:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2060327594, now seen corresponding path program 1 times [2018-01-20 23:58:45,770 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:45,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:45,798 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:58:45,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:45,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:58:45,799 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:45,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:58:45,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:58:45,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:58:45,800 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-20 23:58:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:45,851 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-20 23:58:45,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:58:45,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-20 23:58:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:45,853 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:58:45,853 INFO L226 Difference]: Without dead ends: 35 [2018-01-20 23:58:45,853 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:58:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-20 23:58:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-20 23:58:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-20 23:58:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-20 23:58:45,860 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 17 [2018-01-20 23:58:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:45,860 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-20 23:58:45,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:58:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-20 23:58:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:58:45,862 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,862 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:58:45,862 INFO L371 AbstractCegarLoop]: === Iteration 2 === [probe1_6Err0EnsuresViolation]=== [2018-01-20 23:58:45,862 INFO L82 PathProgramCache]: Analyzing trace with hash 564305637, now seen corresponding path program 1 times [2018-01-20 23:58:45,862 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,864 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:45,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:45,920 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:58:45,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:45,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:58:45,920 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:45,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:58:45,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:58:45,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:58:45,922 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2018-01-20 23:58:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:45,937 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-20 23:58:45,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:45,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-20 23:58:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:45,939 INFO L225 Difference]: With dead ends: 54 [2018-01-20 23:58:45,939 INFO L226 Difference]: Without dead ends: 34 [2018-01-20 23:58:45,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:58:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-20 23:58:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-20 23:58:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-20 23:58:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-01-20 23:58:45,954 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 25 [2018-01-20 23:58:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:45,954 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-01-20 23:58:45,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:58:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-01-20 23:58:45,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:58:45,956 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:45,956 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:58:45,956 INFO L371 AbstractCegarLoop]: === Iteration 3 === [probe1_6Err0EnsuresViolation]=== [2018-01-20 23:58:45,956 INFO L82 PathProgramCache]: Analyzing trace with hash 398811911, now seen corresponding path program 1 times [2018-01-20 23:58:45,956 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:45,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:45,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:45,958 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:45,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:45,995 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:58:45,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:45,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:58:45,996 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:45,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:58:45,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:58:45,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:58:45,997 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 4 states. [2018-01-20 23:58:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:46,021 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-20 23:58:46,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:58:46,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-20 23:58:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:46,022 INFO L225 Difference]: With dead ends: 34 [2018-01-20 23:58:46,022 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:46,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:58:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:46,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-20 23:58:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:46,024 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:46,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:58:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:46,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:46,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:58:46 BoogieIcfgContainer [2018-01-20 23:58:46,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:58:46,028 INFO L168 Benchmark]: Toolchain (without parser) took 2224.98 ms. Allocated memory was 302.5 MB in the beginning and 476.1 MB in the end (delta: 173.5 MB). Free memory was 261.4 MB in the beginning and 436.3 MB in the end (delta: -174.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:58:46,030 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:58:46,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.84 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 247.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:46,030 INFO L168 Benchmark]: Boogie Preprocessor took 31.97 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 245.5 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:58:46,030 INFO L168 Benchmark]: RCFGBuilder took 271.98 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 228.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:46,030 INFO L168 Benchmark]: TraceAbstraction took 1683.34 ms. Allocated memory was 302.5 MB in the beginning and 476.1 MB in the end (delta: 173.5 MB). Free memory was 226.5 MB in the beginning and 436.3 MB in the end (delta: -209.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:58:46,032 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.84 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 247.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.97 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 271.98 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 228.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1683.34 ms. Allocated memory was 302.5 MB in the beginning and 476.1 MB in the end (delta: 173.5 MB). Free memory was 226.5 MB in the beginning and 436.3 MB in the end (delta: -209.8 MB). There was no memory consumed. 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) - 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: - PositiveResult [Line: 1434]: 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: f6Err0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 SDtfs, 4 SDslu, 169 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 19 PreInvPairs, 23 NumberOfFragments, 16 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 756 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 - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1474] CALL entry_point() [L1466] FCALL struct A a7; VAL [a7={7:0}] [L1467] CALL probe1_6(&a7) VAL [a={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, ret=3] [L1444] CALL ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 22 SDslu, 6 SDs, 0 SdLazy, 25 SolverSat, 16 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=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 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 - 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 9 procedures, 59 locations, 9 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=59occurred 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: 1461]: 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: disconnect_2_6Err0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1474] CALL entry_point() [L1466] FCALL struct A a7; VAL [a7={6:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={6:0}] [L1443] int ret = - -3; VAL [a={6:0}, a={6:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={6:0}, a={6:0}, ldv_malloc(sizeof(int))={0:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND TRUE p==0 [L1446] RET return ret; VAL [\result=3, a={6:0}, a={6:0}, p={0:0}, ret=3] [L1467] EXPR probe1_6(&a7) VAL [a7={6:0}, probe1_6(&a7)=3] [L1467] int ret = probe1_6(&a7); [L1468] COND FALSE, RET !(ret==0) VAL [a7={6:0}, ret=3] [L1474] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 59 locations, 9 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=59occurred 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, 27 NumberOfCodeBlocks, 27 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: 1473]: 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 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 24 SDslu, 6 SDs, 0 SdLazy, 25 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 720 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: 1465]: 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: entry_pointErr0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 19 SDslu, 22 SDs, 0 SdLazy, 61 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 1540 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: 1438]: 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: g6Err0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 SDtfs, 4 SDslu, 169 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 1152 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: 1442]: 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: probe1_6Err0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 93 SDtfs, 19 SDslu, 108 SDs, 0 SdLazy, 47 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 2684 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 - InvariantResult [Line: 1452]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-20_23-58-46-042.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-20_23-58-46-042.csv Received shutdown request...