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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:32:19,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:32:19,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:32:19,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:32:19,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:32:19,038 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:32:19,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:32:19,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:32:19,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:32:19,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:32:19,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:32:19,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:32:19,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:32:19,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:32:19,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:32:19,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:32:19,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:32:19,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:32:19,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:32:19,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:32:19,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:32:19,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:32:19,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:32:19,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:32:19,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:32:19,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:32:19,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:32:19,097 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:32:19,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:32:19,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:32:19,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:32:19,100 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_mostprecise.epf [2018-01-21 03:32:19,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:32:19,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:32:19,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:32:19,116 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:32:19,116 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:32:19,116 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:32:19,116 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:32:19,116 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:32:19,117 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:32:19,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:32:19,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:32:19,118 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:32:19,118 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:32:19,118 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:32:19,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:32:19,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:32:19,119 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:32:19,119 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:32:19,119 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:32:19,119 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:32:19,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:32:19,120 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:32:19,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:32:19,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:32:19,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:32:19,120 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:32:19,121 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:32:19,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:32:19,121 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:32:19,121 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:32:19,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:32:19,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:32:19,122 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:32:19,122 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:32:19,125 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:32:19,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:32:19,125 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:32:19,125 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:32:19,126 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:32:19,126 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:32:19,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:32:19,208 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:32:19,212 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:32:19,214 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:32:19,214 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:32:19,215 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-21 03:32:19,408 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:32:19,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:32:19,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:32:19,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:32:19,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:32:19,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19, skipping insertion in model container [2018-01-21 03:32:19,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,440 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:32:19,514 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:32:19,638 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:32:19,654 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:32:19,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19 WrapperNode [2018-01-21 03:32:19,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:32:19,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:32:19,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:32:19,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:32:19,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (1/1) ... [2018-01-21 03:32:19,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:32:19,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:32:19,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:32:19,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:32:19,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:32:19,767 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:32:19,767 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:32:19,768 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 03:32:19,768 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_9 [2018-01-21 03:32:19,768 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_9 [2018-01-21 03:32:19,768 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 03:32:19,768 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:32:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:32:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:32:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:32:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:32:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:32:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:32:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 03:32:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure probe_9 [2018-01-21 03:32:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_9 [2018-01-21 03:32:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 03:32:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:32:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:32:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:32:19,946 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:32:19,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:32:19 BoogieIcfgContainer [2018-01-21 03:32:19,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:32:19,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:32:19,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:32:19,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:32:19,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:32:19" (1/3) ... [2018-01-21 03:32:19,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc95d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:32:19, skipping insertion in model container [2018-01-21 03:32:19,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:32:19" (2/3) ... [2018-01-21 03:32:19,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc95d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:32:19, skipping insertion in model container [2018-01-21 03:32:19,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:32:19" (3/3) ... [2018-01-21 03:32:19,955 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test9_true-valid-memsafety_true-termination.i [2018-01-21 03:32:19,965 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:32:19,974 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 03:32:20,026 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:32:20,026 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:32:20,026 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:32:20,026 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:32:20,026 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:32:20,027 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:32:20,027 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:32:20,027 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 03:32:20,028 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:32:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 03:32:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 03:32:20,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:20,063 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:32:20,063 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:32:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1401889848, now seen corresponding path program 1 times [2018-01-21 03:32:20,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:20,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:20,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:20,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:20,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-21 03:32:20,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:20,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:32:20,272 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:20,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:32:20,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:32:20,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:32:20,287 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-01-21 03:32:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:20,490 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-21 03:32:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:32:20,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 03:32:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:20,589 INFO L225 Difference]: With dead ends: 40 [2018-01-21 03:32:20,589 INFO L226 Difference]: Without dead ends: 14 [2018-01-21 03:32:20,592 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:32:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-01-21 03:32:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-01-21 03:32:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-01-21 03:32:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-01-21 03:32:20,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 11 [2018-01-21 03:32:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:20,624 INFO L432 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-01-21 03:32:20,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:32:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-01-21 03:32:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 03:32:20,625 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:20,625 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:32:20,625 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:32:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1403679718, now seen corresponding path program 1 times [2018-01-21 03:32:20,626 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:20,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:20,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,629 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:32:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:32:20,720 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:32:20,730 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:20,732 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:20,747 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:32:20,747 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:32:20,747 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:32:20,747 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:32:20,747 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:32:20,747 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:32:20,747 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:32:20,747 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:32:20,748 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:32:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 03:32:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:32:20,749 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:20,749 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:32:20,749 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:32:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash 74639, now seen corresponding path program 1 times [2018-01-21 03:32:20,750 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:20,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:20,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,751 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:32:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:32:20,768 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:32:20,769 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:20,771 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:32:20,771 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:32:20,771 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:32:20,771 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:32:20,771 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:32:20,771 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:32:20,771 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:32:20,771 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe_9Err0EnsuresViolation======== [2018-01-21 03:32:20,771 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:32:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 03:32:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 03:32:20,773 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:20,773 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:32:20,773 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe_9Err0EnsuresViolation]=== [2018-01-21 03:32:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash -227032848, now seen corresponding path program 1 times [2018-01-21 03:32:20,774 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:20,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:20,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,775 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:20,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:20,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:20,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:32:20,879 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:20,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:32:20,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:32:20,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:32:20,880 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-01-21 03:32:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:20,958 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-21 03:32:20,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:32:20,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 03:32:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:20,959 INFO L225 Difference]: With dead ends: 40 [2018-01-21 03:32:20,959 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:32:20,959 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:32:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:32:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:32:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:32:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:32:20,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-21 03:32:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:20,960 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:32:20,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:32:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:32:20,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:32:20,963 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:32:20,964 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:32:20,964 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:32:20,964 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:32:20,964 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:32:20,964 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:32:20,964 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:32:20,964 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:32:20,964 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:32:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 03:32:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 03:32:20,967 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:20,968 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-21 03:32:20,968 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:32:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 892614832, now seen corresponding path program 1 times [2018-01-21 03:32:20,968 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:20,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:20,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:20,970 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:20,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:21,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:21,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:32:21,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:21,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:32:21,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:32:21,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:32:21,045 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-21 03:32:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:21,060 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-21 03:32:21,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:32:21,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-21 03:32:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:21,063 INFO L225 Difference]: With dead ends: 57 [2018-01-21 03:32:21,064 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 03:32:21,064 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:32:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 03:32:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-01-21 03:32:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-21 03:32:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-21 03:32:21,069 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 24 [2018-01-21 03:32:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:21,069 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-21 03:32:21,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:32:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-21 03:32:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 03:32:21,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:21,071 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-21 03:32:21,071 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:32:21,071 INFO L82 PathProgramCache]: Analyzing trace with hash -904336527, now seen corresponding path program 1 times [2018-01-21 03:32:21,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:21,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:21,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:32:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:32:21,106 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:32:21,109 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:21,111 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:21,112 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:21,113 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:21,114 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:21,114 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:32:21,119 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:32:21,120 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:32:21,120 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:32:21,120 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:32:21,120 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:32:21,120 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:32:21,120 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:32:21,120 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:32:21,120 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:32:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 03:32:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 03:32:21,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:21,122 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-21 03:32:21,122 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:32:21,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1109307496, now seen corresponding path program 1 times [2018-01-21 03:32:21,123 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:21,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:21,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:21,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:21,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:21,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:32:21,170 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:21,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:32:21,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:32:21,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:32:21,171 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-21 03:32:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:21,184 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-21 03:32:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:32:21,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 03:32:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:21,185 INFO L225 Difference]: With dead ends: 57 [2018-01-21 03:32:21,185 INFO L226 Difference]: Without dead ends: 36 [2018-01-21 03:32:21,186 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:32:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-21 03:32:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-01-21 03:32:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-21 03:32:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-01-21 03:32:21,190 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-01-21 03:32:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:21,190 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-01-21 03:32:21,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:32:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-01-21 03:32:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 03:32:21,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:21,191 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-21 03:32:21,191 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 03:32:21,192 INFO L82 PathProgramCache]: Analyzing trace with hash -698146967, now seen corresponding path program 1 times [2018-01-21 03:32:21,192 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:21,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:21,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:21,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:21,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:21,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:32:21,231 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:21,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:32:21,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:32:21,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:32:21,232 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2018-01-21 03:32:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:21,276 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-01-21 03:32:21,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:32:21,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-21 03:32:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:21,277 INFO L225 Difference]: With dead ends: 34 [2018-01-21 03:32:21,277 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:32:21,278 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-21 03:32:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:32:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:32:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:32:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:32:21,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-21 03:32:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:21,279 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:32:21,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:32:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:32:21,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:32:21,280 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:32:21,281 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:32:21,281 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:32:21,281 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:32:21,281 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:32:21,281 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:32:21,281 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:32:21,281 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 03:32:21,281 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:32:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 03:32:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 03:32:21,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:21,283 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:32:21,283 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 03:32:21,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1024616876, now seen corresponding path program 1 times [2018-01-21 03:32:21,283 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:21,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:21,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,284 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:21,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:21,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:21,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:32:21,339 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:21,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:32:21,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:32:21,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:32:21,340 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-21 03:32:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:21,359 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-21 03:32:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:32:21,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-21 03:32:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:21,360 INFO L225 Difference]: With dead ends: 57 [2018-01-21 03:32:21,361 INFO L226 Difference]: Without dead ends: 34 [2018-01-21 03:32:21,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:32:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-21 03:32:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-01-21 03:32:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 03:32:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-01-21 03:32:21,366 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-01-21 03:32:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:21,367 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-01-21 03:32:21,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:32:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-01-21 03:32:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 03:32:21,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:21,368 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:32:21,368 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 03:32:21,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1912120557, now seen corresponding path program 1 times [2018-01-21 03:32:21,369 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:21,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:21,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,371 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:21,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:21,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:21,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:32:21,405 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:21,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:32:21,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:32:21,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:32:21,407 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 3 states. [2018-01-21 03:32:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:21,438 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-01-21 03:32:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:32:21,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-21 03:32:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:21,439 INFO L225 Difference]: With dead ends: 32 [2018-01-21 03:32:21,439 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:32:21,440 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-21 03:32:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:32:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:32:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:32:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:32:21,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 03:32:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:21,441 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:32:21,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:32:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:32:21,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:32:21,442 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:32:21,442 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:32:21,442 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:32:21,443 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:32:21,443 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:32:21,443 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:32:21,443 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:32:21,443 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_9Err0EnsuresViolation======== [2018-01-21 03:32:21,443 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:32:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-21 03:32:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 03:32:21,444 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:21,445 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:32:21,445 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_9Err0EnsuresViolation]=== [2018-01-21 03:32:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1698278159, now seen corresponding path program 1 times [2018-01-21 03:32:21,445 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:21,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:21,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:21,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:21,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:21,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:32:21,495 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:21,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:32:21,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:32:21,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:32:21,496 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-21 03:32:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:21,561 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-21 03:32:21,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:32:21,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-21 03:32:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:21,562 INFO L225 Difference]: With dead ends: 74 [2018-01-21 03:32:21,563 INFO L226 Difference]: Without dead ends: 36 [2018-01-21 03:32:21,563 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-21 03:32:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-21 03:32:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-01-21 03:32:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-21 03:32:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-01-21 03:32:21,569 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-01-21 03:32:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:21,569 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-01-21 03:32:21,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:32:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-01-21 03:32:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 03:32:21,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:21,570 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:32:21,571 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_9Err0EnsuresViolation]=== [2018-01-21 03:32:21,571 INFO L82 PathProgramCache]: Analyzing trace with hash -853878802, now seen corresponding path program 1 times [2018-01-21 03:32:21,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:21,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:21,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:21,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:21,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:21,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 03:32:21,637 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:21,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 03:32:21,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 03:32:21,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:32:21,638 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-01-21 03:32:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:21,775 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-01-21 03:32:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 03:32:21,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-21 03:32:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:21,776 INFO L225 Difference]: With dead ends: 36 [2018-01-21 03:32:21,776 INFO L226 Difference]: Without dead ends: 24 [2018-01-21 03:32:21,776 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-21 03:32:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-21 03:32:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-21 03:32:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-21 03:32:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2018-01-21 03:32:21,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 21 [2018-01-21 03:32:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:21,780 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2018-01-21 03:32:21,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 03:32:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2018-01-21 03:32:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 03:32:21,781 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:32:21,781 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:32:21,781 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_9Err0EnsuresViolation]=== [2018-01-21 03:32:21,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1951473777, now seen corresponding path program 1 times [2018-01-21 03:32:21,781 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:32:21,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:32:21,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:32:21,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:32:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:32:21,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:32:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:32:21,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:32:21,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:32:21,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:32:21,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:32:21,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:32:21,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:32:21,839 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 4 states. [2018-01-21 03:32:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:32:21,864 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-01-21 03:32:21,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:32:21,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 03:32:21,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:32:21,866 INFO L225 Difference]: With dead ends: 24 [2018-01-21 03:32:21,866 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:32:21,867 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:32:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:32:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:32:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:32:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:32:21,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 03:32:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:32:21,868 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:32:21,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:32:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:32:21,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:32:21,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:32:21 BoogieIcfgContainer [2018-01-21 03:32:21,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:32:21,873 INFO L168 Benchmark]: Toolchain (without parser) took 2464.42 ms. Allocated memory was 299.4 MB in the beginning and 454.0 MB in the end (delta: 154.7 MB). Free memory was 256.7 MB in the beginning and 302.6 MB in the end (delta: -45.9 MB). Peak memory consumption was 108.8 MB. Max. memory is 5.3 GB. [2018-01-21 03:32:21,874 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 299.4 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:32:21,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.79 ms. Allocated memory is still 299.4 MB. Free memory was 256.7 MB in the beginning and 243.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-01-21 03:32:21,875 INFO L168 Benchmark]: Boogie Preprocessor took 40.70 ms. Allocated memory is still 299.4 MB. Free memory was 243.5 MB in the beginning and 242.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-21 03:32:21,875 INFO L168 Benchmark]: RCFGBuilder took 243.50 ms. Allocated memory is still 299.4 MB. Free memory was 242.5 MB in the beginning and 227.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-01-21 03:32:21,876 INFO L168 Benchmark]: TraceAbstraction took 1923.59 ms. Allocated memory was 299.4 MB in the beginning and 454.0 MB in the end (delta: 154.7 MB). Free memory was 227.8 MB in the beginning and 302.6 MB in the end (delta: -74.7 MB). Peak memory consumption was 79.9 MB. Max. memory is 5.3 GB. [2018-01-21 03:32:21,878 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 299.4 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.79 ms. Allocated memory is still 299.4 MB. Free memory was 256.7 MB in the beginning and 243.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.70 ms. Allocated memory is still 299.4 MB. Free memory was 243.5 MB in the beginning and 242.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 243.50 ms. Allocated memory is still 299.4 MB. Free memory was 242.5 MB in the beginning and 227.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1923.59 ms. Allocated memory was 299.4 MB in the beginning and 454.0 MB in the end (delta: 154.7 MB). Free memory was 227.8 MB in the beginning and 302.6 MB in the end (delta: -74.7 MB). Peak memory consumption was 79.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s 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.1s 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)=3, \old(a9)=2, 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.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-32-21-890.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-32-21-890.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-32-21-890.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-32-21-890.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-32-21-890.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_03-32-21-890.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_03-32-21-890.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_03-32-21-890.csv Received shutdown request...