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_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 08:57:19,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 08:57:19,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 08:57:19,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 08:57:19,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 08:57:19,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 08:57:19,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 08:57:19,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 08:57:19,467 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 08:57:19,468 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 08:57:19,469 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 08:57:19,469 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 08:57:19,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 08:57:19,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 08:57:19,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 08:57:19,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 08:57:19,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 08:57:19,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 08:57:19,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 08:57:19,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 08:57:19,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 08:57:19,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 08:57:19,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 08:57:19,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 08:57:19,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 08:57:19,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 08:57:19,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 08:57:19,489 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 08:57:19,490 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 08:57:19,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 08:57:19,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 08:57:19,491 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_preciseopt.epf [2018-01-21 08:57:19,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 08:57:19,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 08:57:19,501 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 08:57:19,501 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 08:57:19,501 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 08:57:19,501 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 08:57:19,501 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 08:57:19,502 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 08:57:19,502 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 08:57:19,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 08:57:19,502 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 08:57:19,503 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 08:57:19,503 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 08:57:19,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 08:57:19,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 08:57:19,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 08:57:19,503 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 08:57:19,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 08:57:19,504 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 08:57:19,504 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 08:57:19,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 08:57:19,504 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 08:57:19,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 08:57:19,504 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 08:57:19,505 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 08:57:19,505 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 08:57:19,505 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 08:57:19,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:57:19,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 08:57:19,505 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 08:57:19,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 08:57:19,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 08:57:19,506 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 08:57:19,506 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 08:57:19,506 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 08:57:19,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 08:57:19,506 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 08:57:19,506 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 08:57:19,507 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 08:57:19,507 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 08:57:19,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 08:57:19,552 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 08:57:19,556 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 08:57:19,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 08:57:19,558 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 08:57:19,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-21 08:57:19,766 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 08:57:19,771 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 08:57:19,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 08:57:19,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 08:57:19,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 08:57:19,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:19,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a855a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19, skipping insertion in model container [2018-01-21 08:57:19,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:19,794 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:57:19,840 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:57:19,956 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:57:19,977 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:57:19,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19 WrapperNode [2018-01-21 08:57:19,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 08:57:19,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 08:57:19,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 08:57:19,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 08:57:20,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:20,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:20,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:20,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:20,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:20,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:20,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (1/1) ... [2018-01-21 08:57:20,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 08:57:20,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 08:57:20,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 08:57:20,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 08:57:20,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:57:20,074 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 08:57:20,074 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 08:57:20,074 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 08:57:20,074 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-21 08:57:20,074 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-21 08:57:20,075 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-21 08:57:20,075 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-21 08:57:20,075 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 08:57:20,075 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 08:57:20,075 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 08:57:20,075 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 08:57:20,075 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 08:57:20,075 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 08:57:20,075 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 08:57:20,076 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 08:57:20,077 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 08:57:20,077 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 08:57:20,314 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 08:57:20,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:57:20 BoogieIcfgContainer [2018-01-21 08:57:20,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 08:57:20,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 08:57:20,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 08:57:20,317 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 08:57:20,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 08:57:19" (1/3) ... [2018-01-21 08:57:20,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e78721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:57:20, skipping insertion in model container [2018-01-21 08:57:20,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:19" (2/3) ... [2018-01-21 08:57:20,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e78721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:57:20, skipping insertion in model container [2018-01-21 08:57:20,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:57:20" (3/3) ... [2018-01-21 08:57:20,320 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-21 08:57:20,327 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 08:57:20,332 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-21 08:57:20,379 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:20,379 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:20,379 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:20,379 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:20,379 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:20,380 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:20,380 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:20,380 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-21 08:57:20,381 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 08:57:20,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:20,411 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-21 08:57:20,411 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-21 08:57:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1141227672, now seen corresponding path program 1 times [2018-01-21 08:57:20,419 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:20,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:20,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:20,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:20,483 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:20,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:20,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:20,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:57:20,717 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:20,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:57:20,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:57:20,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:57:20,794 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-01-21 08:57:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:20,854 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-21 08:57:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:57:20,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 08:57:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:20,862 INFO L225 Difference]: With dead ends: 110 [2018-01-21 08:57:20,862 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:20,865 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-21 08:57:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:20,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-21 08:57:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:20,887 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:20,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:57:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:20,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:20,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 08:57:20,927 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 08:57:20,927 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 08:57:20,927 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 08:57:20,927 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 08:57:20,927 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 08:57:20,928 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 08:57:20,928 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 08:57:20,928 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:57:20,928 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:57:20,928 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:57:20,928 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 08:57:20,928 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,929 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,929 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-21 08:57:20,929 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,929 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-21 08:57:20,929 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,929 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1476) the Hoare annotation is: true [2018-01-21 08:57:20,929 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,930 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,930 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1474 1476) the Hoare annotation is: true [2018-01-21 08:57:20,930 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1474 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,930 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1474 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,930 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1474 1476) no Hoare annotation was computed. [2018-01-21 08:57:20,930 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: true [2018-01-21 08:57:20,931 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 08:57:20,931 INFO L401 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-21 08:57:20,931 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-21 08:57:20,931 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 08:57:20,931 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 08:57:20,931 INFO L401 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-21 08:57:20,931 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1466 1472) no Hoare annotation was computed. [2018-01-21 08:57:20,931 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1466 1472) no Hoare annotation was computed. [2018-01-21 08:57:20,932 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-21 08:57:20,932 INFO L404 ceAbstractionStarter]: At program point L1470(line 1470) the Hoare annotation is: true [2018-01-21 08:57:20,932 INFO L401 ceAbstractionStarter]: For program point L1469'(lines 1469 1471) no Hoare annotation was computed. [2018-01-21 08:57:20,932 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1466 1472) the Hoare annotation is: true [2018-01-21 08:57:20,932 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-21 08:57:20,932 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1466 1472) no Hoare annotation was computed. [2018-01-21 08:57:20,932 INFO L404 ceAbstractionStarter]: At program point L1467(line 1467) the Hoare annotation is: true [2018-01-21 08:57:20,933 INFO L401 ceAbstractionStarter]: For program point L1468(line 1468) no Hoare annotation was computed. [2018-01-21 08:57:20,933 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 08:57:20,933 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 08:57:20,933 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 08:57:20,933 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 08:57:20,933 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-21 08:57:20,933 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-21 08:57:20,934 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-21 08:57:20,934 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 08:57:20,934 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-21 08:57:20,934 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-21 08:57:20,934 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-21 08:57:20,934 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-21 08:57:20,934 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 08:57:20,935 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-21 08:57:20,935 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-21 08:57:20,935 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-21 08:57:20,935 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 08:57:20,935 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-21 08:57:20,935 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-21 08:57:20,935 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-21 08:57:20,936 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 08:57:20,939 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:20,940 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:20,940 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:20,940 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:20,940 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:20,940 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:20,940 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:20,940 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 08:57:20,941 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 08:57:20,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:20,944 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:20,944 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 08:57:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash 670629914, now seen corresponding path program 1 times [2018-01-21 08:57:20,945 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:20,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:20,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:20,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:20,947 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:20,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:20,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:20,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:57:20,994 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:20,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:57:20,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:57:20,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:20,995 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-21 08:57:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:21,088 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-21 08:57:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:57:21,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-21 08:57:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:21,090 INFO L225 Difference]: With dead ends: 66 [2018-01-21 08:57:21,090 INFO L226 Difference]: Without dead ends: 16 [2018-01-21 08:57:21,091 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-01-21 08:57:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-01-21 08:57:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-01-21 08:57:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-01-21 08:57:21,101 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2018-01-21 08:57:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:21,102 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-01-21 08:57:21,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:57:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-01-21 08:57:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 08:57:21,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,103 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:21,103 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 08:57:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash 230160188, now seen corresponding path program 1 times [2018-01-21 08:57:21,103 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,105 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:21,168 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:57:21,177 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,179 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,191 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:21,191 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:21,191 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:21,191 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:21,191 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:21,192 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:21,192 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:21,192 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 08:57:21,192 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 08:57:21,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,195 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 08:57:21,195 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 08:57:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash 101483, now seen corresponding path program 1 times [2018-01-21 08:57:21,195 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,197 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:21,205 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:57:21,206 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,209 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:21,209 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:21,209 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:21,209 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:21,209 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:21,209 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:21,210 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:21,210 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 08:57:21,210 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 08:57:21,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,214 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:21,214 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:57:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1487692289, now seen corresponding path program 1 times [2018-01-21 08:57:21,215 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,217 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:21,257 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:57:21,261 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,262 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,263 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,264 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,264 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,265 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:21,269 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:21,270 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:21,270 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:21,270 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:21,270 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:21,270 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:21,270 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:21,270 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 08:57:21,270 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 08:57:21,274 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,274 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:21,275 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 08:57:21,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2146797079, now seen corresponding path program 1 times [2018-01-21 08:57:21,275 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,277 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:21,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:21,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:21,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:57:21,333 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:21,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:57:21,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:57:21,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:21,334 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-21 08:57:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:21,395 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-21 08:57:21,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:57:21,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 08:57:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:21,396 INFO L225 Difference]: With dead ends: 66 [2018-01-21 08:57:21,396 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:21,397 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-21 08:57:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:21,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 08:57:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:21,397 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:21,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:57:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:21,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:21,399 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:21,399 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:21,399 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:21,399 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:21,399 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:21,399 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:21,399 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:21,399 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_6Err0EnsuresViolation======== [2018-01-21 08:57:21,399 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 08:57:21,401 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,401 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] [2018-01-21 08:57:21,401 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 08:57:21,402 INFO L82 PathProgramCache]: Analyzing trace with hash 563976181, now seen corresponding path program 1 times [2018-01-21 08:57:21,402 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,403 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:21,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:21,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:21,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 08:57:21,479 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:21,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 08:57:21,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 08:57:21,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:57:21,480 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 08:57:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:21,516 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-21 08:57:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 08:57:21,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-21 08:57:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:21,517 INFO L225 Difference]: With dead ends: 91 [2018-01-21 08:57:21,517 INFO L226 Difference]: Without dead ends: 45 [2018-01-21 08:57:21,518 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-21 08:57:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-21 08:57:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-21 08:57:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 08:57:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-21 08:57:21,524 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2018-01-21 08:57:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:21,524 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-21 08:57:21,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 08:57:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-21 08:57:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 08:57:21,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,526 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:21,526 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 08:57:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash -493276934, now seen corresponding path program 1 times [2018-01-21 08:57:21,526 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:21,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:21,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:21,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:57:21,598 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:21,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:57:21,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:57:21,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:57:21,599 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 5 states. [2018-01-21 08:57:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:21,614 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-21 08:57:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:57:21,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-21 08:57:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:21,616 INFO L225 Difference]: With dead ends: 76 [2018-01-21 08:57:21,616 INFO L226 Difference]: Without dead ends: 45 [2018-01-21 08:57:21,618 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-21 08:57:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-21 08:57:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-21 08:57:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 08:57:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-01-21 08:57:21,624 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2018-01-21 08:57:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:21,625 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-01-21 08:57:21,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:57:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-01-21 08:57:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 08:57:21,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,627 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:21,627 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 08:57:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2073205992, now seen corresponding path program 1 times [2018-01-21 08:57:21,627 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,629 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:21,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:21,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:21,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 08:57:21,675 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:21,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:57:21,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:57:21,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:57:21,676 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 4 states. [2018-01-21 08:57:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:21,723 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-01-21 08:57:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 08:57:21,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-21 08:57:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:21,725 INFO L225 Difference]: With dead ends: 45 [2018-01-21 08:57:21,725 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:21,725 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-21 08:57:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:21,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:21,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-01-21 08:57:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:21,727 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:21,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:57:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:21,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:21,730 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:21,730 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:21,730 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:21,731 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:21,731 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:21,731 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:21,731 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:21,731 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 08:57:21,731 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 08:57:21,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,734 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-21 08:57:21,734 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 08:57:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2062568257, now seen corresponding path program 1 times [2018-01-21 08:57:21,734 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,736 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:21,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:21,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:21,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 08:57:21,824 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:21,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:57:21,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:57:21,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:57:21,825 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 4 states. [2018-01-21 08:57:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:21,926 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-21 08:57:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:57:21,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 08:57:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:21,927 INFO L225 Difference]: With dead ends: 66 [2018-01-21 08:57:21,928 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:21,928 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-21 08:57:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:21,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 08:57:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:21,930 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:21,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:57:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:21,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:21,931 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:21,931 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:21,932 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:21,932 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:21,932 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:21,932 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:21,932 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:21,932 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-21 08:57:21,932 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 08:57:21,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:21,934 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:21,934 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-21 08:57:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash -527098219, now seen corresponding path program 1 times [2018-01-21 08:57:21,934 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:21,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:21,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:21,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:21,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:21,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:21,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:57:21,991 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:21,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:57:21,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:57:21,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:57:21,992 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-01-21 08:57:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:22,030 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-21 08:57:22,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:57:22,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 08:57:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:22,031 INFO L225 Difference]: With dead ends: 110 [2018-01-21 08:57:22,031 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:22,032 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-21 08:57:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:22,033 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 08:57:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:22,033 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:22,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:57:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:22,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:22,035 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:22,036 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:22,036 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:22,036 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:22,036 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:22,036 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:22,037 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:22,037 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe1_6Err0EnsuresViolation======== [2018-01-21 08:57:22,037 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:57:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 08:57:22,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:22,039 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:22,039 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 08:57:22,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2063614678, now seen corresponding path program 1 times [2018-01-21 08:57:22,039 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:22,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:22,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:22,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:22,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:22,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:57:22,067 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:22,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:57:22,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:57:22,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:22,068 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-21 08:57:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:22,114 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-21 08:57:22,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:57:22,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 08:57:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:22,116 INFO L225 Difference]: With dead ends: 66 [2018-01-21 08:57:22,116 INFO L226 Difference]: Without dead ends: 35 [2018-01-21 08:57:22,116 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-21 08:57:22,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-21 08:57:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-21 08:57:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 08:57:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-21 08:57:22,121 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 17 [2018-01-21 08:57:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:22,122 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-21 08:57:22,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:57:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-21 08:57:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 08:57:22,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:22,123 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:22,123 INFO L371 AbstractCegarLoop]: === Iteration 2 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 08:57:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -527172987, now seen corresponding path program 1 times [2018-01-21 08:57:22,123 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:22,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:22,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:22,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:22,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:22,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:57:22,186 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:22,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:57:22,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:57:22,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:57:22,187 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2018-01-21 08:57:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:22,206 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-21 08:57:22,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:57:22,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 08:57:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:22,207 INFO L225 Difference]: With dead ends: 54 [2018-01-21 08:57:22,207 INFO L226 Difference]: Without dead ends: 34 [2018-01-21 08:57:22,208 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-21 08:57:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-21 08:57:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-21 08:57:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 08:57:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-01-21 08:57:22,216 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 25 [2018-01-21 08:57:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:22,218 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-01-21 08:57:22,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:57:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-01-21 08:57:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 08:57:22,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:22,219 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:22,219 INFO L371 AbstractCegarLoop]: === Iteration 3 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 08:57:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash 838815399, now seen corresponding path program 1 times [2018-01-21 08:57:22,219 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:22,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:22,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,221 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:22,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:57:22,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:22,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 08:57:22,261 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:22,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:57:22,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:57:22,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:57:22,262 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 4 states. [2018-01-21 08:57:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:22,282 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-21 08:57:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 08:57:22,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-21 08:57:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:22,283 INFO L225 Difference]: With dead ends: 34 [2018-01-21 08:57:22,283 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:22,283 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-21 08:57:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:22,284 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 08:57:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:22,284 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:22,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:57:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:22,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:22,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 08:57:22 BoogieIcfgContainer [2018-01-21 08:57:22,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 08:57:22,287 INFO L168 Benchmark]: Toolchain (without parser) took 2520.54 ms. Allocated memory was 305.7 MB in the beginning and 475.0 MB in the end (delta: 169.3 MB). Free memory was 263.0 MB in the beginning and 394.2 MB in the end (delta: -131.2 MB). Peak memory consumption was 38.1 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:22,289 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:57:22,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.60 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 250.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:22,290 INFO L168 Benchmark]: Boogie Preprocessor took 36.80 ms. Allocated memory is still 305.7 MB. Free memory was 250.0 MB in the beginning and 247.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:22,290 INFO L168 Benchmark]: RCFGBuilder took 290.17 ms. Allocated memory is still 305.7 MB. Free memory was 247.9 MB in the beginning and 229.2 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:22,290 INFO L168 Benchmark]: TraceAbstraction took 1970.81 ms. Allocated memory was 305.7 MB in the beginning and 475.0 MB in the end (delta: 169.3 MB). Free memory was 229.2 MB in the beginning and 394.2 MB in the end (delta: -165.0 MB). Peak memory consumption was 4.4 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:22,292 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.13 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.60 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 250.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.80 ms. Allocated memory is still 305.7 MB. Free memory was 250.0 MB in the beginning and 247.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 290.17 ms. Allocated memory is still 305.7 MB. Free memory was 247.9 MB in the beginning and 229.2 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1970.81 ms. Allocated memory was 305.7 MB in the beginning and 475.0 MB in the end (delta: 169.3 MB). Free memory was 229.2 MB in the beginning and 394.2 MB in the end (delta: -165.0 MB). Peak memory consumption was 4.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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, 62 locations, 9 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 4 SDslu, 181 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=62occurred 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: [L1475] CALL entry_point() [L1467] FCALL struct A a7; VAL [a7={7:0}] [L1468] 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, 62 locations, 9 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 22 SDslu, 7 SDs, 0 SdLazy, 28 SolverSat, 17 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=62occurred 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, 62 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=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1475] CALL entry_point() [L1467] FCALL struct A a7; VAL [a7={6:0}] [L1468] 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] [L1468] EXPR probe1_6(&a7) VAL [a7={6:0}, probe1_6(&a7)=3] [L1468] int ret = probe1_6(&a7); [L1469] COND FALSE, RET !(ret==0) VAL [a7={6:0}, ret=3] [L1475] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 62 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=62occurred 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: 1474]: 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, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 24 SDslu, 7 SDs, 0 SdLazy, 28 SolverSat, 15 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=62occurred 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: 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_6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 11 SDslu, 366 SDs, 0 SdLazy, 46 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 4501 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 - PositiveResult [Line: 1466]: 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, 62 locations, 9 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 SDtfs, 19 SDslu, 26 SDs, 0 SdLazy, 65 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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=62occurred 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, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 4 SDslu, 181 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=62occurred 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, 62 locations, 9 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 19 SDslu, 109 SDs, 0 SdLazy, 50 SolverSat, 21 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=62occurred 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.1s 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_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_08-57-22-305.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_08-57-22-305.csv Received shutdown request...