java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:59:51,976 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:59:51,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:59:51,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:59:51,994 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:59:51,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:59:51,996 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:59:51,997 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:59:51,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:59:52,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:59:52,000 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:59:52,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:59:52,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:59:52,002 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:59:52,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:59:52,005 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:59:52,007 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:59:52,009 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:59:52,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:59:52,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:59:52,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:59:52,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:59:52,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:59:52,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:59:52,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:59:52,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:59:52,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:59:52,019 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:59:52,019 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:59:52,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:59:52,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:59:52,021 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:59:52,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:59:52,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:59:52,032 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:59:52,033 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:59:52,033 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:59:52,033 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:59:52,033 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:59:52,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:59:52,034 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:59:52,034 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:59:52,035 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:59:52,035 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:59:52,035 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:59:52,035 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:59:52,035 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:59:52,036 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:59:52,036 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:59:52,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:59:52,036 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:59:52,036 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:59:52,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:59:52,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:59:52,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:59:52,037 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:59:52,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:59:52,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:59:52,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:59:52,038 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:59:52,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:59:52,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:59:52,038 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:59:52,039 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:59:52,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:59:52,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:59:52,039 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:59:52,039 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:59:52,040 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:59:52,040 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:59:52,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:59:52,089 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:59:52,093 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:59:52,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:59:52,095 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:59:52,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i [2018-01-20 23:59:52,265 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:59:52,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:59:52,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:59:52,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:59:52,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:59:52,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c7d0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52, skipping insertion in model container [2018-01-20 23:59:52,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,304 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:59:52,357 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:59:52,473 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:59:52,487 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:59:52,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52 WrapperNode [2018-01-20 23:59:52,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:59:52,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:59:52,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:59:52,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:59:52,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (1/1) ... [2018-01-20 23:59:52,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:59:52,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:59:52,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:59:52,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:59:52,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:59:52,580 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:59:52,580 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:59:52,580 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 23:59:52,580 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_9 [2018-01-20 23:59:52,580 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_9 [2018-01-20 23:59:52,580 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 23:59:52,581 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:59:52,581 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:59:52,581 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:59:52,581 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:59:52,581 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:59:52,581 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:59:52,582 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:59:52,582 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 23:59:52,582 INFO L128 BoogieDeclarations]: Found specification of procedure probe_9 [2018-01-20 23:59:52,582 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_9 [2018-01-20 23:59:52,582 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 23:59:52,582 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:59:52,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:59:52,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:59:52,739 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:59:52,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:59:52 BoogieIcfgContainer [2018-01-20 23:59:52,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:59:52,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:59:52,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:59:52,743 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:59:52,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:59:52" (1/3) ... [2018-01-20 23:59:52,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12feb96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:59:52, skipping insertion in model container [2018-01-20 23:59:52,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:52" (2/3) ... [2018-01-20 23:59:52,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12feb96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:59:52, skipping insertion in model container [2018-01-20 23:59:52,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:59:52" (3/3) ... [2018-01-20 23:59:52,746 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test9_true-valid-memsafety_true-termination.i [2018-01-20 23:59:52,753 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:59:52,759 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-20 23:59:52,810 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:52,810 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:52,810 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:52,810 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:52,811 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:52,811 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:52,811 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:52,811 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 23:59:52,812 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:59:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-20 23:59:52,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:52,842 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:52,842 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:59:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1401889848, now seen corresponding path program 1 times [2018-01-20 23:59:52,850 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:52,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:52,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:52,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:52,901 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:52,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:53,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:53,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:53,019 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:53,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:53,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:53,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:53,038 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-01-20 23:59:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:53,232 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-20 23:59:53,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:53,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-20 23:59:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:53,241 INFO L225 Difference]: With dead ends: 40 [2018-01-20 23:59:53,242 INFO L226 Difference]: Without dead ends: 14 [2018-01-20 23:59:53,245 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-01-20 23:59:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-01-20 23:59:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-01-20 23:59:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-01-20 23:59:53,272 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 11 [2018-01-20 23:59:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:53,272 INFO L432 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-01-20 23:59:53,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:53,272 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-01-20 23:59:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 23:59:53,273 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:53,273 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:53,273 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:59:53,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1403679718, now seen corresponding path program 1 times [2018-01-20 23:59:53,273 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:53,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:53,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,276 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:53,350 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:53,360 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,362 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,372 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:53,372 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:53,373 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:53,373 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:53,373 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:53,373 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:53,373 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:53,373 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:59:53,373 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:59:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:59:53,374 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:53,374 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:59:53,374 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:59:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash 74639, now seen corresponding path program 1 times [2018-01-20 23:59:53,375 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:53,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:53,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,376 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:53,386 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:53,387 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,389 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:53,389 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:53,389 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:53,389 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:53,389 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:53,389 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:53,389 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:53,389 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe_9Err0EnsuresViolation======== [2018-01-20 23:59:53,390 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:59:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 23:59:53,391 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:53,391 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:53,392 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe_9Err0EnsuresViolation]=== [2018-01-20 23:59:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash -227032848, now seen corresponding path program 1 times [2018-01-20 23:59:53,392 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:53,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:53,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:53,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:53,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:53,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:53,443 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:53,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:53,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:53,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:53,444 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-01-20 23:59:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:53,534 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-20 23:59:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:53,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-20 23:59:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:53,535 INFO L225 Difference]: With dead ends: 40 [2018-01-20 23:59:53,535 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:53,536 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:53,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-20 23:59:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:53,537 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:53,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:53,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:53,540 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:53,540 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:53,540 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:53,540 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:53,541 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:53,541 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:53,541 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:53,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:59:53,541 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:59:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:59:53,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:53,543 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] [2018-01-20 23:59:53,543 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:59:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash 892614832, now seen corresponding path program 1 times [2018-01-20 23:59:53,543 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:53,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:53,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,545 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:53,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:53,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:53,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:53,600 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:53,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:53,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:53,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:53,601 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-20 23:59:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:53,619 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-20 23:59:53,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:53,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-20 23:59:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:53,622 INFO L225 Difference]: With dead ends: 57 [2018-01-20 23:59:53,622 INFO L226 Difference]: Without dead ends: 38 [2018-01-20 23:59:53,623 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-20 23:59:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-01-20 23:59:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-20 23:59:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-20 23:59:53,628 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 24 [2018-01-20 23:59:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:53,628 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-20 23:59:53,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-20 23:59:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:59:53,629 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:53,629 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] [2018-01-20 23:59:53,629 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:59:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash -904336527, now seen corresponding path program 1 times [2018-01-20 23:59:53,630 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:53,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:53,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:53,662 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:53,665 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,667 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,668 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,669 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,669 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,670 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:53,674 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:53,675 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:53,675 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:53,675 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:53,675 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:53,675 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:53,675 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:53,675 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:59:53,675 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:59:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 23:59:53,677 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:53,677 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] [2018-01-20 23:59:53,677 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:59:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1109307496, now seen corresponding path program 1 times [2018-01-20 23:59:53,677 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:53,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:53,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,679 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:53,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:53,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:53,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:53,748 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:53,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:53,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:53,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:53,749 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-20 23:59:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:53,770 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-20 23:59:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:53,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-20 23:59:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:53,772 INFO L225 Difference]: With dead ends: 57 [2018-01-20 23:59:53,772 INFO L226 Difference]: Without dead ends: 36 [2018-01-20 23:59:53,773 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-20 23:59:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-01-20 23:59:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-20 23:59:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-01-20 23:59:53,779 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-01-20 23:59:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:53,779 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-01-20 23:59:53,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-01-20 23:59:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 23:59:53,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:53,780 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] [2018-01-20 23:59:53,781 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:59:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash -698146967, now seen corresponding path program 1 times [2018-01-20 23:59:53,781 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:53,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:53,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,783 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:53,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:53,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:53,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:53,833 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:53,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:53,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:53,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:53,834 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2018-01-20 23:59:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:53,908 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-01-20 23:59:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:53,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-20 23:59:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:53,910 INFO L225 Difference]: With dead ends: 34 [2018-01-20 23:59:53,910 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:53,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:53,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-20 23:59:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:53,913 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:53,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:53,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:53,915 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:53,915 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:53,915 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:53,915 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:53,915 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:53,915 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:53,916 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:53,916 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 23:59:53,916 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:59:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:59:53,918 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:53,918 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:53,918 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:59:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1024616876, now seen corresponding path program 1 times [2018-01-20 23:59:53,919 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:53,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:53,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:53,920 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:53,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:53,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:53,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:53,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:53,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:53,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:53,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:53,968 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-20 23:59:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:53,991 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-20 23:59:53,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:53,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-20 23:59:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:53,993 INFO L225 Difference]: With dead ends: 57 [2018-01-20 23:59:53,993 INFO L226 Difference]: Without dead ends: 34 [2018-01-20 23:59:53,994 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-20 23:59:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-01-20 23:59:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-20 23:59:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-01-20 23:59:53,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-01-20 23:59:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:53,999 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-01-20 23:59:53,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-01-20 23:59:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:59:54,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:54,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:54,001 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:59:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1912120557, now seen corresponding path program 1 times [2018-01-20 23:59:54,001 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:54,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:54,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:54,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:54,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:54,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:54,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:54,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:54,036 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:54,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:54,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:54,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:54,037 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 3 states. [2018-01-20 23:59:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:54,066 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-01-20 23:59:54,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:54,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-20 23:59:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:54,067 INFO L225 Difference]: With dead ends: 32 [2018-01-20 23:59:54,067 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:54,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:54,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-20 23:59:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:54,069 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:54,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:54,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:54,071 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:54,071 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:54,071 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:54,071 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:54,071 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:54,071 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:54,072 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:54,072 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_9Err0EnsuresViolation======== [2018-01-20 23:59:54,072 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:59:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 23:59:54,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:54,074 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:54,074 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_9Err0EnsuresViolation]=== [2018-01-20 23:59:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1698278159, now seen corresponding path program 1 times [2018-01-20 23:59:54,075 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:54,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:54,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:54,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:54,077 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:54,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:54,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:54,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:54,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:54,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:54,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:54,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:54,133 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-20 23:59:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:54,182 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-20 23:59:54,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:54,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-20 23:59:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:54,183 INFO L225 Difference]: With dead ends: 74 [2018-01-20 23:59:54,183 INFO L226 Difference]: Without dead ends: 36 [2018-01-20 23:59:54,184 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-20 23:59:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-20 23:59:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-01-20 23:59:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-20 23:59:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-01-20 23:59:54,187 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-01-20 23:59:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:54,187 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-01-20 23:59:54,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-01-20 23:59:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 23:59:54,188 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:54,188 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:54,188 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_9Err0EnsuresViolation]=== [2018-01-20 23:59:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash -853878802, now seen corresponding path program 1 times [2018-01-20 23:59:54,189 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:54,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:54,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:54,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:54,190 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:54,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:54,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:54,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:59:54,270 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:54,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 23:59:54,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 23:59:54,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-20 23:59:54,271 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-01-20 23:59:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:54,391 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-01-20 23:59:54,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 23:59:54,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-20 23:59:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:54,392 INFO L225 Difference]: With dead ends: 36 [2018-01-20 23:59:54,392 INFO L226 Difference]: Without dead ends: 24 [2018-01-20 23:59:54,393 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-20 23:59:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-20 23:59:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-20 23:59:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-20 23:59:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2018-01-20 23:59:54,398 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 21 [2018-01-20 23:59:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:54,398 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2018-01-20 23:59:54,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 23:59:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2018-01-20 23:59:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 23:59:54,399 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:54,399 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:54,399 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_9Err0EnsuresViolation]=== [2018-01-20 23:59:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1951473777, now seen corresponding path program 1 times [2018-01-20 23:59:54,400 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:54,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:54,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:54,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:54,402 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:54,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:54,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:54,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:59:54,445 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:54,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:59:54,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:59:54,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:59:54,446 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 4 states. [2018-01-20 23:59:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:54,480 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-01-20 23:59:54,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:59:54,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-20 23:59:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:54,481 INFO L225 Difference]: With dead ends: 24 [2018-01-20 23:59:54,481 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:54,481 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:59:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:54,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-20 23:59:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:54,482 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:54,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:59:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:54,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:54,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:59:54 BoogieIcfgContainer [2018-01-20 23:59:54,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:59:54,485 INFO L168 Benchmark]: Toolchain (without parser) took 2219.12 ms. Allocated memory was 299.4 MB in the beginning and 472.9 MB in the end (delta: 173.5 MB). Free memory was 258.3 MB in the beginning and 440.4 MB in the end (delta: -182.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:59:54,486 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 299.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:59:54,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.52 ms. Allocated memory is still 299.4 MB. Free memory was 258.3 MB in the beginning and 245.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:54,487 INFO L168 Benchmark]: Boogie Preprocessor took 37.69 ms. Allocated memory is still 299.4 MB. Free memory was 245.1 MB in the beginning and 244.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-20 23:59:54,487 INFO L168 Benchmark]: RCFGBuilder took 207.04 ms. Allocated memory is still 299.4 MB. Free memory was 244.1 MB in the beginning and 229.0 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:54,487 INFO L168 Benchmark]: TraceAbstraction took 1743.27 ms. Allocated memory was 299.4 MB in the beginning and 472.9 MB in the end (delta: 173.5 MB). Free memory was 229.0 MB in the beginning and 440.4 MB in the end (delta: -211.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:59:54,489 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 299.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.52 ms. Allocated memory is still 299.4 MB. Free memory was 258.3 MB in the beginning and 245.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.69 ms. Allocated memory is still 299.4 MB. Free memory was 245.1 MB in the beginning and 244.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 207.04 ms. Allocated memory is still 299.4 MB. Free memory was 244.1 MB in the beginning and 229.0 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1743.27 ms. Allocated memory was 299.4 MB in the beginning and 472.9 MB in the end (delta: 173.5 MB). Free memory was 229.0 MB in the beginning and 440.4 MB in the end (delta: -211.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1434] int *a9; VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1457] CALL entry_point() VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1449] CALL probe_9() VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1437] CALL ldv_malloc(sizeof(int)) VAL [\old(a9)=0, \old(a9)=0, \old(size)=4, a9={0:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(a9)=0, \old(a9)=0, \old(size)=4, a9={0:0}, malloc(size)={7:0}, size=4] [L1074] return malloc(size); VAL [\old(a9)=0, \old(a9)=0, \old(size)=4, \result={7:0}, a9={0:0}, malloc(size)={7:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 38 locations, 7 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 12 SDslu, 1 SDs, 0 SdLazy, 20 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 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: [L1434] int *a9; VAL [\old(a9)=2, \old(a9)=3, a9={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 38 locations, 7 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=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1436]: 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: probe_9Err0EnsuresViolation CFG has 7 procedures, 38 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 9 SDslu, 1 SDs, 0 SdLazy, 20 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 420 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: [L1434] int *a9; VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1457] CALL entry_point() VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1449] CALL, EXPR probe_9() VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1437] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(a9)=0, \old(a9)=0, \old(size)=4, a9={0:0}] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(a9)=0, \old(a9)=0, \old(size)=4, \result={0:0}, a9={0:0}, size=4] [L1437] EXPR ldv_malloc(sizeof(int)) VAL [\old(a9)=0, \old(a9)=0, a9={0:0}, ldv_malloc(sizeof(int))={0:0}] [L1437] a9 = (int *)ldv_malloc(sizeof(int)) [L1438] COND FALSE !(\read(*a9)) [L1441] RET return - -3; VAL [\old(a9)=0, \old(a9)=0, \result=3, a9={0:0}] [L1449] EXPR probe_9() VAL [\old(a9)=0, \old(a9)=0, a9={0:0}, probe_9()=3] [L1449] int ret = probe_9(); [L1450] COND FALSE !(ret==0) VAL [\old(a9)=0, \old(a9)=0, a9={0:0}, ret=3] [L1453] RET a9 = 0 VAL [\old(a9)=0, \old(a9)=0, a9={0:0}, ret=3] [L1457] entry_point() VAL [a9={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 38 locations, 7 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 5 SDslu, 119 SDs, 0 SdLazy, 9 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=38occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 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: 1456]: 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 7 procedures, 38 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 8 SDslu, 120 SDs, 0 SdLazy, 23 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1448]: 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 7 procedures, 38 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 8 SDslu, 120 SDs, 0 SdLazy, 21 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 1406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1444]: 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_9Err0EnsuresViolation CFG has 7 procedures, 38 locations, 7 error locations. SAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 59 SDslu, 126 SDs, 0 SdLazy, 66 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 2548 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-59-54-499.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-59-54-499.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-59-54-499.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-59-54-499.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-59-54-499.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-59-54-499.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_23-59-54-499.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_23-59-54-499.csv Received shutdown request...