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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:15:20,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:15:20,731 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:15:20,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:15:20,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:15:20,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:15:20,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:15:20,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:15:20,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:15:20,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:15:20,747 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:15:20,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:15:20,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:15:20,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:15:20,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:15:20,752 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:15:20,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:15:20,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:15:20,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:15:20,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:15:20,759 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:15:20,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:15:20,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:15:20,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:15:20,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:15:20,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:15:20,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:15:20,762 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:15:20,762 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:15:20,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:15:20,763 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:15:20,763 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:15:20,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:15:20,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:15:20,773 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:15:20,773 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:15:20,773 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:15:20,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:15:20,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:15:20,774 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:15:20,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:15:20,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:15:20,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:15:20,774 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:15:20,775 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:15:20,775 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:15:20,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:15:20,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:15:20,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:15:20,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:15:20,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:15:20,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:15:20,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:15:20,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:15:20,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:15:20,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:15:20,811 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:15:20,814 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:15:20,815 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:15:20,815 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:15:20,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-04 03:15:20,946 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:15:20,946 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:15:20,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:15:20,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:15:20,952 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:15:20,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:15:20" (1/1) ... [2018-02-04 03:15:20,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc89e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:20, skipping insertion in model container [2018-02-04 03:15:20,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:15:20" (1/1) ... [2018-02-04 03:15:20,969 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:15:21,005 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:15:21,096 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:15:21,108 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:15:21,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21 WrapperNode [2018-02-04 03:15:21,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:15:21,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:15:21,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:15:21,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:15:21,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (1/1) ... [2018-02-04 03:15:21,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (1/1) ... [2018-02-04 03:15:21,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (1/1) ... [2018-02-04 03:15:21,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (1/1) ... [2018-02-04 03:15:21,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (1/1) ... [2018-02-04 03:15:21,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (1/1) ... [2018-02-04 03:15:21,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (1/1) ... [2018-02-04 03:15:21,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:15:21,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:15:21,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:15:21,148 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:15:21,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 03:15:21,182 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:15:21,182 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:15:21,182 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:15:21,183 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 03:15:21,183 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 03:15:21,183 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-02-04 03:15:21,183 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 03:15:21,183 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:15:21,183 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:15:21,183 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:15:21,183 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:15:21,183 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:15:21,183 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:15:21,183 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:15:21,183 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:15:21,184 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:15:21,348 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:15:21,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:15:21 BoogieIcfgContainer [2018-02-04 03:15:21,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:15:21,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:15:21,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:15:21,352 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:15:21,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:15:20" (1/3) ... [2018-02-04 03:15:21,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533eea96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:15:21, skipping insertion in model container [2018-02-04 03:15:21,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:21" (2/3) ... [2018-02-04 03:15:21,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533eea96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:15:21, skipping insertion in model container [2018-02-04 03:15:21,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:15:21" (3/3) ... [2018-02-04 03:15:21,354 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-04 03:15:21,360 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:15:21,366 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 03:15:21,399 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:15:21,399 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:15:21,400 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:15:21,400 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:15:21,400 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:15:21,400 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:15:21,400 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:15:21,400 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:15:21,401 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:15:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-04 03:15:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 03:15:21,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:21,422 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 03:15:21,422 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash 3232357, now seen corresponding path program 1 times [2018-02-04 03:15:21,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:21,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:21,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:21,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:15:21,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:21,569 INFO L182 omatonBuilderFactory]: Interpolants [69#true, 70#false, 71#(= 1 (select |#valid| |~#a6.base|))] [2018-02-04 03:15:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:21,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:15:21,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:15:21,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:15:21,584 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-04 03:15:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:21,706 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 03:15:21,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:15:21,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 03:15:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:21,762 INFO L225 Difference]: With dead ends: 79 [2018-02-04 03:15:21,762 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 03:15:21,763 INFO L554 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-02-04 03:15:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 03:15:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-04 03:15:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 03:15:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 03:15:21,793 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-04 03:15:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:21,794 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 03:15:21,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:15:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 03:15:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 03:15:21,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:21,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 03:15:21,794 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:21,795 INFO L82 PathProgramCache]: Analyzing trace with hash 3232358, now seen corresponding path program 1 times [2018-02-04 03:15:21,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:21,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:21,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:21,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:15:21,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:21,866 INFO L182 omatonBuilderFactory]: Interpolants [218#true, 219#false, 220#(and (= |~#a6.offset| 0) (= (select |#length| |~#a6.base|) 4))] [2018-02-04 03:15:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:21,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:15:21,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:15:21,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:15:21,868 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-02-04 03:15:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:21,920 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-04 03:15:21,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:15:21,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 03:15:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:21,922 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:15:21,922 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:15:21,922 INFO L554 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-02-04 03:15:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:15:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-04 03:15:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 03:15:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-04 03:15:21,931 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-04 03:15:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:21,931 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-04 03:15:21,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:15:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-04 03:15:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:15:21,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:21,932 INFO L351 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-02-04 03:15:21,932 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash -293037669, now seen corresponding path program 1 times [2018-02-04 03:15:21,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:21,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:22,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:22,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,012 INFO L182 omatonBuilderFactory]: Interpolants [440#true, 441#false, 442#(= 1 (select |#valid| |~#a6.base|)), 443#(= |#valid| |old(#valid)|), 444#(= 1 (select |#valid| |disconnect_6_#in~a.base|)), 445#(= 1 (select |#valid| disconnect_6_~a.base))] [2018-02-04 03:15:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:22,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:22,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:22,013 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-02-04 03:15:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:22,186 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-02-04 03:15:22,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:15:22,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:15:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:22,188 INFO L225 Difference]: With dead ends: 122 [2018-02-04 03:15:22,188 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 03:15:22,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:15:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 03:15:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-02-04 03:15:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:15:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-04 03:15:22,199 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-02-04 03:15:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:22,199 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-04 03:15:22,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-04 03:15:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:15:22,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:22,201 INFO L351 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-02-04 03:15:22,201 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash -293037668, now seen corresponding path program 1 times [2018-02-04 03:15:22,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:22,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:22,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:15:22,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,263 INFO L182 omatonBuilderFactory]: Interpolants [688#(<= 3 |entry_point_#t~ret9|), 689#(<= 3 entry_point_~ret~1), 684#true, 685#false, 686#(<= 3 probe2_6_~ret~0), 687#(<= 3 |probe2_6_#res|)] [2018-02-04 03:15:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:22,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:22,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:22,264 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-02-04 03:15:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:22,284 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2018-02-04 03:15:22,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:15:22,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:15:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:22,285 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:15:22,285 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:15:22,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:15:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:15:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 03:15:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:15:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-04 03:15:22,291 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-02-04 03:15:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:22,291 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-04 03:15:22,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-04 03:15:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:15:22,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:22,292 INFO L351 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-02-04 03:15:22,292 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:22,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2126392044, now seen corresponding path program 1 times [2018-02-04 03:15:22,294 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:22,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:22,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:22,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,354 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= 0 probe2_6_~p~0.offset) (= 0 probe2_6_~p~0.base)), 924#true, 925#false, 926#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 927#(and (= 0 |probe2_6_#t~ret4.offset|) (= 0 |probe2_6_#t~ret4.base|))] [2018-02-04 03:15:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:15:22,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:15:22,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:15:22,355 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-02-04 03:15:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:22,364 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 03:15:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:15:22,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 03:15:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:22,365 INFO L225 Difference]: With dead ends: 77 [2018-02-04 03:15:22,365 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 03:15:22,365 INFO L554 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-02-04 03:15:22,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 03:15:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 03:15:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 03:15:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-04 03:15:22,368 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-02-04 03:15:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:22,369 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-04 03:15:22,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:15:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-04 03:15:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:15:22,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:22,369 INFO L351 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-02-04 03:15:22,369 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:22,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1815899569, now seen corresponding path program 1 times [2018-02-04 03:15:22,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:22,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:22,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:15:22,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,429 INFO L182 omatonBuilderFactory]: Interpolants [1079#true, 1080#false, 1081#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1082#(not (= 0 |ldv_malloc_#res.base|)), 1083#(not (= 0 |probe2_6_#t~ret4.base|)), 1084#(not (= 0 probe2_6_~p~0.base))] [2018-02-04 03:15:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:22,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:22,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:22,430 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-02-04 03:15:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:22,448 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-04 03:15:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:15:22,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:15:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:22,449 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:15:22,449 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:15:22,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:15:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:15:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 03:15:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 03:15:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 03:15:22,452 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-02-04 03:15:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:22,452 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 03:15:22,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 03:15:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:15:22,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:22,453 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:22,453 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash -510641866, now seen corresponding path program 1 times [2018-02-04 03:15:22,453 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:22,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:22,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:22,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,488 INFO L182 omatonBuilderFactory]: Interpolants [1225#true, 1226#false, 1227#(= 0 |ldv_malloc_#t~malloc1.offset|), 1228#(= 0 |ldv_malloc_#res.offset|), 1229#(= 0 |probe2_6_#t~ret4.offset|), 1230#(= 0 probe2_6_~p~0.offset)] [2018-02-04 03:15:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:22,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:22,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:22,489 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-04 03:15:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:22,507 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 03:15:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:15:22,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:15:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:22,509 INFO L225 Difference]: With dead ends: 68 [2018-02-04 03:15:22,509 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 03:15:22,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:15:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 03:15:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 03:15:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:15:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-04 03:15:22,513 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-02-04 03:15:22,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:22,513 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-04 03:15:22,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-04 03:15:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:15:22,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:22,514 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:22,514 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:22,514 INFO L82 PathProgramCache]: Analyzing trace with hash -510641865, now seen corresponding path program 1 times [2018-02-04 03:15:22,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:22,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:22,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:22,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,561 INFO L182 omatonBuilderFactory]: Interpolants [1369#true, 1370#false, 1371#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1372#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1373#(= 1 (select |#valid| |probe2_6_#t~ret4.base|)), 1374#(= 1 (select |#valid| probe2_6_~p~0.base))] [2018-02-04 03:15:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:22,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:22,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:22,562 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-02-04 03:15:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:22,614 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-04 03:15:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:15:22,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:15:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:22,618 INFO L225 Difference]: With dead ends: 67 [2018-02-04 03:15:22,618 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 03:15:22,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:15:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 03:15:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 03:15:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 03:15:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 03:15:22,621 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-02-04 03:15:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:22,621 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 03:15:22,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 03:15:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:15:22,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:22,622 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:22,622 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:22,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419564, now seen corresponding path program 1 times [2018-02-04 03:15:22,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:22,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:22,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:15:22,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,721 INFO L182 omatonBuilderFactory]: Interpolants [1511#true, 1512#false, 1513#(= 1 (select |#valid| |~#a6.base|)), 1514#(= 1 (select |#valid| |probe2_6_#in~a.base|)), 1515#(= 1 (select |#valid| probe2_6_~a.base)), 1516#(= |#valid| |old(#valid)|), 1517#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 1518#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-04 03:15:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:22,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:15:22,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:15:22,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:15:22,722 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-02-04 03:15:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:22,967 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-04 03:15:22,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:15:22,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 03:15:22,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:22,969 INFO L225 Difference]: With dead ends: 75 [2018-02-04 03:15:22,969 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 03:15:22,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:15:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 03:15:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-04 03:15:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 03:15:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 03:15:22,972 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-04 03:15:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:22,973 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 03:15:22,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:15:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 03:15:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:15:22,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:22,973 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:22,974 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419565, now seen corresponding path program 1 times [2018-02-04 03:15:22,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:22,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:23,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:15:23,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,092 INFO L182 omatonBuilderFactory]: Interpolants [1680#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 1681#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 1682#(and (= probe2_6_~a.offset 0) (= (select |#length| probe2_6_~a.base) 4)), 1673#true, 1674#false, 1675#(and (= 0 |~#a6.offset|) (= 4 (select |#length| |~#a6.base|))), 1676#(and (= 0 |~#a6.offset|) (= 4 (select |#length| |~#a6.base|)) (= (select |#valid| |~#a6.base|) 1)), 1677#(and (= 0 |probe2_6_#in~a.offset|) (= 4 (select |#length| |probe2_6_#in~a.base|)) (= (select |#valid| |probe2_6_#in~a.base|) 1)), 1678#(and (= (select |#valid| probe2_6_~a.base) 1) (= 4 (select |#length| probe2_6_~a.base)) (= probe2_6_~a.offset 0)), 1679#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|))] [2018-02-04 03:15:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:15:23,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:15:23,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:15:23,092 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 10 states. [2018-02-04 03:15:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:23,432 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-02-04 03:15:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:15:23,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-04 03:15:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:23,433 INFO L225 Difference]: With dead ends: 70 [2018-02-04 03:15:23,433 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:15:23,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:15:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:15:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-02-04 03:15:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 03:15:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-04 03:15:23,436 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-02-04 03:15:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:23,436 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-04 03:15:23,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:15:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-04 03:15:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:15:23,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:23,437 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:23,437 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash 758520105, now seen corresponding path program 1 times [2018-02-04 03:15:23,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:23,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:23,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:15:23,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,611 INFO L182 omatonBuilderFactory]: Interpolants [1840#(= 1 (select |#valid| |~#a6.base|)), 1841#(= |#valid| |old(#valid)|), 1842#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 1843#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1844#(and (or (= |#valid| |old(#valid)|) (= |probe2_6_#t~ret4.base| (@diff |old(#valid)| |#valid|))) (not (= 0 |probe2_6_#t~ret4.base|)) (= 0 (select |old(#valid)| |probe2_6_#t~ret4.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1845#(and (= 0 (select |old(#valid)| probe2_6_~p~0.base)) (not (= 0 probe2_6_~p~0.base)) (or (= probe2_6_~p~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1838#true, 1839#false] [2018-02-04 03:15:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:15:23,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:15:23,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:15:23,612 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-02-04 03:15:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:23,891 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-04 03:15:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:15:23,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 03:15:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:23,892 INFO L225 Difference]: With dead ends: 68 [2018-02-04 03:15:23,893 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 03:15:23,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:15:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 03:15:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 03:15:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 03:15:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 03:15:23,895 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 32 [2018-02-04 03:15:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:23,895 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 03:15:23,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:15:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 03:15:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:15:23,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:23,896 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:23,901 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:23,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1206669578, now seen corresponding path program 1 times [2018-02-04 03:15:23,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:23,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:23,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:15:23,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,933 INFO L182 omatonBuilderFactory]: Interpolants [1991#true, 1992#false, 1993#(<= (+ probe2_6_~ret~0 1) 0), 1994#(<= (+ |probe2_6_#res| 1) 0), 1995#(<= (+ |entry_point_#t~ret9| 1) 0), 1996#(<= (+ entry_point_~ret~1 1) 0)] [2018-02-04 03:15:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:23,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:23,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:23,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:23,934 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-04 03:15:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:23,957 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-04 03:15:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:15:23,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 03:15:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:23,963 INFO L225 Difference]: With dead ends: 67 [2018-02-04 03:15:23,964 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 03:15:23,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:15:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 03:15:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-02-04 03:15:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 03:15:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-02-04 03:15:23,966 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 34 [2018-02-04 03:15:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:23,967 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-02-04 03:15:23,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-02-04 03:15:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:15:23,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:23,968 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:23,968 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-04 03:15:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227651, now seen corresponding path program 1 times [2018-02-04 03:15:23,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:15:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:15:24,010 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:15:24,021 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 03:15:24,028 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 03:15:24,028 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 03:15:24,029 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 03:15:24,029 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 03:15:24,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:15:24 BoogieIcfgContainer [2018-02-04 03:15:24,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:15:24,039 INFO L168 Benchmark]: Toolchain (without parser) took 3093.22 ms. Allocated memory was 399.5 MB in the beginning and 669.0 MB in the end (delta: 269.5 MB). Free memory was 356.3 MB in the beginning and 580.9 MB in the end (delta: -224.5 MB). Peak memory consumption was 44.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:24,040 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:15:24,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.84 ms. Allocated memory is still 399.5 MB. Free memory was 356.3 MB in the beginning and 343.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:24,040 INFO L168 Benchmark]: Boogie Preprocessor took 33.36 ms. Allocated memory is still 399.5 MB. Free memory was 343.1 MB in the beginning and 341.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:24,041 INFO L168 Benchmark]: RCFGBuilder took 201.12 ms. Allocated memory is still 399.5 MB. Free memory was 341.8 MB in the beginning and 319.8 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:24,041 INFO L168 Benchmark]: TraceAbstraction took 2689.29 ms. Allocated memory was 399.5 MB in the beginning and 669.0 MB in the end (delta: 269.5 MB). Free memory was 319.8 MB in the beginning and 580.9 MB in the end (delta: -261.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:24,042 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.14 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.84 ms. Allocated memory is still 399.5 MB. Free memory was 356.3 MB in the beginning and 343.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.36 ms. Allocated memory is still 399.5 MB. Free memory was 343.1 MB in the beginning and 341.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 201.12 ms. Allocated memory is still 399.5 MB. Free memory was 341.8 MB in the beginning and 319.8 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2689.29 ms. Allocated memory was 399.5 MB in the beginning and 669.0 MB in the end (delta: 269.5 MB). Free memory was 319.8 MB in the beginning and 580.9 MB in the end (delta: -261.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1478]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1478. Possible FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1467] FCALL struct A a6; VAL [a6={9:0}] [L1479] CALL entry_point() VAL [a6={9:0}] [L1471] CALL, EXPR probe2_6(&a6) VAL [a={9:0}, a6={9:0}] [L1444] int ret = - -3; VAL [a={9:0}, a={9:0}, a6={9:0}, ret=3] [L1445] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={9:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={9:0}, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={7:0}, a6={9:0}, malloc(size)={7:0}, size=4] [L1445] EXPR ldv_malloc(sizeof(int)) VAL [a={9:0}, a={9:0}, a6={9:0}, ldv_malloc(sizeof(int))={7:0}, ret=3] [L1445] int *p = (int *)ldv_malloc(sizeof(int)); [L1446] COND FALSE !(p==0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=3] [L1448] CALL, EXPR f6() VAL [a6={9:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1448] EXPR f6() VAL [a={9:0}, a={9:0}, a6={9:0}, f6()=0, p={7:0}, ret=3] [L1448] ret = f6() [L1449] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1451] CALL, EXPR g6() VAL [a6={9:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1451] EXPR g6() VAL [a={9:0}, a={9:0}, a6={9:0}, g6()=-1, p={7:0}, ret=0] [L1451] ret = g6() [L1452] COND TRUE ret<0 [L1453] RET return ret; VAL [\result=-1, a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=-1] [L1471] EXPR probe2_6(&a6) VAL [a6={9:0}, probe2_6(&a6)=-1] [L1471] int ret = probe2_6(&a6); [L1472] COND FALSE !(ret==0) VAL [a6={9:0}, ret=-1] [L1475] RET, FCALL a6.p = 0 VAL [a6={9:0}, ret=-1] [L1479] entry_point() VAL [a6={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. UNSAFE Result, 2.6s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 650 SDtfs, 550 SDslu, 1695 SDs, 0 SdLazy, 929 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 33523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-15-24-047.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-15-24-047.csv Received shutdown request...