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_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:07:40,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:07:40,602 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:07:40,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:07:40,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:07:40,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:07:40,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:07:40,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:07:40,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:07:40,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:07:40,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:07:40,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:07:40,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:07:40,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:07:40,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:07:40,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:07:40,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:07:40,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:07:40,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:07:40,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:07:40,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:07:40,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:07:40,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:07:40,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:07:40,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:07:40,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:07:40,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:07:40,633 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:07:40,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:07:40,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:07:40,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:07:40,635 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:07:40,644 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:07:40,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:07:40,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:07:40,645 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:07:40,645 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:07:40,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:07:40,646 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:07:40,646 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:07:40,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:07:40,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:07:40,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:07:40,646 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:07:40,647 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:07:40,647 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:07:40,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:07:40,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:07:40,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:07:40,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:07:40,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:07:40,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:07:40,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:07:40,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:07:40,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:07:40,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:07:40,688 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:07:40,692 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:07:40,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:07:40,694 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:07:40,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i [2018-02-04 03:07:40,849 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:07:40,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:07:40,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:07:40,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:07:40,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:07:40,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:40,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228d72e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40, skipping insertion in model container [2018-02-04 03:07:40,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:40,867 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:07:40,901 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:07:40,981 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:07:40,993 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:07:40,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40 WrapperNode [2018-02-04 03:07:40,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:07:40,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:07:40,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:07:40,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:07:41,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:41,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:41,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:41,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:41,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:41,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:41,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (1/1) ... [2018-02-04 03:07:41,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:07:41,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:07:41,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:07:41,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:07:41,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (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:07:41,057 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:07:41,057 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:07:41,057 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:07:41,057 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 03:07:41,058 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 03:07:41,058 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-02-04 03:07:41,058 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-04 03:07:41,058 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:07:41,058 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:07:41,058 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:07:41,058 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:07:41,058 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:07:41,059 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:07:41,059 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:07:41,059 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:07:41,059 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:07:41,059 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:07:41,059 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:07:41,059 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 03:07:41,059 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 03:07:41,060 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-02-04 03:07:41,060 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-04 03:07:41,060 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:07:41,060 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:07:41,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:07:41,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:07:41,216 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:07:41,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:41 BoogieIcfgContainer [2018-02-04 03:07:41,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:07:41,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:07:41,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:07:41,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:07:41,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:07:40" (1/3) ... [2018-02-04 03:07:41,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5557b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:41, skipping insertion in model container [2018-02-04 03:07:41,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:40" (2/3) ... [2018-02-04 03:07:41,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5557b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:41, skipping insertion in model container [2018-02-04 03:07:41,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:41" (3/3) ... [2018-02-04 03:07:41,223 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-02-04 03:07:41,230 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:07:41,235 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 03:07:41,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:07:41,268 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:07:41,268 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:07:41,268 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:07:41,268 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:07:41,268 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:07:41,268 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:07:41,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:07:41,269 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:07:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-02-04 03:07:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 03:07:41,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:41,288 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 03:07:41,288 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash 3351521, now seen corresponding path program 1 times [2018-02-04 03:07:41,327 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:41,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:41,388 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:07:41,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:41,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:07:41,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:41,391 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:07:41,391 INFO L182 omatonBuilderFactory]: Interpolants [72#true, 73#false, 74#(= 1 (select |#valid| |~#a6.base|))] [2018-02-04 03:07:41,391 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:07:41,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:07:41,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:07:41,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:07:41,401 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2018-02-04 03:07:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:41,471 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-04 03:07:41,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:07:41,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 03:07:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:41,537 INFO L225 Difference]: With dead ends: 82 [2018-02-04 03:07:41,538 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 03:07:41,539 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:07:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 03:07:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-02-04 03:07:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:07:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 03:07:41,569 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 4 [2018-02-04 03:07:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:41,570 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 03:07:41,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:07:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 03:07:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 03:07:41,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:41,570 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 03:07:41,570 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash 3351522, now seen corresponding path program 1 times [2018-02-04 03:07:41,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:41,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:41,620 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:07:41,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:41,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:07:41,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:41,621 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:07:41,621 INFO L182 omatonBuilderFactory]: Interpolants [227#true, 228#false, 229#(and (= |~#a6.offset| 0) (= (select |#length| |~#a6.base|) 4))] [2018-02-04 03:07:41,621 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:07:41,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:07:41,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:07:41,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:07:41,623 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-02-04 03:07:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:41,671 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2018-02-04 03:07:41,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:07:41,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 03:07:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:41,673 INFO L225 Difference]: With dead ends: 122 [2018-02-04 03:07:41,673 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 03:07:41,674 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:07:41,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 03:07:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2018-02-04 03:07:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 03:07:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-02-04 03:07:41,684 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 4 [2018-02-04 03:07:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:41,684 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-02-04 03:07:41,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:07:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-02-04 03:07:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:07:41,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:41,685 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:07:41,685 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:41,685 INFO L82 PathProgramCache]: Analyzing trace with hash 312821243, now seen corresponding path program 1 times [2018-02-04 03:07:41,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:41,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:41,786 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:07:41,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:41,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:41,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:41,787 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:07:41,787 INFO L182 omatonBuilderFactory]: Interpolants [464#(= 1 (select |#valid| disconnect_6_~a.base)), 459#true, 460#false, 461#(= 1 (select |#valid| |~#a6.base|)), 462#(= |#valid| |old(#valid)|), 463#(= 1 (select |#valid| |disconnect_6_#in~a.base|))] [2018-02-04 03:07:41,787 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:07:41,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:41,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:41,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:41,788 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2018-02-04 03:07:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:41,943 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2018-02-04 03:07:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:07:41,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:07:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:41,945 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:07:41,945 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:07:41,945 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:07:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:07:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2018-02-04 03:07:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:07:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2018-02-04 03:07:41,956 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 24 [2018-02-04 03:07:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:41,957 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2018-02-04 03:07:41,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-02-04 03:07:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:07:41,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:41,958 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:07:41,958 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash 312821244, now seen corresponding path program 1 times [2018-02-04 03:07:41,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:41,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:42,025 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:07:42,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:42,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:07:42,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:42,026 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:07:42,026 INFO L182 omatonBuilderFactory]: Interpolants [713#true, 714#false, 715#(<= 3 probe3_6_~ret~0), 716#(<= 3 |probe3_6_#res|), 717#(<= 3 |entry_point_#t~ret9|), 718#(<= 3 entry_point_~ret~1)] [2018-02-04 03:07:42,026 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:07:42,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:42,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:42,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:42,027 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand 6 states. [2018-02-04 03:07:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:42,050 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2018-02-04 03:07:42,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:07:42,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:07:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:42,051 INFO L225 Difference]: With dead ends: 109 [2018-02-04 03:07:42,051 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 03:07:42,052 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:07:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 03:07:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-02-04 03:07:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 03:07:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2018-02-04 03:07:42,058 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 24 [2018-02-04 03:07:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:42,058 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2018-02-04 03:07:42,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2018-02-04 03:07:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:07:42,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:42,059 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:07:42,059 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:42,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1854259380, now seen corresponding path program 1 times [2018-02-04 03:07:42,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:42,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:42,102 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:07:42,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:42,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:42,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:42,103 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:07:42,103 INFO L182 omatonBuilderFactory]: Interpolants [932#true, 933#false, 934#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 935#(and (= 0 |probe3_6_#t~ret4.base|) (= 0 |probe3_6_#t~ret4.offset|)), 936#(and (= probe3_6_~p~0.offset 0) (= 0 probe3_6_~p~0.base))] [2018-02-04 03:07:42,103 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:07:42,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:07:42,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:07:42,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:07:42,104 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 5 states. [2018-02-04 03:07:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:42,116 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-02-04 03:07:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:07:42,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 03:07:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:42,117 INFO L225 Difference]: With dead ends: 73 [2018-02-04 03:07:42,117 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:07:42,118 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:07:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:07:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 03:07:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 03:07:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-02-04 03:07:42,122 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 24 [2018-02-04 03:07:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:42,122 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-02-04 03:07:42,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:07:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-02-04 03:07:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:07:42,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:42,123 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:07:42,123 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1628417000, now seen corresponding path program 1 times [2018-02-04 03:07:42,124 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:42,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:42,176 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:07:42,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:42,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:07:42,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:42,177 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:07:42,177 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 |probe3_6_#t~ret4.base|)), 1084#(not (= 0 probe3_6_~p~0.base))] [2018-02-04 03:07:42,177 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:07:42,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:42,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:42,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:42,178 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-02-04 03:07:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:42,199 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-02-04 03:07:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:07:42,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:07:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:42,199 INFO L225 Difference]: With dead ends: 64 [2018-02-04 03:07:42,199 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 03:07:42,200 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:07:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 03:07:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 03:07:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 03:07:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-02-04 03:07:42,202 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 24 [2018-02-04 03:07:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:42,202 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-02-04 03:07:42,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-02-04 03:07:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:07:42,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:42,203 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:07:42,203 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961130, now seen corresponding path program 1 times [2018-02-04 03:07:42,204 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:42,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:42,248 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:07:42,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:42,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:42,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:42,248 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:07:42,248 INFO L182 omatonBuilderFactory]: Interpolants [1216#false, 1217#(= 0 |ldv_malloc_#t~malloc1.offset|), 1218#(= 0 |ldv_malloc_#res.offset|), 1219#(= 0 |probe3_6_#t~ret4.offset|), 1220#(= probe3_6_~p~0.offset 0), 1215#true] [2018-02-04 03:07:42,248 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:07:42,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:42,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:42,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:42,249 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 6 states. [2018-02-04 03:07:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:42,265 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 03:07:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:07:42,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:07:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:42,265 INFO L225 Difference]: With dead ends: 62 [2018-02-04 03:07:42,266 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 03:07:42,266 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:07:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 03:07:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 03:07:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 03:07:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-02-04 03:07:42,268 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 26 [2018-02-04 03:07:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:42,268 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-02-04 03:07:42,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-02-04 03:07:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:07:42,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:42,268 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:07:42,268 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1212961129, now seen corresponding path program 1 times [2018-02-04 03:07:42,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:42,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:42,329 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:07:42,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:42,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:42,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:42,330 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:07:42,330 INFO L182 omatonBuilderFactory]: Interpolants [1347#true, 1348#false, 1349#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1350#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1351#(= 1 (select |#valid| |probe3_6_#t~ret4.base|)), 1352#(= 1 (select |#valid| probe3_6_~p~0.base))] [2018-02-04 03:07:42,330 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:07:42,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:42,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:42,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:42,331 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2018-02-04 03:07:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:42,397 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 03:07:42,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:07:42,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:07:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:42,398 INFO L225 Difference]: With dead ends: 60 [2018-02-04 03:07:42,398 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 03:07:42,398 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:07:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 03:07:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 03:07:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 03:07:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 03:07:42,401 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 26 [2018-02-04 03:07:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:42,401 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 03:07:42,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 03:07:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:07:42,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:42,402 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:07:42,402 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash -903148600, now seen corresponding path program 1 times [2018-02-04 03:07:42,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:42,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:42,504 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:07:42,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:42,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:42,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:42,505 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:07:42,505 INFO L182 omatonBuilderFactory]: Interpolants [1475#true, 1476#false, 1477#(= 1 (select |#valid| |~#a6.base|)), 1478#(= 1 (select |#valid| |probe3_6_#in~a.base|)), 1479#(= 1 (select |#valid| probe3_6_~a.base)), 1480#(= |#valid| |old(#valid)|), 1481#(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|)), 1482#(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:07:42,505 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:07:42,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:42,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:42,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:42,506 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 8 states. [2018-02-04 03:07:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:42,662 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-04 03:07:42,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:07:42,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 03:07:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:42,663 INFO L225 Difference]: With dead ends: 59 [2018-02-04 03:07:42,663 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 03:07:42,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:07:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 03:07:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 03:07:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 03:07:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 03:07:42,666 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 32 [2018-02-04 03:07:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:42,666 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 03:07:42,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 03:07:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:07:42,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:42,667 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:07:42,667 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash -903148599, now seen corresponding path program 1 times [2018-02-04 03:07:42,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:42,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:42,795 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:07:42,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:42,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:07:42,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:42,796 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:07:42,796 INFO L182 omatonBuilderFactory]: Interpolants [1616#(and (= 4 (select |#length| |probe3_6_#in~a.base|)) (= (select |#valid| |probe3_6_#in~a.base|) 1) (= 0 |probe3_6_#in~a.offset|)), 1617#(and (= (select |#valid| probe3_6_~a.base) 1) (= probe3_6_~a.offset 0) (= 4 (select |#length| probe3_6_~a.base))), 1618#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1619#(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|))), 1620#(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|))))), 1621#(and (= (select |#length| probe3_6_~a.base) 4) (= probe3_6_~a.offset 0)), 1612#true, 1613#false, 1614#(and (= 0 |~#a6.offset|) (= 4 (select |#length| |~#a6.base|))), 1615#(and (= 0 |~#a6.offset|) (= 4 (select |#length| |~#a6.base|)) (= (select |#valid| |~#a6.base|) 1))] [2018-02-04 03:07:42,796 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:07:42,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:07:42,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:07:42,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:07:42,797 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 10 states. [2018-02-04 03:07:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:43,126 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-04 03:07:43,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:07:43,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-04 03:07:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:43,127 INFO L225 Difference]: With dead ends: 57 [2018-02-04 03:07:43,127 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 03:07:43,128 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:07:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 03:07:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 03:07:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 03:07:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 03:07:43,130 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 32 [2018-02-04 03:07:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:43,130 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 03:07:43,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:07:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 03:07:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:07:43,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:43,131 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:07:43,131 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1666277088, now seen corresponding path program 1 times [2018-02-04 03:07:43,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:43,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:43,290 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:07:43,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:43,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:43,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:43,291 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:07:43,292 INFO L182 omatonBuilderFactory]: Interpolants [1760#(= |#valid| |old(#valid)|), 1761#(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|)), 1762#(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|))))), 1763#(and (= 0 (select |old(#valid)| |probe3_6_#t~ret4.base|)) (not (= 0 |probe3_6_#t~ret4.base|)) (or (= |#valid| |old(#valid)|) (= |probe3_6_#t~ret4.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1764#(and (not (= 0 probe3_6_~p~0.base)) (= 0 (select |old(#valid)| probe3_6_~p~0.base)) (or (= |#valid| |old(#valid)|) (= probe3_6_~p~0.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1757#true, 1758#false, 1759#(= 1 (select |#valid| |~#a6.base|))] [2018-02-04 03:07:43,292 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:07:43,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:43,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:43,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:43,299 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-02-04 03:07:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:43,577 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-02-04 03:07:43,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:07:43,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 03:07:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:43,579 INFO L225 Difference]: With dead ends: 61 [2018-02-04 03:07:43,579 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 03:07:43,579 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:07:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 03:07:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 03:07:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 03:07:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-04 03:07:43,582 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-02-04 03:07:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:43,583 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-04 03:07:43,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-04 03:07:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:07:43,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:43,583 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:07:43,584 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash 730447574, now seen corresponding path program 1 times [2018-02-04 03:07:43,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:43,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:43,633 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:07:43,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:43,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:07:43,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:43,634 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:07:43,634 INFO L182 omatonBuilderFactory]: Interpolants [1896#true, 1897#false, 1898#(<= (+ probe3_6_~ret~0 1) 0), 1899#(<= (+ |probe3_6_#res| 1) 0), 1900#(<= (+ |entry_point_#t~ret9| 1) 0), 1901#(<= (+ entry_point_~ret~1 1) 0)] [2018-02-04 03:07:43,634 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:07:43,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:43,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:43,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:43,635 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 6 states. [2018-02-04 03:07:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:43,651 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-02-04 03:07:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:07:43,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 03:07:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:43,652 INFO L225 Difference]: With dead ends: 61 [2018-02-04 03:07:43,652 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 03:07:43,652 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:07:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 03:07:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 03:07:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 03:07:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 54 transitions. [2018-02-04 03:07:43,654 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 54 transitions. Word has length 34 [2018-02-04 03:07:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:43,655 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 54 transitions. [2018-02-04 03:07:43,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 54 transitions. [2018-02-04 03:07:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:07:43,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:43,656 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, 1, 1] [2018-02-04 03:07:43,656 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash -294666985, now seen corresponding path program 1 times [2018-02-04 03:07:43,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:43,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:43,807 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:07:43,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:43,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 03:07:43,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:43,808 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:07:43,808 INFO L182 omatonBuilderFactory]: Interpolants [2020#true, 2021#false, 2022#(= 1 (select |#valid| |~#a6.base|)), 2023#(= |#valid| |old(#valid)|), 2024#(and (= |#valid| |old(#valid)|) (= probe3_6_~a.base |probe3_6_#in~a.base|)), 2025#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 2026#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 2027#(and (= 0 (select |old(#valid)| |probe3_6_#t~ret4.base|)) (= probe3_6_~a.base |probe3_6_#in~a.base|) (not (= 0 |probe3_6_#t~ret4.base|))), 2028#(and (not (= 0 probe3_6_~p~0.base)) (or (= 0 (select |old(#valid)| |probe3_6_#in~a.base|)) (not (= probe3_6_~a.base probe3_6_~p~0.base))) (= probe3_6_~a.base |probe3_6_#in~a.base|)), 2029#(and (not (= 0 probe3_6_~p~0.base)) (or (= 1 (select (store |#valid| probe3_6_~p~0.base 0) |probe3_6_#in~a.base|)) (and (= 0 (select |old(#valid)| |probe3_6_#in~a.base|)) (= probe3_6_~p~0.base |probe3_6_#in~a.base|)))), 2030#(or (= 1 (select |#valid| |probe3_6_#in~a.base|)) (= (select |#valid| |probe3_6_#in~a.base|) (select |old(#valid)| |probe3_6_#in~a.base|))), 2031#(= 1 (select |#valid| |disconnect_6_#in~a.base|)), 2032#(= 1 (select |#valid| disconnect_6_~a.base))] [2018-02-04 03:07:43,808 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:07:43,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:07:43,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:07:43,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:07:43,808 INFO L87 Difference]: Start difference. First operand 55 states and 54 transitions. Second operand 13 states. [2018-02-04 03:07:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:44,039 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2018-02-04 03:07:44,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:07:44,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-02-04 03:07:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:44,040 INFO L225 Difference]: With dead ends: 54 [2018-02-04 03:07:44,040 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 03:07:44,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:07:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 03:07:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 03:07:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 03:07:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 53 transitions. [2018-02-04 03:07:44,042 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 53 transitions. Word has length 41 [2018-02-04 03:07:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:44,042 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 53 transitions. [2018-02-04 03:07:44,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:07:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2018-02-04 03:07:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:07:44,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:44,043 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, 1, 1] [2018-02-04 03:07:44,043 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash -294666984, now seen corresponding path program 1 times [2018-02-04 03:07:44,044 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:44,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:44,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:44,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:44,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:44,132 INFO L182 omatonBuilderFactory]: Interpolants [2162#true, 2163#false, 2164#(= 0 |~#a6.offset|), 2165#(and (= probe3_6_~a.base |probe3_6_#in~a.base|) (or (= probe3_6_~a.offset |probe3_6_#in~a.offset|) (= probe3_6_~a.offset 0))), 2166#(or (<= 4 (select |#length| |probe3_6_#in~a.base|)) (not (= 0 |probe3_6_#in~a.offset|))), 2167#(and (= 0 |~#a6.offset|) (<= 4 (select |#length| |~#a6.base|))), 2168#(and (= 0 |disconnect_6_#in~a.offset|) (<= 4 (select |#length| |disconnect_6_#in~a.base|))), 2169#(and (<= 4 (select |#length| disconnect_6_~a.base)) (= disconnect_6_~a.offset 0))] [2018-02-04 03:07:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:44,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:44,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:44,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:44,133 INFO L87 Difference]: Start difference. First operand 54 states and 53 transitions. Second operand 8 states. [2018-02-04 03:07:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:44,217 INFO L93 Difference]: Finished difference Result 53 states and 52 transitions. [2018-02-04 03:07:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:07:44,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-02-04 03:07:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:44,218 INFO L225 Difference]: With dead ends: 53 [2018-02-04 03:07:44,218 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 03:07:44,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:07:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 03:07:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 03:07:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 03:07:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 52 transitions. [2018-02-04 03:07:44,220 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 52 transitions. Word has length 41 [2018-02-04 03:07:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:44,220 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 52 transitions. [2018-02-04 03:07:44,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 52 transitions. [2018-02-04 03:07:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:07:44,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:44,221 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, 1, 1, 1] [2018-02-04 03:07:44,221 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash -544741945, now seen corresponding path program 1 times [2018-02-04 03:07:44,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:44,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:44,324 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:07:44,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:44,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:07:44,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:44,325 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:07:44,326 INFO L182 omatonBuilderFactory]: Interpolants [2288#true, 2289#false, 2290#(and (= probe3_6_~a.offset |probe3_6_#in~a.offset|) (= probe3_6_~a.base |probe3_6_#in~a.base|)), 2291#(= 0 |ldv_malloc_#t~malloc1.offset|), 2292#(= 0 |ldv_malloc_#res.offset|), 2293#(and (= probe3_6_~a.offset |probe3_6_#in~a.offset|) (= probe3_6_~a.base |probe3_6_#in~a.base|) (= 0 |probe3_6_#t~ret4.offset|)), 2294#(and (= probe3_6_~a.offset |probe3_6_#in~a.offset|) (= probe3_6_~a.base |probe3_6_#in~a.base|) (= 0 probe3_6_~p~0.offset)), 2295#(= 0 (select (select |#memory_$Pointer$.offset| |probe3_6_#in~a.base|) |probe3_6_#in~a.offset|)), 2296#(= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)), 2297#(= 0 (select (select |#memory_$Pointer$.offset| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)), 2298#(= 0 (select (select |#memory_$Pointer$.offset| disconnect_6_~a.base) disconnect_6_~a.offset)), 2299#(= |disconnect_6_#t~mem8.offset| 0)] [2018-02-04 03:07:44,326 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:07:44,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:07:44,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:07:44,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:07:44,327 INFO L87 Difference]: Start difference. First operand 53 states and 52 transitions. Second operand 12 states. [2018-02-04 03:07:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:44,475 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2018-02-04 03:07:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:07:44,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 03:07:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:44,475 INFO L225 Difference]: With dead ends: 52 [2018-02-04 03:07:44,475 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 03:07:44,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:07:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 03:07:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 03:07:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 03:07:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2018-02-04 03:07:44,477 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 42 [2018-02-04 03:07:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:44,477 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2018-02-04 03:07:44,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:07:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2018-02-04 03:07:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:07:44,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:44,477 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, 1, 1, 1] [2018-02-04 03:07:44,477 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe3_6Err4RequiresViolation, probe3_6Err2RequiresViolation, probe3_6Err3RequiresViolation, probe3_6Err5RequiresViolation, probe3_6Err0RequiresViolation, probe3_6Err1RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 03:07:44,478 INFO L82 PathProgramCache]: Analyzing trace with hash -544741944, now seen corresponding path program 1 times [2018-02-04 03:07:44,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:07:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:07:44,512 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:07:44,527 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 03:07:44,528 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 03:07:44,529 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 03:07:44,529 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 03:07:44,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:07:44 BoogieIcfgContainer [2018-02-04 03:07:44,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:07:44,541 INFO L168 Benchmark]: Toolchain (without parser) took 3691.71 ms. Allocated memory was 398.5 MB in the beginning and 676.9 MB in the end (delta: 278.4 MB). Free memory was 355.1 MB in the beginning and 632.1 MB in the end (delta: -277.0 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-04 03:07:44,542 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:07:44,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.88 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 341.9 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:07:44,542 INFO L168 Benchmark]: Boogie Preprocessor took 22.79 ms. Allocated memory is still 398.5 MB. Free memory was 341.9 MB in the beginning and 340.6 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:07:44,543 INFO L168 Benchmark]: RCFGBuilder took 194.81 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 318.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:07:44,543 INFO L168 Benchmark]: TraceAbstraction took 3322.71 ms. Allocated memory was 398.5 MB in the beginning and 676.9 MB in the end (delta: 278.4 MB). Free memory was 318.1 MB in the beginning and 632.1 MB in the end (delta: -314.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:07:44,544 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.17 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.88 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 341.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.79 ms. Allocated memory is still 398.5 MB. Free memory was 341.9 MB in the beginning and 340.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 194.81 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 318.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3322.71 ms. Allocated memory was 398.5 MB in the beginning and 676.9 MB in the end (delta: 278.4 MB). Free memory was 318.1 MB in the beginning and 632.1 MB in the end (delta: -314.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * 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 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$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1468] FCALL struct A a6; VAL [a6={9:0}] [L1480] CALL entry_point() VAL [a6={9:0}] [L1472] CALL, EXPR probe3_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()=0, p={7:0}, ret=0] [L1451] ret = g6() [L1452] COND FALSE !(ret<0) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1454] FCALL a->p = p VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1455] FCALL free(p) VAL [a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1456] RET return 0; VAL [\result=0, a={9:0}, a={9:0}, a6={9:0}, p={7:0}, ret=0] [L1472] EXPR probe3_6(&a6) VAL [a6={9:0}, probe3_6(&a6)=0] [L1472] int ret = probe3_6(&a6); [L1473] COND TRUE ret==0 VAL [a6={9:0}, ret=0] [L1474] CALL disconnect_6(&a6) VAL [a={9:0}, a6={9:0}] [L1464] EXPR, FCALL a->p VAL [a={9:0}, a={9:0}, a->p={7:0}, a6={9:0}] [L1464] FCALL free(a->p) VAL [a={9:0}, a={9:0}, a->p={7:0}, a6={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 69 locations, 15 error locations. UNSAFE Result, 3.2s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 751 SDtfs, 701 SDslu, 2178 SDs, 0 SdLazy, 1411 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=3, 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, 15 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 63513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-07-44-549.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-07-44-549.csv Received shutdown request...