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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:24:30,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:24:30,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:24:30,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:24:30,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:24:30,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:24:30,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:24:30,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:24:30,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:24:30,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:24:30,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:24:30,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:24:30,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:24:30,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:24:30,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:24:30,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:24:30,834 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:24:30,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:24:30,837 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:24:30,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:24:30,839 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:24:30,839 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:24:30,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:24:30,840 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:24:30,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:24:30,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:24:30,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:24:30,843 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:24:30,843 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:24:30,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:24:30,843 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:24:30,844 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:24:30,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:24:30,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:24:30,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:24:30,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:24:30,855 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:24:30,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:24:30,855 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:24:30,855 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:24:30,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:24:30,856 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:24:30,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:24:30,856 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:24:30,856 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:24:30,856 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:24:30,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:24:30,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:24:30,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:24:30,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:24:30,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:24:30,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:24:30,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:24:30,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:24:30,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:24:30,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:24:30,895 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:24:30,898 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:24:30,899 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:24:30,900 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:24:30,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-02-02 10:24:31,057 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:24:31,058 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:24:31,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:24:31,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:24:31,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:24:31,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31, skipping insertion in model container [2018-02-02 10:24:31,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,077 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:24:31,111 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:24:31,195 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:24:31,207 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:24:31,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31 WrapperNode [2018-02-02 10:24:31,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:24:31,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:24:31,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:24:31,212 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:24:31,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (1/1) ... [2018-02-02 10:24:31,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:24:31,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:24:31,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:24:31,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:24:31,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (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-02 10:24:31,269 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:24:31,269 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:24:31,269 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:24:31,269 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-02 10:24:31,269 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-02 10:24:31,269 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-02 10:24:31,269 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-02 10:24:31,270 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:24:31,270 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-02 10:24:31,270 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-02 10:24:31,271 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-02 10:24:31,271 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-02 10:24:31,271 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:24:31,271 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:24:31,271 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:24:31,271 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:24:31,405 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:24:31,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:24:31 BoogieIcfgContainer [2018-02-02 10:24:31,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:24:31,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:24:31,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:24:31,408 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:24:31,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:24:31" (1/3) ... [2018-02-02 10:24:31,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58adc6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:24:31, skipping insertion in model container [2018-02-02 10:24:31,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:31" (2/3) ... [2018-02-02 10:24:31,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58adc6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:24:31, skipping insertion in model container [2018-02-02 10:24:31,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:24:31" (3/3) ... [2018-02-02 10:24:31,410 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-02-02 10:24:31,415 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:24:31,420 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 10:24:31,453 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:24:31,453 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:24:31,453 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:24:31,453 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:24:31,453 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:24:31,453 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:24:31,453 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:24:31,454 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:24:31,454 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:24:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-02 10:24:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:24:31,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:31,475 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] [2018-02-02 10:24:31,475 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash -554404132, now seen corresponding path program 1 times [2018-02-02 10:24:31,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:31,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:31,728 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-02 10:24:31,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:31,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:31,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:31,732 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-02 10:24:31,732 INFO L182 omatonBuilderFactory]: Interpolants [65#true, 66#false, 67#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 68#(and (= 0 |probe1_6_#t~ret4.base|) (= 0 |probe1_6_#t~ret4.offset|)), 69#(and (= probe1_6_~p~0.base 0) (= 0 probe1_6_~p~0.offset))] [2018-02-02 10:24:31,732 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-02 10:24:31,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:24:31,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:24:31,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:24:31,744 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-02-02 10:24:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:31,840 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-02 10:24:31,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:24:31,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:24:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:31,851 INFO L225 Difference]: With dead ends: 68 [2018-02-02 10:24:31,851 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:24:31,852 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-02 10:24:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:24:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-02-02 10:24:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:24:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-02 10:24:31,879 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 23 [2018-02-02 10:24:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:31,879 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-02 10:24:31,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:24:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-02 10:24:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:24:31,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:31,880 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] [2018-02-02 10:24:31,880 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293187, now seen corresponding path program 1 times [2018-02-02 10:24:31,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:31,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:31,952 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-02 10:24:31,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:31,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:31,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:31,952 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-02 10:24:31,952 INFO L182 omatonBuilderFactory]: Interpolants [201#true, 202#false, 203#(= 1 (select |#valid| |entry_point_~#a7~0.base|)), 204#(= |#valid| |old(#valid)|), 205#(= 1 (select |#valid| |disconnect_6_#in~a.base|)), 206#(= 1 (select |#valid| disconnect_6_~a.base))] [2018-02-02 10:24:31,953 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-02 10:24:31,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:31,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:31,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:31,954 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-02-02 10:24:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:32,069 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 10:24:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:24:32,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 10:24:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:32,071 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:24:32,071 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 10:24:32,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:24:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 10:24:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-02-02 10:24:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 10:24:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-02 10:24:32,077 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 23 [2018-02-02 10:24:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:32,078 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-02 10:24:32,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-02 10:24:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:24:32,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:32,078 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] [2018-02-02 10:24:32,079 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1190293188, now seen corresponding path program 1 times [2018-02-02 10:24:32,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:32,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:32,129 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-02 10:24:32,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:32,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:24:32,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:32,130 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-02 10:24:32,130 INFO L182 omatonBuilderFactory]: Interpolants [358#true, 359#false, 360#(<= 3 probe1_6_~ret~0), 361#(<= 3 |probe1_6_#res|), 362#(<= 3 |entry_point_#t~ret9|), 363#(<= 3 entry_point_~ret~1)] [2018-02-02 10:24:32,130 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-02 10:24:32,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:32,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:32,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:32,131 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 6 states. [2018-02-02 10:24:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:32,172 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-02 10:24:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:24:32,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 10:24:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:32,174 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:24:32,174 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 10:24:32,174 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-02 10:24:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 10:24:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-02-02 10:24:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 10:24:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-02-02 10:24:32,180 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2018-02-02 10:24:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:32,180 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-02-02 10:24:32,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-02-02 10:24:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:24:32,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:32,181 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] [2018-02-02 10:24:32,182 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash 787364094, now seen corresponding path program 1 times [2018-02-02 10:24:32,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:32,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:32,257 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-02 10:24:32,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:32,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:32,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:32,258 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-02 10:24:32,258 INFO L182 omatonBuilderFactory]: Interpolants [512#(= 0 |probe1_6_#t~ret4.offset|), 513#(= 0 probe1_6_~p~0.offset), 508#true, 509#false, 510#(= 0 |ldv_malloc_#t~malloc1.offset|), 511#(= 0 |ldv_malloc_#res.offset|)] [2018-02-02 10:24:32,259 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-02 10:24:32,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:32,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:32,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:32,259 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-02-02 10:24:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:32,281 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-02 10:24:32,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:24:32,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:24:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:32,282 INFO L225 Difference]: With dead ends: 66 [2018-02-02 10:24:32,282 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 10:24:32,282 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-02 10:24:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 10:24:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-02 10:24:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 10:24:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-02 10:24:32,285 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 25 [2018-02-02 10:24:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:32,285 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-02 10:24:32,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-02 10:24:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:24:32,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:32,286 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] [2018-02-02 10:24:32,286 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash 787364095, now seen corresponding path program 1 times [2018-02-02 10:24:32,287 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:32,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:32,321 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-02 10:24:32,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:32,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:32,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:32,321 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-02 10:24:32,322 INFO L182 omatonBuilderFactory]: Interpolants [648#true, 649#false, 650#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 651#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 652#(= 1 (select |#valid| |probe1_6_#t~ret4.base|)), 653#(= 1 (select |#valid| probe1_6_~p~0.base))] [2018-02-02 10:24:32,322 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-02 10:24:32,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:32,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:32,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:32,322 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-02-02 10:24:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:32,390 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-02-02 10:24:32,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:24:32,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:24:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:32,391 INFO L225 Difference]: With dead ends: 69 [2018-02-02 10:24:32,391 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 10:24:32,391 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-02 10:24:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 10:24:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-02-02 10:24:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 10:24:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-02 10:24:32,397 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-02-02 10:24:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:32,398 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-02 10:24:32,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-02 10:24:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:24:32,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:32,399 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] [2018-02-02 10:24:32,399 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1459091407, now seen corresponding path program 1 times [2018-02-02 10:24:32,400 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:32,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:32,480 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-02 10:24:32,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:32,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:24:32,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:32,481 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-02 10:24:32,482 INFO L182 omatonBuilderFactory]: Interpolants [790#true, 791#false, 792#(= |#valid| |old(#valid)|), 793#(and (= |#valid| (store |old(#valid)| |entry_point_~#a7~0.base| (select |#valid| |entry_point_~#a7~0.base|))) (= (select |old(#valid)| |entry_point_~#a7~0.base|) 0))] [2018-02-02 10:24:32,482 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-02 10:24:32,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:24:32,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:24:32,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:24:32,482 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2018-02-02 10:24:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:32,592 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-02-02 10:24:32,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:24:32,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-02 10:24:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:32,593 INFO L225 Difference]: With dead ends: 74 [2018-02-02 10:24:32,593 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 10:24:32,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:24:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 10:24:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 10:24:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:24:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-02-02 10:24:32,597 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 25 [2018-02-02 10:24:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:32,597 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-02-02 10:24:32,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:24:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-02-02 10:24:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:24:32,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:32,598 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] [2018-02-02 10:24:32,599 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1886799503, now seen corresponding path program 1 times [2018-02-02 10:24:32,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:32,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:32,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-02 10:24:32,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:32,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:24:32,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:32,635 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-02 10:24:32,635 INFO L182 omatonBuilderFactory]: Interpolants [931#true, 932#false, 933#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 934#(not (= 0 |ldv_malloc_#res.base|)), 935#(not (= 0 |probe1_6_#t~ret4.base|)), 936#(not (= 0 probe1_6_~p~0.base))] [2018-02-02 10:24:32,635 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-02 10:24:32,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:32,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:32,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:32,636 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-02-02 10:24:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:32,653 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-02 10:24:32,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:24:32,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 10:24:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:32,655 INFO L225 Difference]: With dead ends: 57 [2018-02-02 10:24:32,655 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 10:24:32,655 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-02 10:24:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 10:24:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 10:24:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:24:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-02 10:24:32,659 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 27 [2018-02-02 10:24:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:32,659 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-02 10:24:32,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-02 10:24:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:24:32,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:32,660 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] [2018-02-02 10:24:32,660 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash 725932211, now seen corresponding path program 1 times [2018-02-02 10:24:32,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:32,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:32,762 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-02 10:24:32,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:32,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:24:32,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:32,763 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-02 10:24:32,763 INFO L182 omatonBuilderFactory]: Interpolants [1056#(= 1 (select |#valid| |probe1_6_#in~a.base|)), 1057#(= 1 (select |#valid| probe1_6_~a.base)), 1058#(= |#valid| |old(#valid)|), 1059#(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|)), 1060#(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|))))), 1053#true, 1054#false, 1055#(= 1 (select |#valid| |entry_point_~#a7~0.base|))] [2018-02-02 10:24:32,763 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-02 10:24:32,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:24:32,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:24:32,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:24:32,764 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-02-02 10:24:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:32,982 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-02-02 10:24:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:24:32,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-02 10:24:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:32,985 INFO L225 Difference]: With dead ends: 62 [2018-02-02 10:24:32,985 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 10:24:32,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:24:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 10:24:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-02-02 10:24:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:24:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-02 10:24:32,993 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 31 [2018-02-02 10:24:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:32,994 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-02 10:24:32,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:24:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-02 10:24:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:24:32,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:32,995 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] [2018-02-02 10:24:32,995 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash 725932212, now seen corresponding path program 1 times [2018-02-02 10:24:32,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:33,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:33,114 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-02 10:24:33,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:33,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:24:33,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:33,115 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-02 10:24:33,115 INFO L182 omatonBuilderFactory]: Interpolants [1187#true, 1188#false, 1189#(and (= (select |#valid| |entry_point_~#a7~0.base|) 1) (= 0 |entry_point_~#a7~0.offset|) (= 4 (select |#length| |entry_point_~#a7~0.base|))), 1190#(and (= (select |#valid| |probe1_6_#in~a.base|) 1) (= 4 (select |#length| |probe1_6_#in~a.base|)) (= 0 |probe1_6_#in~a.offset|)), 1191#(and (= (select |#valid| probe1_6_~a.base) 1) (= probe1_6_~a.offset 0) (= 4 (select |#length| probe1_6_~a.base))), 1192#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1193#(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|))), 1194#(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|))))), 1195#(and (= (select |#length| probe1_6_~a.base) 4) (= probe1_6_~a.offset 0))] [2018-02-02 10:24:33,115 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-02 10:24:33,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:24:33,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:24:33,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:24:33,116 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 9 states. [2018-02-02 10:24:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:33,367 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-02 10:24:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:24:33,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 10:24:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:33,368 INFO L225 Difference]: With dead ends: 57 [2018-02-02 10:24:33,368 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 10:24:33,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:24:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 10:24:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-02-02 10:24:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 10:24:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-02-02 10:24:33,372 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2018-02-02 10:24:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:33,372 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-02-02 10:24:33,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:24:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-02-02 10:24:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:24:33,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:33,373 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] [2018-02-02 10:24:33,373 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:33,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2094593310, now seen corresponding path program 1 times [2018-02-02 10:24:33,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:33,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:33,416 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-02 10:24:33,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:33,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:24:33,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:33,417 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-02 10:24:33,417 INFO L182 omatonBuilderFactory]: Interpolants [1318#true, 1319#false, 1320#(<= (+ probe1_6_~ret~0 1) 0), 1321#(<= (+ |probe1_6_#res| 1) 0), 1322#(<= (+ |entry_point_#t~ret9| 1) 0), 1323#(<= (+ entry_point_~ret~1 1) 0)] [2018-02-02 10:24:33,417 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-02 10:24:33,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:33,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:33,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:33,418 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2018-02-02 10:24:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:33,444 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-02 10:24:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:24:33,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-02 10:24:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:33,445 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:24:33,445 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 10:24:33,445 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-02 10:24:33,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 10:24:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-02-02 10:24:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 10:24:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-02 10:24:33,447 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2018-02-02 10:24:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:33,447 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-02 10:24:33,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-02 10:24:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:24:33,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:33,448 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] [2018-02-02 10:24:33,448 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1386851478, now seen corresponding path program 1 times [2018-02-02 10:24:33,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:33,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:33,657 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-02 10:24:33,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:33,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:24:33,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:33,658 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-02 10:24:33,658 INFO L182 omatonBuilderFactory]: Interpolants [1456#(and (= (select (store |#valid| |entry_point_~#a7~0.base| 0) |entry_point_~#a7~0.base|) (select |old(#valid)| |entry_point_~#a7~0.base|)) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)))), 1448#true, 1449#false, 1450#(= |#valid| |old(#valid)|), 1451#(and (= 0 (select |old(#valid)| |entry_point_~#a7~0.base|)) (= (select |#valid| |entry_point_~#a7~0.base|) 1) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)))), 1452#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 1453#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 1454#(and (not (= 0 |probe1_6_#t~ret4.base|)) (= (store |#valid| |probe1_6_#t~ret4.base| 0) |old(#valid)|)), 1455#(and (= |old(#valid)| (store |#valid| probe1_6_~p~0.base 0)) (not (= 0 probe1_6_~p~0.base)))] [2018-02-02 10:24:33,658 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-02 10:24:33,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:24:33,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:24:33,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:24:33,659 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 9 states. [2018-02-02 10:24:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:33,823 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-02-02 10:24:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:24:33,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 10:24:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:33,823 INFO L225 Difference]: With dead ends: 64 [2018-02-02 10:24:33,823 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:24:33,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:24:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:24:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 10:24:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:24:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-02 10:24:33,826 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 35 [2018-02-02 10:24:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:33,826 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-02 10:24:33,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:24:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-02 10:24:33,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:24:33,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:33,828 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:33,828 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:33,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935703, now seen corresponding path program 1 times [2018-02-02 10:24:33,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:33,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:33,872 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-02 10:24:33,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:33,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:24:33,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:33,873 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-02 10:24:33,873 INFO L182 omatonBuilderFactory]: Interpolants [1584#(= 1 (select |#valid| |entry_point_~#a7~0.base|)), 1585#(= 1 (select |#valid| |disconnect_6_#in~a.base|)), 1586#(= 1 (select |#valid| disconnect_6_~a.base)), 1580#true, 1581#false, 1582#(= probe1_6_~a.base |probe1_6_#in~a.base|), 1583#(= 1 (select |#valid| |probe1_6_#in~a.base|))] [2018-02-02 10:24:33,873 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-02 10:24:33,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:24:33,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:24:33,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:24:33,874 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 7 states. [2018-02-02 10:24:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:33,939 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-02 10:24:33,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:24:33,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 10:24:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:33,942 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:24:33,942 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:24:33,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:24:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:24:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-02-02 10:24:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:24:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-02 10:24:33,945 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 39 [2018-02-02 10:24:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:33,945 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-02 10:24:33,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:24:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-02 10:24:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:24:33,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:33,946 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:33,947 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2029935704, now seen corresponding path program 1 times [2018-02-02 10:24:33,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:33,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:34,123 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-02 10:24:34,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:34,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:24:34,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:34,124 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-02 10:24:34,124 INFO L182 omatonBuilderFactory]: Interpolants [1696#true, 1697#false, 1698#(= 0 |entry_point_~#a7~0.offset|), 1699#(and (or (= probe1_6_~a.base |probe1_6_#in~a.base|) (not (= probe1_6_~a.offset 0))) (or (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= probe1_6_~a.offset 0))), 1700#(or (<= 4 (select |#length| |probe1_6_#in~a.base|)) (not (= 0 |probe1_6_#in~a.offset|))), 1701#(and (= 0 |entry_point_~#a7~0.offset|) (<= 4 (select |#length| |entry_point_~#a7~0.base|))), 1702#(and (= 0 |disconnect_6_#in~a.offset|) (<= 4 (select |#length| |disconnect_6_#in~a.base|))), 1703#(and (<= 4 (select |#length| disconnect_6_~a.base)) (= disconnect_6_~a.offset 0))] [2018-02-02 10:24:34,124 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-02 10:24:34,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:24:34,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:24:34,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:24:34,125 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 8 states. [2018-02-02 10:24:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:34,191 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-02 10:24:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:24:34,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 10:24:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:34,192 INFO L225 Difference]: With dead ends: 51 [2018-02-02 10:24:34,192 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 10:24:34,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:24:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 10:24:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 10:24:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:24:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-02 10:24:34,194 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 39 [2018-02-02 10:24:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:34,195 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-02 10:24:34,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:24:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-02 10:24:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:24:34,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:34,196 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] [2018-02-02 10:24:34,196 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502653, now seen corresponding path program 1 times [2018-02-02 10:24:34,197 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:34,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:34,293 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-02 10:24:34,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:34,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:24:34,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:34,294 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-02 10:24:34,294 INFO L182 omatonBuilderFactory]: Interpolants [1810#true, 1811#false, 1812#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 1813#(= 0 |ldv_malloc_#t~malloc1.offset|), 1814#(= 0 |ldv_malloc_#res.offset|), 1815#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= 0 |probe1_6_#t~ret4.offset|)), 1816#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 probe1_6_~p~0.offset) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 1817#(= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)), 1818#(= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|)), 1819#(= 0 (select (select |#memory_$Pointer$.offset| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)), 1820#(= 0 (select (select |#memory_$Pointer$.offset| disconnect_6_~a.base) disconnect_6_~a.offset)), 1821#(= |disconnect_6_#t~mem8.offset| 0)] [2018-02-02 10:24:34,294 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-02 10:24:34,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:24:34,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:24:34,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:24:34,294 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 12 states. [2018-02-02 10:24:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:34,373 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-02 10:24:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:24:34,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 10:24:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:34,376 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:24:34,376 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:24:34,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:24:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:24:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 10:24:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:24:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-02 10:24:34,379 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 40 [2018-02-02 10:24:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:34,379 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-02 10:24:34,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:24:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-02 10:24:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:24:34,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:34,380 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] [2018-02-02 10:24:34,380 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1496502652, now seen corresponding path program 1 times [2018-02-02 10:24:34,387 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:34,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:34,490 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-02 10:24:34,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:34,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:24:34,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:34,491 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-02 10:24:34,491 INFO L182 omatonBuilderFactory]: Interpolants [1936#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= 1 (select |#valid| probe1_6_~p~0.base))), 1937#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))), 1938#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|))), 1939#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|))), 1940#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_6_~a.base) disconnect_6_~a.offset))), 1941#(= 1 (select |#valid| |disconnect_6_#t~mem8.base|)), 1930#true, 1931#false, 1932#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 1933#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1934#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1935#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 1 (select |#valid| |probe1_6_#t~ret4.base|)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|))] [2018-02-02 10:24:34,491 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-02 10:24:34,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:24:34,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:24:34,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:24:34,491 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 12 states. [2018-02-02 10:24:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:34,588 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-02 10:24:34,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:24:34,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 10:24:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:34,589 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:24:34,589 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:24:34,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:24:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:24:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-02 10:24:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:24:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-02-02 10:24:34,593 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 40 [2018-02-02 10:24:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:34,593 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-02-02 10:24:34,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:24:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-02-02 10:24:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:24:34,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:34,594 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-02 10:24:34,594 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 901697635, now seen corresponding path program 1 times [2018-02-02 10:24:34,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:34,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:34,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-02 10:24:34,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:34,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:34,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:34,622 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-02 10:24:34,622 INFO L182 omatonBuilderFactory]: Interpolants [2049#true, 2050#false, 2051#(= 0 |probe1_6_#res|), 2052#(= 0 |entry_point_#t~ret9|), 2053#(= entry_point_~ret~1 0)] [2018-02-02 10:24:34,622 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-02 10:24:34,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:24:34,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:24:34,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:24:34,623 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2018-02-02 10:24:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:34,627 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-02-02 10:24:34,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:24:34,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 10:24:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:34,629 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:24:34,629 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 10:24:34,629 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-02 10:24:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 10:24:34,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 10:24:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:24:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-02-02 10:24:34,631 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 41 [2018-02-02 10:24:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:34,631 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-02-02 10:24:34,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:24:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-02-02 10:24:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:24:34,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:34,633 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:34,633 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 10:24:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1792979891, now seen corresponding path program 1 times [2018-02-02 10:24:34,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:34,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:34,859 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-02 10:24:34,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:34,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:24:34,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:34,860 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-02 10:24:34,860 INFO L182 omatonBuilderFactory]: Interpolants [2152#true, 2153#false, 2154#(= |#valid| |old(#valid)|), 2155#(and (= 0 (select |old(#valid)| |entry_point_~#a7~0.base|)) (= (select |#valid| |entry_point_~#a7~0.base|) 1) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)))), 2156#(and (= |#valid| |old(#valid)|) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 2157#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 2158#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 2159#(and (not (= 0 |probe1_6_#t~ret4.base|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 (select |old(#valid)| |probe1_6_#t~ret4.base|)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= |old(#valid)| (store |#valid| |probe1_6_#t~ret4.base| (select |old(#valid)| |probe1_6_#t~ret4.base|)))), 2160#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 (select |old(#valid)| probe1_6_~p~0.base)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= (store |#valid| probe1_6_~p~0.base (select |old(#valid)| probe1_6_~p~0.base)) |old(#valid)|) (not (= 0 probe1_6_~p~0.base))), 2161#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))) (= (store |#valid| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)))), 2162#(and (not (= 0 (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|))) (= 0 (select |old(#valid)| |entry_point_~#a7~0.base|)) (not (= |entry_point_~#a7~0.base| (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|))) (= (store (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)) (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_~#a7~0.base|) |entry_point_~#a7~0.offset|)))), 2163#(and (= disconnect_6_~a.offset |disconnect_6_#in~a.offset|) (= disconnect_6_~a.base |disconnect_6_#in~a.base|) (= |#valid| |old(#valid)|)), 2164#(and (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) |disconnect_6_#t~mem8.base|)), 2165#(or (= 0 (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)) 0) (= (store |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|))) |old(#valid)|))), 2166#(and (= (select (store |#valid| |entry_point_~#a7~0.base| 0) |entry_point_~#a7~0.base|) (select |old(#valid)| |entry_point_~#a7~0.base|)) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|))))] [2018-02-02 10:24:34,860 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-02 10:24:34,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:24:34,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:24:34,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:24:34,861 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 15 states. [2018-02-02 10:24:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:35,112 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-02-02 10:24:35,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:24:35,113 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-02 10:24:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:35,113 INFO L225 Difference]: With dead ends: 48 [2018-02-02 10:24:35,113 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 10:24:35,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:24:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 10:24:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 10:24:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 10:24:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 10:24:35,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-02 10:24:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:35,114 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 10:24:35,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:24:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 10:24:35,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 10:24:35,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:24:35 BoogieIcfgContainer [2018-02-02 10:24:35,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:24:35,120 INFO L168 Benchmark]: Toolchain (without parser) took 4062.74 ms. Allocated memory was 402.1 MB in the beginning and 682.1 MB in the end (delta: 280.0 MB). Free memory was 359.0 MB in the beginning and 522.2 MB in the end (delta: -163.2 MB). Peak memory consumption was 116.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:35,121 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:35,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.27 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:35,122 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 344.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:35,122 INFO L168 Benchmark]: RCFGBuilder took 170.68 ms. Allocated memory is still 402.1 MB. Free memory was 344.4 MB in the beginning and 323.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:35,122 INFO L168 Benchmark]: TraceAbstraction took 3713.54 ms. Allocated memory was 402.1 MB in the beginning and 682.1 MB in the end (delta: 280.0 MB). Free memory was 323.8 MB in the beginning and 522.2 MB in the end (delta: -198.4 MB). Peak memory consumption was 81.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:35,123 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.27 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.8 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.45 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 344.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 170.68 ms. Allocated memory is still 402.1 MB. Free memory was 344.4 MB in the beginning and 323.8 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3713.54 ms. Allocated memory was 402.1 MB in the beginning and 682.1 MB in the end (delta: 280.0 MB). Free memory was 323.8 MB in the beginning and 522.2 MB in the end (delta: -198.4 MB). Peak memory consumption was 81.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1474]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 3.6s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 304 SDslu, 2992 SDs, 0 SdLazy, 1582 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, 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, 17 MinimizatonAttempts, 33 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 96128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-24-35-130.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-24-35-130.csv Received shutdown request...