java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:22:12,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:22:12,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:22:12,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:22:12,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:22:12,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:22:12,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:22:12,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:22:12,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:22:12,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:22:12,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:22:12,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:22:12,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:22:12,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:22:12,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:22:12,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:22:12,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:22:12,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:22:12,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:22:12,483 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:22:12,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:22:12,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:22:12,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:22:12,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:22:12,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:22:12,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:22:12,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:22:12,489 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:22:12,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:22:12,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:22:12,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:22:12,490 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:22:12,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:22:12,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:22:12,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:22:12,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:22:12,502 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:22:12,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:22:12,502 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:22:12,502 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:22:12,502 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:22:12,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:22:12,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:22:12,503 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:22:12,503 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:22:12,503 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:22:12,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:22:12,503 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:22:12,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:22:12,504 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:22:12,504 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:22:12,504 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:22:12,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:22:12,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:22:12,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:22:12,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:22:12,545 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:22:12,548 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:22:12,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:22:12,550 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:22:12,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-04 03:22:12,708 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:22:12,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:22:12,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:22:12,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:22:12,716 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:22:12,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d1e458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12, skipping insertion in model container [2018-02-04 03:22:12,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,734 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:22:12,772 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:22:12,857 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:22:12,871 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:22:12,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12 WrapperNode [2018-02-04 03:22:12,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:22:12,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:22:12,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:22:12,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:22:12,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (1/1) ... [2018-02-04 03:22:12,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:22:12,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:22:12,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:22:12,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:22:12,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:22:12,943 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:22:12,944 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:22:12,944 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:22:12,944 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:22:12,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-02-04 03:22:12,945 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:22:12,946 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:22:12,946 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:22:12,946 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:22:13,163 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:22:13,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:22:13 BoogieIcfgContainer [2018-02-04 03:22:13,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:22:13,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:22:13,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:22:13,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:22:13,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:22:12" (1/3) ... [2018-02-04 03:22:13,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b258906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:22:13, skipping insertion in model container [2018-02-04 03:22:13,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:12" (2/3) ... [2018-02-04 03:22:13,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b258906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:22:13, skipping insertion in model container [2018-02-04 03:22:13,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:22:13" (3/3) ... [2018-02-04 03:22:13,169 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-04 03:22:13,176 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:22:13,181 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 03:22:13,213 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:22:13,213 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:22:13,214 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:22:13,214 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:22:13,214 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:22:13,214 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:22:13,214 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:22:13,214 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:22:13,215 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:22:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-02-04 03:22:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:22:13,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:13,235 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:13,235 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506467, now seen corresponding path program 1 times [2018-02-04 03:22:13,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:13,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:13,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:13,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:13,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:13,429 INFO L182 omatonBuilderFactory]: Interpolants [96#(= 1 (select |#valid| probe_19_~a.base)), 97#(= |#valid| |old(#valid)|), 92#true, 93#false, 94#(= 1 (select |#valid| |entry_point_~#a19~0.base|)), 95#(= 1 (select |#valid| |probe_19_#in~a.base|))] [2018-02-04 03:22:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:13,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:13,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:13,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:13,504 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-02-04 03:22:13,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:13,760 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-02-04 03:22:13,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:22:13,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 03:22:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:13,770 INFO L225 Difference]: With dead ends: 136 [2018-02-04 03:22:13,770 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 03:22:13,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 03:22:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-02-04 03:22:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 03:22:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-04 03:22:13,805 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-04 03:22:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:13,805 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-04 03:22:13,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-04 03:22:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:22:13,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:13,807 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:13,807 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506468, now seen corresponding path program 1 times [2018-02-04 03:22:13,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:13,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:13,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:13,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:13,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:13,905 INFO L182 omatonBuilderFactory]: Interpolants [336#false, 337#(and (= 0 |entry_point_~#a19~0.offset|) (= 8 (select |#length| |entry_point_~#a19~0.base|))), 338#(and (= 8 (select |#length| |probe_19_#in~a.base|)) (= 0 |probe_19_#in~a.offset|)), 339#(and (= 8 (select |#length| probe_19_~a.base)) (= probe_19_~a.offset 0)), 340#(= |old(#length)| |#length|), 335#true] [2018-02-04 03:22:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:13,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:13,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:13,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:13,907 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-02-04 03:22:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:14,087 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2018-02-04 03:22:14,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:22:14,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 03:22:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:14,089 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:22:14,089 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:22:14,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:22:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-04 03:22:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 03:22:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-02-04 03:22:14,096 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-02-04 03:22:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:14,096 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-02-04 03:22:14,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-02-04 03:22:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:22:14,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:14,096 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:14,097 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488357, now seen corresponding path program 1 times [2018-02-04 03:22:14,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:14,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:14,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:14,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:22:14,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:14,195 INFO L182 omatonBuilderFactory]: Interpolants [580#true, 581#false, 582#(= (select |#valid| |entry_point_~#a19~0.base|) 1), 583#(= (select |#valid| |probe_19_#in~a.base|) 1), 584#(= (select |#valid| probe_19_~a.base) 1), 585#(= |#valid| |old(#valid)|), 586#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 587#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-04 03:22:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:14,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:22:14,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:22:14,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:14,196 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-02-04 03:22:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:14,482 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2018-02-04 03:22:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:22:14,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 03:22:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:14,484 INFO L225 Difference]: With dead ends: 147 [2018-02-04 03:22:14,484 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 03:22:14,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:22:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 03:22:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-02-04 03:22:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 03:22:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-02-04 03:22:14,497 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-02-04 03:22:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:14,497 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-02-04 03:22:14,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:22:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-02-04 03:22:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:22:14,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:14,498 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:14,498 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:14,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488358, now seen corresponding path program 1 times [2018-02-04 03:22:14,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:14,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:14,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:14,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:22:14,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:14,594 INFO L182 omatonBuilderFactory]: Interpolants [851#true, 852#false, 853#(and (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1) (= 8 (select |#length| |entry_point_~#a19~0.base|))), 854#(and (= (select |#valid| |probe_19_#in~a.base|) 1) (= 8 (select |#length| |probe_19_#in~a.base|)) (= 0 |probe_19_#in~a.offset|)), 855#(and (= 8 (select |#length| probe_19_~a.base)) (= probe_19_~a.offset 0) (= (select |#valid| probe_19_~a.base) 1)), 856#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 857#(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|))), 858#(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|))))), 859#(and (= (select |#length| probe_19_~a.base) 8) (= probe_19_~a.offset 0))] [2018-02-04 03:22:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:14,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:22:14,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:22:14,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:22:14,595 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-02-04 03:22:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:14,865 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2018-02-04 03:22:14,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:22:14,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 03:22:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:14,866 INFO L225 Difference]: With dead ends: 149 [2018-02-04 03:22:14,866 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 03:22:14,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:22:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 03:22:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-02-04 03:22:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 03:22:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-04 03:22:14,871 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-02-04 03:22:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:14,871 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-04 03:22:14,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:22:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-04 03:22:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:22:14,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:14,872 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:14,872 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1193563309, now seen corresponding path program 1 times [2018-02-04 03:22:14,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:14,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:14,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:14,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:22:14,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:14,929 INFO L182 omatonBuilderFactory]: Interpolants [1104#(and (= 0 |probe_19_#t~ret7.base|) (= 0 |probe_19_#t~ret7.offset|)), 1105#(and (= 0 (select (select |#memory_$Pointer$.offset| probe_19_~a.base) (+ probe_19_~a.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))), 1106#(and (= 0 |probe_19_#t~mem9.base|) (= 0 |probe_19_#t~mem9.offset|)), 1101#true, 1102#false, 1103#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|))] [2018-02-04 03:22:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:14,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:14,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:14,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:14,930 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 6 states. [2018-02-04 03:22:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:14,961 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-04 03:22:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:22:14,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:22:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:14,962 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:22:14,962 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:22:14,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:22:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-02-04 03:22:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:22:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-02-04 03:22:14,966 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 26 [2018-02-04 03:22:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:14,966 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-02-04 03:22:14,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-02-04 03:22:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:22:14,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:14,967 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:14,967 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:14,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443383, now seen corresponding path program 1 times [2018-02-04 03:22:14,967 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:14,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:15,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:22:15,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,028 INFO L182 omatonBuilderFactory]: Interpolants [1296#(= 1 (select |#valid| |disconnect_19_#in~a.base|)), 1297#(= 1 (select |#valid| disconnect_19_~a.base)), 1290#true, 1291#false, 1292#(= probe_19_~a.base |probe_19_#in~a.base|), 1293#(and (= 1 (select |#valid| probe_19_~a.base)) (= probe_19_~a.base |probe_19_#in~a.base|)), 1294#(= 1 (select |#valid| |probe_19_#in~a.base|)), 1295#(= 1 (select |#valid| |entry_point_~#a19~0.base|))] [2018-02-04 03:22:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:22:15,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:22:15,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:15,029 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 8 states. [2018-02-04 03:22:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:15,114 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-02-04 03:22:15,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:22:15,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 03:22:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:15,116 INFO L225 Difference]: With dead ends: 101 [2018-02-04 03:22:15,116 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 03:22:15,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:22:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 03:22:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-04 03:22:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 03:22:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-02-04 03:22:15,121 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 26 [2018-02-04 03:22:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:15,122 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-02-04 03:22:15,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:22:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-02-04 03:22:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:22:15,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:15,123 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:15,123 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443382, now seen corresponding path program 1 times [2018-02-04 03:22:15,124 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:15,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:15,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:22:15,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,167 INFO L182 omatonBuilderFactory]: Interpolants [1497#true, 1498#false, 1499#(<= 3 probe_19_~ret~0), 1500#(<= 3 |probe_19_#res|), 1501#(<= 3 |entry_point_#t~ret14|), 1502#(<= 3 entry_point_~ret~1)] [2018-02-04 03:22:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:15,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:15,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:15,168 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 6 states. [2018-02-04 03:22:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:15,187 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-02-04 03:22:15,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:22:15,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:22:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:15,190 INFO L225 Difference]: With dead ends: 97 [2018-02-04 03:22:15,190 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 03:22:15,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:22:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 03:22:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-02-04 03:22:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:22:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-04 03:22:15,195 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 26 [2018-02-04 03:22:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:15,195 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-04 03:22:15,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-04 03:22:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:22:15,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:15,196 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:15,196 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265041, now seen corresponding path program 1 times [2018-02-04 03:22:15,197 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:15,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:15,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:15,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,252 INFO L182 omatonBuilderFactory]: Interpolants [1696#false, 1697#(= 1 (select |#valid| probe_19_~a.base)), 1698#(= 1 (select |#valid| |f19_#in~a.base|)), 1699#(= 1 (select |#valid| f19_~a.base)), 1700#(= |#valid| |old(#valid)|), 1695#true] [2018-02-04 03:22:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:15,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:15,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:15,253 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 6 states. [2018-02-04 03:22:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:15,352 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 03:22:15,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:22:15,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 03:22:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:15,353 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:22:15,353 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:22:15,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:22:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:22:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2018-02-04 03:22:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:22:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-04 03:22:15,358 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 28 [2018-02-04 03:22:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:15,358 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-04 03:22:15,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-04 03:22:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:22:15,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:15,362 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:15,362 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:15,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265042, now seen corresponding path program 1 times [2018-02-04 03:22:15,363 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:15,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:15,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:22:15,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,461 INFO L182 omatonBuilderFactory]: Interpolants [1920#(= |old(#length)| |#length|), 1912#true, 1913#false, 1914#(= 0 |entry_point_~#a19~0.offset|), 1915#(= 0 |probe_19_#in~a.offset|), 1916#(= 0 probe_19_~a.offset), 1917#(and (<= (+ probe_19_~a.offset 8) (select |#length| probe_19_~a.base)) (= 0 probe_19_~a.offset)), 1918#(and (<= 8 (select |#length| |f19_#in~a.base|)) (= 0 |f19_#in~a.offset|)), 1919#(and (= f19_~a.offset 0) (<= 8 (select |#length| f19_~a.base)))] [2018-02-04 03:22:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:22:15,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:22:15,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:22:15,461 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-02-04 03:22:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:15,663 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 03:22:15,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:22:15,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 03:22:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:15,664 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:22:15,664 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:22:15,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:22:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:22:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-02-04 03:22:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 03:22:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-04 03:22:15,669 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 28 [2018-02-04 03:22:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:15,670 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-04 03:22:15,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:22:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-04 03:22:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:22:15,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:15,671 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:15,671 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860499, now seen corresponding path program 1 times [2018-02-04 03:22:15,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:15,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:15,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:22:15,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,757 INFO L182 omatonBuilderFactory]: Interpolants [2144#(= (select |#valid| probe_19_~a.base) 1), 2145#(= (select |#valid| |f19_#in~a.base|) 1), 2146#(= 1 (select |#valid| f19_~a.base)), 2147#(= |#valid| |old(#valid)|), 2148#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 2149#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 2142#true, 2143#false] [2018-02-04 03:22:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:15,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:22:15,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:22:15,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:15,757 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 8 states. [2018-02-04 03:22:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:15,914 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-04 03:22:15,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:22:15,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-04 03:22:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:15,915 INFO L225 Difference]: With dead ends: 117 [2018-02-04 03:22:15,916 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 03:22:15,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:22:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 03:22:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-02-04 03:22:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:22:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-02-04 03:22:15,918 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 30 [2018-02-04 03:22:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:15,918 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-02-04 03:22:15,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:22:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-02-04 03:22:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:22:15,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:15,919 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:15,919 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860500, now seen corresponding path program 1 times [2018-02-04 03:22:15,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:15,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:16,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:16,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:22:16,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:16,033 INFO L182 omatonBuilderFactory]: Interpolants [2371#true, 2372#false, 2373#(= 0 |entry_point_~#a19~0.offset|), 2374#(= 0 |probe_19_#in~a.offset|), 2375#(= 0 probe_19_~a.offset), 2376#(and (<= (+ probe_19_~a.offset 8) (select |#length| probe_19_~a.base)) (= 0 probe_19_~a.offset) (= (select |#valid| probe_19_~a.base) 1)), 2377#(and (<= 8 (select |#length| |f19_#in~a.base|)) (= (select |#valid| |f19_#in~a.base|) 1) (= 0 |f19_#in~a.offset|)), 2378#(and (= (select |#valid| f19_~a.base) 1) (= f19_~a.offset 0) (<= 8 (select |#length| f19_~a.base))), 2379#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2380#(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|))), 2381#(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|))))), 2382#(and (= f19_~a.offset 0) (<= 8 (select |#length| f19_~a.base)))] [2018-02-04 03:22:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:16,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:22:16,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:22:16,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:22:16,034 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 12 states. [2018-02-04 03:22:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:16,482 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-04 03:22:16,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:22:16,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-02-04 03:22:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:16,484 INFO L225 Difference]: With dead ends: 124 [2018-02-04 03:22:16,484 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:22:16,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:22:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:22:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-04 03:22:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 03:22:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-04 03:22:16,487 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2018-02-04 03:22:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:16,488 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-04 03:22:16,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:22:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-04 03:22:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:22:16,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:16,488 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] [2018-02-04 03:22:16,489 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:16,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1708399928, now seen corresponding path program 1 times [2018-02-04 03:22:16,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:16,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:16,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:16,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:22:16,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:16,548 INFO L182 omatonBuilderFactory]: Interpolants [2620#true, 2621#false, 2622#(= |#valid| |old(#valid)|), 2623#(and (= (select |old(#valid)| |entry_point_~#a19~0.base|) 0) (= |#valid| (store |old(#valid)| |entry_point_~#a19~0.base| (select |#valid| |entry_point_~#a19~0.base|))))] [2018-02-04 03:22:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:16,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:22:16,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:22:16,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:22:16,549 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 4 states. [2018-02-04 03:22:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:16,617 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-04 03:22:16,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:22:16,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 03:22:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:16,618 INFO L225 Difference]: With dead ends: 105 [2018-02-04 03:22:16,618 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:22:16,619 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-04 03:22:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:22:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-02-04 03:22:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 03:22:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-02-04 03:22:16,622 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 28 [2018-02-04 03:22:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:16,622 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-02-04 03:22:16,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:22:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-02-04 03:22:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:22:16,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:16,624 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] [2018-02-04 03:22:16,624 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:16,624 INFO L82 PathProgramCache]: Analyzing trace with hash -526031434, now seen corresponding path program 1 times [2018-02-04 03:22:16,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:16,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:16,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-04 03:22:16,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:16,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:22:16,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:16,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-04 03:22:16,658 INFO L182 omatonBuilderFactory]: Interpolants [2816#true, 2817#false, 2818#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 2819#(not (= 0 |ldv_malloc_#res.base|)), 2820#(not (= 0 |probe_19_#t~ret7.base|)), 2821#(not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))), 2822#(not (= 0 |probe_19_#t~mem9.base|))] [2018-02-04 03:22:16,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-04 03:22:16,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:22:16,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:22:16,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:22:16,659 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-02-04 03:22:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:16,691 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-04 03:22:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:22:16,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 03:22:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:16,692 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:22:16,692 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:22:16,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:22:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:22:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 03:22:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 03:22:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-02-04 03:22:16,694 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 30 [2018-02-04 03:22:16,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:16,694 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-02-04 03:22:16,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:22:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-02-04 03:22:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:22:16,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:16,695 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:16,695 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash 850149805, now seen corresponding path program 1 times [2018-02-04 03:22:16,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:16,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:22:16,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:16,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:16,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:16,723 INFO L182 omatonBuilderFactory]: Interpolants [2992#(= 0 |probe_19_#t~ret10|), 2993#(= 0 probe_19_~ret~0), 2989#true, 2990#false, 2991#(= 0 |f19_#res|)] [2018-02-04 03:22:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:22:16,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:22:16,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:22:16,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:22:16,724 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 5 states. [2018-02-04 03:22:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:16,737 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-02-04 03:22:16,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:22:16,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 03:22:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:16,738 INFO L225 Difference]: With dead ends: 86 [2018-02-04 03:22:16,738 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 03:22:16,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:22:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 03:22:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-04 03:22:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 03:22:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-04 03:22:16,741 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-02-04 03:22:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:16,741 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-04 03:22:16,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:22:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-04 03:22:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:22:16,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:16,742 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:16,742 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653486, now seen corresponding path program 1 times [2018-02-04 03:22:16,745 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:16,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:16,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:16,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:22:16,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:16,964 INFO L182 omatonBuilderFactory]: Interpolants [3168#(= 0 probe_19_~a.offset), 3169#(= 0 |ldv_malloc_#t~malloc1.offset|), 3170#(= 0 |ldv_malloc_#res.offset|), 3171#(and (= 0 probe_19_~a.offset) (= 0 |probe_19_#t~ret7.offset|)), 3172#(and (= 0 (select (select |#memory_$Pointer$.offset| probe_19_~a.base) (+ probe_19_~a.offset 4))) (= 0 probe_19_~a.offset)), 3173#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 3174#(and (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= f19_~a.base |f19_#in~a.base|)), 3175#(and (= (select |#memory_$Pointer$.offset| f19_~a.base) (store (select |old(#memory_$Pointer$.offset)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.offset| f19_~a.base) f19_~a.offset))) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= f19_~a.base |f19_#in~a.base|)), 3176#(and (= (store (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.offset| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)))) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)) (or (not (= |f19_#in~a.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)) 0))), 3177#(= 0 (select (select |#memory_$Pointer$.offset| probe_19_~a.base) (+ probe_19_~a.offset 4))), 3178#(= 0 |probe_19_#t~mem12.offset|), 3164#true, 3165#false, 3166#(= 0 |entry_point_~#a19~0.offset|), 3167#(= 0 |probe_19_#in~a.offset|)] [2018-02-04 03:22:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:16,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:22:16,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:22:16,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:22:16,965 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 15 states. [2018-02-04 03:22:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:17,329 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-04 03:22:17,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:22:17,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-04 03:22:17,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:17,330 INFO L225 Difference]: With dead ends: 83 [2018-02-04 03:22:17,330 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 03:22:17,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:22:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 03:22:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 03:22:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 03:22:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-02-04 03:22:17,334 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2018-02-04 03:22:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:17,334 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-02-04 03:22:17,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:22:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-02-04 03:22:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:22:17,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:17,335 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:17,335 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:17,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653487, now seen corresponding path program 1 times [2018-02-04 03:22:17,336 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:17,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:17,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:17,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:22:17,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:17,515 INFO L182 omatonBuilderFactory]: Interpolants [3366#true, 3367#false, 3368#(= 0 |entry_point_~#a19~0.offset|), 3369#(= 0 |probe_19_#in~a.offset|), 3370#(= 0 probe_19_~a.offset), 3371#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 3372#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 3373#(and (= 1 (select |#valid| |probe_19_#t~ret7.base|)) (= 0 probe_19_~a.offset)), 3374#(and (= 0 probe_19_~a.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))), 3375#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 3376#(and (= |#valid| |old(#valid)|) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 3377#(= |#valid| |old(#valid)|), 3378#(and (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (= |#valid| |old(#valid)|) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= f19_~a.base |f19_#in~a.base|)), 3379#(and (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (or (not (= |f19_#in~a.offset| 0)) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0))), 3380#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))), 3381#(= 1 (select |#valid| |probe_19_#t~mem12.base|))] [2018-02-04 03:22:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:17,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:22:17,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:22:17,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:22:17,515 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 16 states. [2018-02-04 03:22:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:17,750 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-02-04 03:22:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:22:17,750 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-02-04 03:22:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:17,752 INFO L225 Difference]: With dead ends: 103 [2018-02-04 03:22:17,752 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 03:22:17,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:22:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 03:22:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-02-04 03:22:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:22:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-04 03:22:17,760 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 37 [2018-02-04 03:22:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:17,760 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-04 03:22:17,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:22:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-04 03:22:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:22:17,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:17,761 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:17,761 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash 695150445, now seen corresponding path program 1 times [2018-02-04 03:22:17,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:17,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:17,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:17,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:22:17,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:17,810 INFO L182 omatonBuilderFactory]: Interpolants [3600#(not (= 0 |f19_#t~mem4.base|)), 3594#true, 3595#false, 3596#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 3597#(not (= 0 |ldv_malloc_#res.base|)), 3598#(not (= 0 |f19_#t~ret2.base|)), 3599#(not (= 0 (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset)))] [2018-02-04 03:22:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:17,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:22:17,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:22:17,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:22:17,811 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-02-04 03:22:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:17,853 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-04 03:22:17,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:22:17,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 03:22:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:17,854 INFO L225 Difference]: With dead ends: 90 [2018-02-04 03:22:17,854 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 03:22:17,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:22:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 03:22:17,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-04 03:22:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:22:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-04 03:22:17,860 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2018-02-04 03:22:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:17,861 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-04 03:22:17,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:22:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-04 03:22:17,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:22:17,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:17,862 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:17,862 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:17,862 INFO L82 PathProgramCache]: Analyzing trace with hash -200066512, now seen corresponding path program 1 times [2018-02-04 03:22:17,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:17,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:17,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:17,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:17,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:17,908 INFO L182 omatonBuilderFactory]: Interpolants [3785#true, 3786#false, 3787#(= 1 (select |#valid| probe_19_~a.base)), 3788#(= |#valid| |old(#valid)|), 3789#(= 1 (select |#valid| |f19_undo_#in~a.base|)), 3790#(= 1 (select |#valid| f19_undo_~a.base))] [2018-02-04 03:22:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:17,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:17,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:17,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:17,908 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-02-04 03:22:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:18,007 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-04 03:22:18,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:22:18,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 03:22:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:18,008 INFO L225 Difference]: With dead ends: 104 [2018-02-04 03:22:18,008 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 03:22:18,008 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-04 03:22:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 03:22:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-04 03:22:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 03:22:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-02-04 03:22:18,011 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 44 [2018-02-04 03:22:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:18,011 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-02-04 03:22:18,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-02-04 03:22:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:22:18,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:18,012 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:18,012 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash -200066511, now seen corresponding path program 1 times [2018-02-04 03:22:18,012 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:18,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:18,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:18,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:22:18,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:18,066 INFO L182 omatonBuilderFactory]: Interpolants [4000#false, 4001#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 4002#(and (= 0 |f19_#t~ret2.base|) (= 0 |f19_#t~ret2.offset|)), 4003#(and (= 0 (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset)) (= 0 (select (select |#memory_$Pointer$.offset| f19_~a.base) f19_~a.offset))), 4004#(and (= 0 |f19_#t~mem4.base|) (= |f19_#t~mem4.offset| 0)), 3999#true] [2018-02-04 03:22:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:18,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:18,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:18,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:18,067 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2018-02-04 03:22:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:18,102 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-04 03:22:18,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:22:18,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 03:22:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:18,103 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:22:18,103 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:22:18,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:22:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 03:22:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:22:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-04 03:22:18,105 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-02-04 03:22:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:18,105 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-04 03:22:18,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-04 03:22:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:22:18,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:18,106 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:18,106 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash -705625136, now seen corresponding path program 1 times [2018-02-04 03:22:18,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:18,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:22:18,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:18,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:18,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:18,137 INFO L182 omatonBuilderFactory]: Interpolants [4197#true, 4198#false, 4199#(<= 3 |f19_#res|), 4200#(<= 3 |probe_19_#t~ret10|), 4201#(<= 3 probe_19_~ret~0)] [2018-02-04 03:22:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:22:18,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:22:18,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:22:18,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:22:18,138 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2018-02-04 03:22:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:18,156 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 03:22:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:22:18,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-04 03:22:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:18,157 INFO L225 Difference]: With dead ends: 92 [2018-02-04 03:22:18,157 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 03:22:18,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 03:22:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-02-04 03:22:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:22:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-04 03:22:18,159 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-02-04 03:22:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:18,159 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-04 03:22:18,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:22:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-04 03:22:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:22:18,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:18,160 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:18,160 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018930, now seen corresponding path program 1 times [2018-02-04 03:22:18,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:18,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:18,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:18,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:22:18,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:18,216 INFO L182 omatonBuilderFactory]: Interpolants [4384#true, 4385#false, 4386#(= f19_~a.base |f19_#in~a.base|), 4387#(and (= 1 (select |#valid| f19_~a.base)) (= f19_~a.base |f19_#in~a.base|)), 4388#(= 1 (select |#valid| |f19_#in~a.base|)), 4389#(= 1 (select |#valid| probe_19_~a.base)), 4390#(= 1 (select |#valid| |f19_undo_#in~a.base|)), 4391#(= 1 (select |#valid| f19_undo_~a.base))] [2018-02-04 03:22:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:18,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:22:18,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:22:18,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:18,217 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-02-04 03:22:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:18,299 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-04 03:22:18,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:22:18,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 03:22:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:18,300 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:22:18,300 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:22:18,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:22:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:22:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-02-04 03:22:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:22:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-04 03:22:18,302 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2018-02-04 03:22:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:18,303 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-04 03:22:18,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:22:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-04 03:22:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:22:18,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:18,304 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:18,304 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018931, now seen corresponding path program 1 times [2018-02-04 03:22:18,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:18,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:18,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:18,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:22:18,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:18,409 INFO L182 omatonBuilderFactory]: Interpolants [4580#true, 4581#false, 4582#(= 0 |entry_point_~#a19~0.offset|), 4583#(= 0 |probe_19_#in~a.offset|), 4584#(= 0 probe_19_~a.offset), 4585#(and (or (not (= f19_~a.offset 0)) (= f19_~a.base |f19_#in~a.base|)) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset))), 4586#(and (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (or (and (<= (+ f19_~a.offset 4) (select |#length| f19_~a.base)) (= f19_~a.base |f19_#in~a.base|)) (not (= f19_~a.offset 0)))), 4587#(or (not (= |f19_#in~a.offset| 0)) (<= 4 (select |#length| |f19_#in~a.base|))), 4588#(and (<= 4 (select |#length| probe_19_~a.base)) (= 0 probe_19_~a.offset)), 4589#(and (= 0 |f19_undo_#in~a.offset|) (<= 4 (select |#length| |f19_undo_#in~a.base|))), 4590#(and (<= 4 (select |#length| f19_undo_~a.base)) (= f19_undo_~a.offset 0))] [2018-02-04 03:22:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:18,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:22:18,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:22:18,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:22:18,410 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-02-04 03:22:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:18,537 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-04 03:22:18,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:22:18,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-04 03:22:18,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:18,538 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:22:18,538 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:22:18,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:22:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:22:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 03:22:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:22:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-04 03:22:18,541 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2018-02-04 03:22:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:18,541 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-04 03:22:18,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:22:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-04 03:22:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:22:18,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:18,542 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:18,542 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash 529881151, now seen corresponding path program 1 times [2018-02-04 03:22:18,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:18,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:18,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:18,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:22:18,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:18,626 INFO L182 omatonBuilderFactory]: Interpolants [4787#true, 4788#false, 4789#(and (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 4790#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4791#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4792#(and (= 1 (select |#valid| |f19_#t~ret2.base|)) (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 4793#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))), 4794#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset))), 4795#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|))), 4796#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| f19_undo_~a.base) f19_undo_~a.offset))), 4797#(= 1 (select |#valid| |f19_undo_#t~mem5.base|))] [2018-02-04 03:22:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:18,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:22:18,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:22:18,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:22:18,627 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 11 states. [2018-02-04 03:22:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:18,787 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-04 03:22:18,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:22:18,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 03:22:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:18,788 INFO L225 Difference]: With dead ends: 97 [2018-02-04 03:22:18,788 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 03:22:18,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:22:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 03:22:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-02-04 03:22:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:22:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-02-04 03:22:18,791 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2018-02-04 03:22:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:18,792 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-02-04 03:22:18,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:22:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-02-04 03:22:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:22:18,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:18,792 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:18,792 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash 529881150, now seen corresponding path program 1 times [2018-02-04 03:22:18,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:18,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:18,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:18,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:22:18,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:18,880 INFO L182 omatonBuilderFactory]: Interpolants [5008#(= 0 (select (select |#memory_$Pointer$.offset| f19_undo_~a.base) f19_undo_~a.offset)), 5009#(= |f19_undo_#t~mem5.offset| 0), 4999#true, 5000#false, 5001#(and (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 5002#(= 0 |ldv_malloc_#t~malloc1.offset|), 5003#(= 0 |ldv_malloc_#res.offset|), 5004#(and (= 0 |f19_#t~ret2.offset|) (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 5005#(= 0 (select (select |#memory_$Pointer$.offset| |f19_#in~a.base|) |f19_#in~a.offset|)), 5006#(= 0 (select (select |#memory_$Pointer$.offset| probe_19_~a.base) probe_19_~a.offset)), 5007#(= 0 (select (select |#memory_$Pointer$.offset| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|))] [2018-02-04 03:22:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:18,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:22:18,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:22:18,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:22:18,881 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 11 states. [2018-02-04 03:22:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:18,970 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-04 03:22:18,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:22:18,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 03:22:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:18,972 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:22:18,972 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:22:18,972 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:22:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:22:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 03:22:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:22:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-04 03:22:18,975 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 47 [2018-02-04 03:22:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:18,975 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-04 03:22:18,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:22:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-04 03:22:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:22:18,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:18,976 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:18,976 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash 365897592, now seen corresponding path program 1 times [2018-02-04 03:22:18,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:18,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:19,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:19,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:22:19,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:19,341 INFO L182 omatonBuilderFactory]: Interpolants [5216#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.base |probe_19_#in~a.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))), 5217#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 5218#(and (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 5219#(and (= 1 (select |#valid| f19_~a.base)) (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= f19_~a.base |f19_#in~a.base|)), 5220#(and (= 1 (select |#valid| |f19_#in~a.base|)) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (or (not (= |f19_#in~a.offset| 0)) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0))), 5221#(or (and (or (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.offset 0)) (not (= |probe_19_#in~a.offset| 0))) (and (= 1 (select |#valid| |probe_19_#in~a.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))))), 5222#(or (not (= |probe_19_#in~a.offset| 0)) (= 0 (select |old(#valid)| |probe_19_#in~a.base|)) (and (not (= 0 |probe_19_#t~mem12.base|)) (= 1 (select (store |#valid| |probe_19_#t~mem12.base| 0) |probe_19_#in~a.base|)))), 5223#(or (= 1 (select |#valid| |probe_19_#in~a.base|)) (not (= |probe_19_#in~a.offset| 0)) (= 0 (select |old(#valid)| |probe_19_#in~a.base|))), 5224#(= 1 (select |#valid| |entry_point_~#a19~0.base|)), 5225#(= 1 (select |#valid| |disconnect_19_#in~a.base|)), 5226#(= (select |#valid| disconnect_19_~a.base) 1), 5208#true, 5209#false, 5210#(and (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1)), 5211#(= |#valid| |old(#valid)|), 5212#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= |#valid| |old(#valid)|) (= probe_19_~a.base |probe_19_#in~a.base|)), 5213#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 5214#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 5215#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= 0 (select |old(#valid)| |probe_19_#t~ret7.base|)) (= probe_19_~a.base |probe_19_#in~a.base|) (not (= 0 |probe_19_#t~ret7.base|)))] [2018-02-04 03:22:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:19,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:22:19,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:22:19,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:22:19,342 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 19 states. [2018-02-04 03:22:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:19,863 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-02-04 03:22:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:22:19,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-02-04 03:22:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:19,864 INFO L225 Difference]: With dead ends: 110 [2018-02-04 03:22:19,864 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 03:22:19,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:22:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 03:22:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-02-04 03:22:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 03:22:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-02-04 03:22:19,867 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 46 [2018-02-04 03:22:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:19,868 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-02-04 03:22:19,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:22:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-02-04 03:22:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:22:19,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:19,868 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:19,868 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:19,868 INFO L82 PathProgramCache]: Analyzing trace with hash 365897593, now seen corresponding path program 1 times [2018-02-04 03:22:19,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:19,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:22:19,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:19,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:22:19,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:19,948 INFO L182 omatonBuilderFactory]: Interpolants [5472#true, 5473#false, 5474#(= 0 |entry_point_~#a19~0.offset|), 5475#(and (or (not (= probe_19_~a.offset 0)) (= probe_19_~a.base |probe_19_#in~a.base|)) (or (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.offset 0))), 5476#(= f19_~a.base |f19_#in~a.base|), 5477#(and (or (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.offset 0)) (or (<= (select |#length| probe_19_~a.base) (select |#length| |probe_19_#in~a.base|)) (not (= probe_19_~a.offset 0)))), 5478#(or (not (= |probe_19_#in~a.offset| 0)) (<= 8 (select |#length| |probe_19_#in~a.base|))), 5479#(and (= 0 |entry_point_~#a19~0.offset|) (<= 8 (select |#length| |entry_point_~#a19~0.base|))), 5480#(and (= 0 |disconnect_19_#in~a.offset|) (<= 8 (select |#length| |disconnect_19_#in~a.base|))), 5481#(and (= disconnect_19_~a.offset 0) (<= 8 (select |#length| disconnect_19_~a.base)))] [2018-02-04 03:22:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:22:19,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:22:19,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:22:19,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:22:19,949 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 10 states. [2018-02-04 03:22:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:20,051 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-02-04 03:22:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:22:20,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-02-04 03:22:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:20,052 INFO L225 Difference]: With dead ends: 119 [2018-02-04 03:22:20,052 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:22:20,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:22:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:22:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-02-04 03:22:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 03:22:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-02-04 03:22:20,055 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 46 [2018-02-04 03:22:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:20,055 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-02-04 03:22:20,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:22:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-02-04 03:22:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:22:20,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:20,056 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:20,056 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1542076562, now seen corresponding path program 1 times [2018-02-04 03:22:20,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:20,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:22:20,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:20,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:22:20,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:20,110 INFO L182 omatonBuilderFactory]: Interpolants [5720#true, 5721#false, 5722#(<= 3 |f19_#res|), 5723#(<= 3 |probe_19_#t~ret10|), 5724#(<= 3 probe_19_~ret~0), 5725#(<= 3 |probe_19_#res|), 5726#(<= 3 |entry_point_#t~ret14|), 5727#(<= 3 entry_point_~ret~1)] [2018-02-04 03:22:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:22:20,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:22:20,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:22:20,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:20,111 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 8 states. [2018-02-04 03:22:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:20,145 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-02-04 03:22:20,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:22:20,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-04 03:22:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:20,146 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:22:20,146 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:22:20,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:22:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:22:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 03:22:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:22:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-04 03:22:20,150 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 47 [2018-02-04 03:22:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:20,150 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-04 03:22:20,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:22:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-04 03:22:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:22:20,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:20,151 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:20,151 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1831313542, now seen corresponding path program 1 times [2018-02-04 03:22:20,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:20,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:20,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:20,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 03:22:20,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:20,360 INFO L182 omatonBuilderFactory]: Interpolants [5960#true, 5961#false, 5962#(= 0 |entry_point_~#a19~0.offset|), 5963#(and (or (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.offset 0)) (or (not (= probe_19_~a.offset 0)) (= |probe_19_#in~a.base| probe_19_~a.base))), 5964#(and (or (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.offset 0)) (or (and (<= (+ probe_19_~a.offset 8) (select |#length| probe_19_~a.base)) (= |probe_19_#in~a.base| probe_19_~a.base)) (not (= probe_19_~a.offset 0))) (= (select |#valid| probe_19_~a.base) 1)), 5965#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5966#(and (= (select |old(#length)| f19_~a.base) (select |#length| f19_~a.base)) (= |#valid| |old(#valid)|) (= f19_~a.base |f19_#in~a.base|)), 5967#(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|))), 5968#(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|))))), 5969#(and (or (= 0 (select |old(#valid)| f19_~a.base)) (= (select |old(#length)| f19_~a.base) (select |#length| f19_~a.base))) (= f19_~a.base |f19_#in~a.base|)), 5970#(or (= 0 (select |old(#valid)| |f19_#in~a.base|)) (<= (select |old(#length)| |f19_#in~a.base|) (select |#length| |f19_#in~a.base|))), 5971#(or (not (= |probe_19_#in~a.offset| 0)) (<= 8 (select |#length| |probe_19_#in~a.base|))), 5972#(and (= 0 |entry_point_~#a19~0.offset|) (<= 8 (select |#length| |entry_point_~#a19~0.base|))), 5973#(and (= 0 |disconnect_19_#in~a.offset|) (<= 8 (select |#length| |disconnect_19_#in~a.base|))), 5974#(and (= disconnect_19_~a.offset 0) (<= 8 (select |#length| disconnect_19_~a.base)))] [2018-02-04 03:22:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:20,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:22:20,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:22:20,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:22:20,361 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 15 states. [2018-02-04 03:22:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:20,701 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-02-04 03:22:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:22:20,701 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-02-04 03:22:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:20,702 INFO L225 Difference]: With dead ends: 111 [2018-02-04 03:22:20,702 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 03:22:20,702 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:22:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 03:22:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 03:22:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 03:22:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-02-04 03:22:20,704 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 50 [2018-02-04 03:22:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:20,704 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-02-04 03:22:20,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:22:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-02-04 03:22:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:22:20,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:20,705 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:20,705 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -522729561, now seen corresponding path program 1 times [2018-02-04 03:22:20,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:20,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:21,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:21,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:22:21,152 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:21,152 INFO L182 omatonBuilderFactory]: Interpolants [6221#true, 6222#false, 6223#(= |#valid| |old(#valid)|), 6224#(and (= 0 (select |old(#valid)| |entry_point_~#a19~0.base|)) (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1) (= |old(#valid)| (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)))), 6225#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= |#valid| |old(#valid)|)), 6226#(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|))), 6227#(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|))), 6228#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= 0 (select |old(#valid)| |probe_19_#t~ret7.base|)) (= |old(#valid)| (store |#valid| |probe_19_#t~ret7.base| (select |old(#valid)| |probe_19_#t~ret7.base|))) (not (= 0 |probe_19_#t~ret7.base|))), 6229#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= (store |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))), 6230#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6231#(and (= |#valid| |old(#valid)|) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 6232#(and (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (= |#valid| |old(#valid)|) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= f19_~a.base |f19_#in~a.base|)), 6233#(and (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (or (not (= |f19_#in~a.offset| 0)) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0))), 6234#(or (and (or (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.offset 0)) (not (= |probe_19_#in~a.offset| 0))) (and (= (store |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))))), 6235#(or (and (not (= 0 |probe_19_#t~mem12.base|)) (= 0 (select |old(#valid)| |probe_19_#t~mem12.base|)) (= (store |#valid| |probe_19_#t~mem12.base| (select |old(#valid)| |probe_19_#t~mem12.base|)) |old(#valid)|)) (not (= |probe_19_#in~a.offset| 0))), 6236#(or (= |#valid| |old(#valid)|) (not (= |probe_19_#in~a.offset| 0))), 6237#(and (= (select (store |#valid| |entry_point_~#a19~0.base| 0) (@diff (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)) |old(#valid)|))) (= (select (store |#valid| |entry_point_~#a19~0.base| 0) |entry_point_~#a19~0.base|) (select |old(#valid)| |entry_point_~#a19~0.base|)))] [2018-02-04 03:22:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:22:21,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:22:21,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:22:21,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:22:21,153 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 17 states. [2018-02-04 03:22:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:21,505 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-02-04 03:22:21,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:22:21,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-04 03:22:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:21,506 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:22:21,506 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 03:22:21,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:22:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 03:22:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 03:22:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:22:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-02-04 03:22:21,509 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 48 [2018-02-04 03:22:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:21,509 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-02-04 03:22:21,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:22:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-02-04 03:22:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:22:21,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:21,510 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:21,510 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash 680328992, now seen corresponding path program 1 times [2018-02-04 03:22:21,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:21,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:21,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:21,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 03:22:21,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:21,665 INFO L182 omatonBuilderFactory]: Interpolants [6464#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 6465#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 6466#(and (= f19_~a.offset |f19_#in~a.offset|) (= 0 (select |old(#valid)| |f19_#t~ret2.base|)) (not (= 0 |f19_#t~ret2.base|)) (= f19_~a.base |f19_#in~a.base|)), 6467#(and (not (= 0 (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|)))), 6468#(and (not (= probe_19_~a.base (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset)))), 6469#(and (= f19_undo_~a.base |f19_undo_#in~a.base|) (= f19_undo_~a.offset |f19_undo_#in~a.offset|)), 6470#(and (= (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) |f19_undo_#t~mem5.base|) (or (= 1 (select (store |#valid| |f19_undo_#t~mem5.base| 0) |f19_undo_#in~a.base|)) (= |f19_undo_#t~mem5.base| |f19_undo_#in~a.base|))), 6471#(or (= 1 (select |#valid| |f19_undo_#in~a.base|)) (= 0 (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|)) (and (= (select |#valid| |f19_undo_#in~a.base|) 0) (= (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) |f19_undo_#in~a.base|))), 6459#true, 6460#false, 6461#(= 1 (select |#valid| probe_19_~a.base)), 6462#(= |#valid| |old(#valid)|), 6463#(and (= |#valid| |old(#valid)|) (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|))] [2018-02-04 03:22:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:21,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:22:21,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:22:21,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:22:21,665 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 13 states. [2018-02-04 03:22:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:21,934 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-02-04 03:22:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:22:21,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-02-04 03:22:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:21,935 INFO L225 Difference]: With dead ends: 92 [2018-02-04 03:22:21,935 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 03:22:21,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:22:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 03:22:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 03:22:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 03:22:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-02-04 03:22:21,938 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 51 [2018-02-04 03:22:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:21,938 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-02-04 03:22:21,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:22:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-02-04 03:22:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:22:21,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:21,938 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:21,938 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash -936145011, now seen corresponding path program 1 times [2018-02-04 03:22:21,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:21,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:22:22,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:22,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:22:22,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:22:22,376 INFO L182 omatonBuilderFactory]: Interpolants [6670#true, 6671#false, 6672#(= 0 |entry_point_~#a19~0.offset|), 6673#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (not (= probe_19_~a.offset 0)) (= |probe_19_#in~a.base| probe_19_~a.base))), 6674#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 6675#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#t~malloc1.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 6676#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#res.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 6677#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (not (= probe_19_~a.offset 0)) (and (= |probe_19_#in~a.base| probe_19_~a.base) (= 0 |probe_19_#t~ret7.offset|)))), 6678#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (not (= probe_19_~a.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| probe_19_~a.base) (+ probe_19_~a.offset 4))) (= |probe_19_#in~a.base| probe_19_~a.base)))), 6679#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 6680#(and (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= f19_~a.base |f19_#in~a.base|)), 6681#(and (= (select |#memory_$Pointer$.offset| f19_~a.base) (store (select |old(#memory_$Pointer$.offset)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.offset| f19_~a.base) f19_~a.offset))) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= f19_~a.base |f19_#in~a.base|)), 6682#(or (not (= |f19_#in~a.offset| 0)) (and (= (store (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.offset| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)))) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |f19_#in~a.base|) (select |#memory_$Pointer$.offset| |f19_#in~a.base|)) 0)))), 6683#(or (not (= |probe_19_#in~a.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |probe_19_#in~a.base|) 4))), 6684#(and (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a19~0.base|) 4)) (= 0 |entry_point_~#a19~0.offset|)), 6685#(and (= 0 (select (select |#memory_$Pointer$.offset| |disconnect_19_#in~a.base|) 4)) (= 0 |disconnect_19_#in~a.offset|)), 6686#(and (= disconnect_19_~a.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4)))), 6687#(= |disconnect_19_#t~mem13.offset| 0)] [2018-02-04 03:22:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:22:22,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:22:22,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:22:22,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:22:22,377 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 18 states. [2018-02-04 03:22:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:22,720 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 03:22:22,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:22:22,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-02-04 03:22:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:22,721 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:22:22,721 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:22:22,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:22:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:22:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-04 03:22:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:22:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-02-04 03:22:22,723 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 51 [2018-02-04 03:22:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:22,724 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-02-04 03:22:22,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:22:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-02-04 03:22:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:22:22,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:22,724 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:22,724 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:22,724 INFO L82 PathProgramCache]: Analyzing trace with hash -936145010, now seen corresponding path program 1 times [2018-02-04 03:22:22,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:22,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:23,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:23,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:22:23,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:23,270 INFO L182 omatonBuilderFactory]: Interpolants [6890#true, 6891#false, 6892#(= 0 |entry_point_~#a19~0.offset|), 6893#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (not (= probe_19_~a.offset 0)) (= probe_19_~a.base |probe_19_#in~a.base|))), 6894#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 6895#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 6896#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 6897#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (<= 1 probe_19_~a.offset) (<= (+ probe_19_~a.offset 1) 0) (and (= probe_19_~a.base |probe_19_#in~a.base|) (= (select |#valid| |probe_19_#t~ret7.base|) 1)))), 6898#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (<= 1 probe_19_~a.offset) (<= (+ probe_19_~a.offset 1) 0) (and (= probe_19_~a.base |probe_19_#in~a.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))))), 6899#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6900#(and (= |#valid| |old(#valid)|) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 6901#(= |#valid| |old(#valid)|), 6902#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 6903#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6904#(and (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))) (= f19_~a.base |f19_#in~a.base|)), 6905#(and (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))) (= f19_~a.base |f19_#in~a.base|)), 6906#(and (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (not (= |f19_#in~a.offset| 0)) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6907#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) 4))) (not (= |probe_19_#in~a.offset| 0))), 6908#(and (= 0 |entry_point_~#a19~0.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4)))), 6909#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) 4))) (= 0 |disconnect_19_#in~a.offset|)), 6910#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4)))) (= disconnect_19_~a.offset 0)), 6911#(= 1 (select |#valid| |disconnect_19_#t~mem13.base|))] [2018-02-04 03:22:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:23,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:22:23,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:22:23,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:22:23,271 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 22 states. [2018-02-04 03:22:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:23,905 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 03:22:23,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:22:23,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-02-04 03:22:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:23,906 INFO L225 Difference]: With dead ends: 92 [2018-02-04 03:22:23,906 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 03:22:23,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:22:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 03:22:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-02-04 03:22:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:22:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-02-04 03:22:23,908 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 51 [2018-02-04 03:22:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:23,908 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-02-04 03:22:23,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:22:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-02-04 03:22:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:22:23,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:23,909 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:23,909 INFO L371 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -384637660, now seen corresponding path program 1 times [2018-02-04 03:22:23,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:23,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:24,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:24,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:22:24,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:24,446 INFO L182 omatonBuilderFactory]: Interpolants [7136#(and (= (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) |f19_undo_#t~mem5.base|) (= |#valid| |old(#valid)|)), 7137#(or (and (or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|))), 7138#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))), 7139#(= 1 (select |#valid| |probe_19_#t~mem12.base|)), 7117#true, 7118#false, 7119#(= 0 |entry_point_~#a19~0.offset|), 7120#(= 0 |probe_19_#in~a.offset|), 7121#(= 0 probe_19_~a.offset), 7122#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 7123#(= (select |#valid| |ldv_malloc_#res.base|) 1), 7124#(and (= (select |#valid| |probe_19_#t~ret7.base|) 1) (= 0 probe_19_~a.offset)), 7125#(and (= 0 probe_19_~a.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))), 7126#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7127#(and (= |#valid| |old(#valid)|) (= f19_~a.offset |f19_#in~a.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 7128#(= |#valid| |old(#valid)|), 7129#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 7130#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 7131#(and (= f19_~a.offset |f19_#in~a.offset|) (or (= |f19_#t~ret2.base| (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |f19_#t~ret2.base|)) (not (= 0 |f19_#t~ret2.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))) (= f19_~a.base |f19_#in~a.base|)), 7132#(and (or (= (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|) (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))) (= f19_~a.base |f19_#in~a.base|)), 7133#(and (or (= (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|) (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (not (= 0 (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (or (not (= |f19_#in~a.offset| 0)) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 7134#(and (not (= (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)) (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))), 7135#(and (= |#valid| |old(#valid)|) (= f19_undo_~a.base |f19_undo_#in~a.base|) (= f19_undo_~a.offset |f19_undo_#in~a.offset|))] [2018-02-04 03:22:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:24,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:22:24,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:22:24,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:22:24,447 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 23 states. [2018-02-04 03:22:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:24,960 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 03:22:24,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:22:24,960 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-04 03:22:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:24,960 INFO L225 Difference]: With dead ends: 90 [2018-02-04 03:22:24,960 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 03:22:24,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:22:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 03:22:24,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-04 03:22:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:22:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-02-04 03:22:24,963 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 52 [2018-02-04 03:22:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:24,964 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-02-04 03:22:24,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:22:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-02-04 03:22:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:22:24,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:24,964 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:24,964 INFO L371 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1081279336, now seen corresponding path program 1 times [2018-02-04 03:22:24,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:24,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:24,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:24,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:24,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:24,997 INFO L182 omatonBuilderFactory]: Interpolants [7344#true, 7345#false, 7346#(= 0 |probe_19_#res|), 7347#(= 0 |entry_point_#t~ret14|), 7348#(= entry_point_~ret~1 0)] [2018-02-04 03:22:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:24,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:22:24,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:22:24,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:22:24,998 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 5 states. [2018-02-04 03:22:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:25,005 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-04 03:22:25,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:22:25,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-04 03:22:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:25,006 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:22:25,006 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:22:25,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:22:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:22:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-02-04 03:22:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:22:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-04 03:22:25,008 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 52 [2018-02-04 03:22:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:25,008 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-04 03:22:25,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:22:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-04 03:22:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:22:25,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:25,009 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:25,009 INFO L371 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562575, now seen corresponding path program 1 times [2018-02-04 03:22:25,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:25,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:25,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:25,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:22:25,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:25,442 INFO L182 omatonBuilderFactory]: Interpolants [7552#(= 1 (select |#valid| disconnect_19_~a.base)), 7553#(= 1 (select |#valid| |f19_undo_#in~a.base|)), 7554#(= 1 (select |#valid| f19_undo_~a.base)), 7533#true, 7534#false, 7535#(and (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1)), 7536#(= |#valid| |old(#valid)|), 7537#(and (or (not (= probe_19_~a.offset 0)) (and (= |#valid| |old(#valid)|) (= probe_19_~a.base |probe_19_#in~a.base|))) (= |probe_19_#in~a.offset| probe_19_~a.offset)), 7538#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (= |#valid| |old(#valid)|)))), 7539#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7540#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7541#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (and (= 0 (select |old(#valid)| |probe_19_#t~ret7.base|)) (= probe_19_~a.base |probe_19_#in~a.base|)) (not (= probe_19_~a.offset 0)))), 7542#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (and (= probe_19_~a.base |probe_19_#in~a.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))) (not (= probe_19_~a.offset 0)))), 7543#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 7544#(and (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 7545#(and (= 1 (select |#valid| f19_~a.base)) (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (or (= f19_~a.offset 0) (= |f19_#in~a.offset| f19_~a.offset)) (= f19_~a.base |f19_#in~a.base|)), 7546#(and (= 1 (select |#valid| |f19_#in~a.base|)) (or (not (= |f19_#in~a.offset| 0)) (and (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (or (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0))))), 7547#(or (not (= |probe_19_#in~a.offset| 0)) (and (= 1 (select |#valid| |probe_19_#in~a.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) 4))))), 7548#(and (not (= |entry_point_~#a19~0.base| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4))) (= 0 |entry_point_~#a19~0.offset|) (= 1 (select |#valid| |entry_point_~#a19~0.base|))), 7549#(and (= 1 (select |#valid| |disconnect_19_#in~a.base|)) (not (= |disconnect_19_#in~a.base| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) 4))) (= 0 |disconnect_19_#in~a.offset|)), 7550#(and (= disconnect_19_~a.offset 0) (= 1 (select |#valid| disconnect_19_~a.base)) (not (= disconnect_19_~a.base (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4))))), 7551#(and (= 1 (select |#valid| disconnect_19_~a.base)) (not (= disconnect_19_~a.base |disconnect_19_#t~mem13.base|)))] [2018-02-04 03:22:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:25,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:22:25,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:22:25,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:22:25,442 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 22 states. [2018-02-04 03:22:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:26,213 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-04 03:22:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:22:26,213 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-02-04 03:22:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:26,214 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:22:26,214 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:22:26,214 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:22:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:22:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-02-04 03:22:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 03:22:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-04 03:22:26,216 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 55 [2018-02-04 03:22:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:26,216 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-04 03:22:26,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:22:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-04 03:22:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:22:26,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:26,217 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:26,217 INFO L371 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562576, now seen corresponding path program 1 times [2018-02-04 03:22:26,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:26,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:26,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:26,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:22:26,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:26,275 INFO L182 omatonBuilderFactory]: Interpolants [7784#true, 7785#false, 7786#(= 0 |entry_point_~#a19~0.offset|), 7787#(= 0 |disconnect_19_#in~a.offset|), 7788#(= 0 disconnect_19_~a.offset), 7789#(and (= 0 disconnect_19_~a.offset) (<= (+ disconnect_19_~a.offset 8) (select |#length| disconnect_19_~a.base))), 7790#(and (<= 8 (select |#length| |f19_undo_#in~a.base|)) (= 0 |f19_undo_#in~a.offset|)), 7791#(and (<= 8 (select |#length| f19_undo_~a.base)) (= f19_undo_~a.offset 0))] [2018-02-04 03:22:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:26,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:22:26,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:22:26,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:26,275 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 8 states. [2018-02-04 03:22:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:26,324 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-04 03:22:26,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:22:26,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-04 03:22:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:26,325 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:22:26,325 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:22:26,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:22:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:22:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-04 03:22:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:22:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-04 03:22:26,327 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 55 [2018-02-04 03:22:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:26,327 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-04 03:22:26,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:22:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-04 03:22:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:22:26,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:26,328 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:26,328 INFO L371 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799554, now seen corresponding path program 1 times [2018-02-04 03:22:26,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:26,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:26,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:26,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:22:26,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:26,896 INFO L182 omatonBuilderFactory]: Interpolants [8000#(and (= disconnect_19_~a.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) disconnect_19_~a.offset))) (not (= (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4)) (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) disconnect_19_~a.offset)))), 8001#(and (= disconnect_19_~a.offset 0) (= 1 (select (store |#valid| |disconnect_19_#t~mem13.base| 0) (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) disconnect_19_~a.offset)))), 8002#(and (= disconnect_19_~a.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) disconnect_19_~a.offset)))), 8003#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|))), 8004#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| f19_undo_~a.base) f19_undo_~a.offset))), 8005#(= 1 (select |#valid| |f19_undo_#t~mem5.base|)), 7980#true, 7981#false, 7982#(= 0 |entry_point_~#a19~0.offset|), 7983#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (not (= probe_19_~a.offset 0)) (= probe_19_~a.base |probe_19_#in~a.base|))), 7984#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 7985#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7986#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7987#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (not (= probe_19_~a.offset 0)) (and (= 1 (select |#valid| |probe_19_#t~ret7.base|)) (= probe_19_~a.base |probe_19_#in~a.base|)))), 7988#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (not (= probe_19_~a.offset 0)) (and (= probe_19_~a.base |probe_19_#in~a.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))))), 7989#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7990#(and (= |#valid| |old(#valid)|) (= f19_~a.offset |f19_#in~a.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 7991#(= |#valid| |old(#valid)|), 7992#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 7993#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 7994#(and (= 1 (select |#valid| |f19_#t~ret2.base|)) (= f19_~a.offset |f19_#in~a.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |f19_#t~ret2.base|)) (= f19_~a.base |f19_#in~a.base|)), 7995#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (= f19_~a.offset |f19_#in~a.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (= f19_~a.base |f19_#in~a.base|)), 7996#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (or (not (= |f19_#in~a.offset| 0)) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0))), 7997#(or (and (not (= (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) 4) (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) |probe_19_#in~a.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) |probe_19_#in~a.offset|)))) (not (= |probe_19_#in~a.offset| 0))), 7998#(and (not (= (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4) (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|))) (= 0 |entry_point_~#a19~0.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|)))), 7999#(and (not (= (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) 4) (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|))) (= 0 |disconnect_19_#in~a.offset|))] [2018-02-04 03:22:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:26,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:22:26,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:22:26,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:22:26,897 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 26 states. [2018-02-04 03:22:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:27,495 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-04 03:22:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:22:27,496 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-02-04 03:22:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:27,496 INFO L225 Difference]: With dead ends: 93 [2018-02-04 03:22:27,496 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 03:22:27,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:22:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 03:22:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-02-04 03:22:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 03:22:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-04 03:22:27,498 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 56 [2018-02-04 03:22:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:27,498 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-04 03:22:27,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:22:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-04 03:22:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:22:27,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:27,498 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:27,498 INFO L371 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799553, now seen corresponding path program 1 times [2018-02-04 03:22:27,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:27,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:27,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:27,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 03:22:27,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:27,724 INFO L182 omatonBuilderFactory]: Interpolants [8224#(= 0 (select (select |#memory_$Pointer$.offset| |f19_#in~a.base|) |f19_#in~a.offset|)), 8225#(= 0 (select (select |#memory_$Pointer$.offset| |probe_19_#in~a.base|) |probe_19_#in~a.offset|)), 8226#(= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|)), 8227#(= 0 (select (select |#memory_$Pointer$.offset| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|)), 8228#(= 0 (select (select |#memory_$Pointer$.offset| disconnect_19_~a.base) disconnect_19_~a.offset)), 8229#(= 0 (select (select |#memory_$Pointer$.offset| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|)), 8230#(= 0 (select (select |#memory_$Pointer$.offset| f19_undo_~a.base) f19_undo_~a.offset)), 8231#(= |f19_undo_#t~mem5.offset| 0), 8217#true, 8218#false, 8219#(and (= probe_19_~a.offset |probe_19_#in~a.offset|) (= probe_19_~a.base |probe_19_#in~a.base|)), 8220#(and (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 8221#(= 0 |ldv_malloc_#t~malloc1.offset|), 8222#(= 0 |ldv_malloc_#res.offset|), 8223#(and (= 0 |f19_#t~ret2.offset|) (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|))] [2018-02-04 03:22:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:27,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:22:27,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:22:27,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:22:27,724 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 15 states. [2018-02-04 03:22:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:27,885 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-04 03:22:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:22:27,885 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 03:22:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:27,885 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:22:27,885 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:22:27,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:22:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:22:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-04 03:22:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:22:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-04 03:22:27,887 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 56 [2018-02-04 03:22:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:27,887 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-04 03:22:27,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:22:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-04 03:22:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:22:27,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:27,888 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:27,888 INFO L371 AbstractCegarLoop]: === Iteration 39 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:27,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1384633629, now seen corresponding path program 1 times [2018-02-04 03:22:27,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:27,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:27,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:27,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:22:27,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:27,922 INFO L182 omatonBuilderFactory]: Interpolants [8432#(<= (+ |entry_point_#t~ret14| 1) 0), 8433#(<= (+ entry_point_~ret~1 1) 0), 8428#true, 8429#false, 8430#(<= (+ probe_19_~ret~0 1) 0), 8431#(<= (+ |probe_19_#res| 1) 0)] [2018-02-04 03:22:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:22:27,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:27,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:27,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:27,922 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 6 states. [2018-02-04 03:22:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:27,934 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-02-04 03:22:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:22:27,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-04 03:22:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:27,934 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:22:27,934 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:22:27,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:22:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:22:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-02-04 03:22:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 03:22:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-04 03:22:27,936 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 61 [2018-02-04 03:22:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:27,936 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-04 03:22:27,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-04 03:22:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 03:22:27,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:27,936 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:27,936 INFO L371 AbstractCegarLoop]: === Iteration 40 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash 843947090, now seen corresponding path program 1 times [2018-02-04 03:22:27,937 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:27,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:29,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:29,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:22:29,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:29,092 INFO L182 omatonBuilderFactory]: Interpolants [8608#(and (or (and (or (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.offset 0)) (not (= |probe_19_#in~a.offset| 0))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset))) (= probe_19_~a.base |probe_19_#in~a.base|) (not (= (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)) (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset))) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset))) (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) probe_19_~a.offset)))), 8609#(and (= |#valid| |old(#valid)|) (= f19_undo_~a.base |f19_undo_#in~a.base|) (= f19_undo_~a.offset |f19_undo_#in~a.offset|)), 8610#(and (= (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) |f19_undo_#t~mem5.base|) (= |#valid| |old(#valid)|)), 8611#(or (= 0 (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|)) (and (= (store |#valid| (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|))) |old(#valid)|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|)) 0))), 8612#(or (and (or (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.offset 0)) (not (= |probe_19_#in~a.offset| 0))) (and (= (store |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))))), 8613#(or (and (not (= 0 |probe_19_#t~mem12.base|)) (= 0 (select |old(#valid)| |probe_19_#t~mem12.base|)) (= (store |#valid| |probe_19_#t~mem12.base| (select |old(#valid)| |probe_19_#t~mem12.base|)) |old(#valid)|)) (not (= |probe_19_#in~a.offset| 0))), 8614#(or (= |#valid| |old(#valid)|) (not (= |probe_19_#in~a.offset| 0))), 8615#(and (= (select (store |#valid| |entry_point_~#a19~0.base| 0) (@diff (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)) |old(#valid)|))) (= (select (store |#valid| |entry_point_~#a19~0.base| 0) |entry_point_~#a19~0.base|) (select |old(#valid)| |entry_point_~#a19~0.base|))), 8592#true, 8593#false, 8594#(= |#valid| |old(#valid)|), 8595#(and (= 0 (select |old(#valid)| |entry_point_~#a19~0.base|)) (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1) (= |old(#valid)| (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)))), 8596#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= |#valid| |old(#valid)|) (= probe_19_~a.base |probe_19_#in~a.base|)), 8597#(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|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 8598#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 8599#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= 0 (select |old(#valid)| |probe_19_#t~ret7.base|)) (= probe_19_~a.base |probe_19_#in~a.base|) (not (= 0 |probe_19_#t~ret7.base|)) (= (select |#valid| |probe_19_#t~ret7.base|) 1) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)), 8600#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (= probe_19_~a.base |probe_19_#in~a.base|) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))), 8601#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 8602#(and (= |#valid| |old(#valid)|) (= f19_~a.offset |f19_#in~a.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 8603#(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|))), 8604#(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|))), 8605#(and (= f19_~a.offset |f19_#in~a.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (store |#valid| |f19_#t~ret2.base| (select |old(#valid)| |f19_#t~ret2.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |f19_#t~ret2.base|)) (not (= 0 |f19_#t~ret2.base|)) (= f19_~a.base |f19_#in~a.base|)), 8606#(and (= (store |#valid| (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) |old(#valid)|) (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (= f19_~a.offset |f19_#in~a.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= f19_~a.base |f19_#in~a.base|)), 8607#(and (not (= 0 (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= (store |#valid| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) |old(#valid)|) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (or (not (= |f19_#in~a.offset| 0)) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0)))] [2018-02-04 03:22:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:22:29,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:22:29,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:22:29,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:22:29,093 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 24 states. [2018-02-04 03:22:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:29,749 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-02-04 03:22:29,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:22:29,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-02-04 03:22:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:29,750 INFO L225 Difference]: With dead ends: 81 [2018-02-04 03:22:29,750 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 03:22:29,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:22:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 03:22:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 03:22:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 03:22:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-02-04 03:22:29,752 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 63 [2018-02-04 03:22:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:29,752 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-02-04 03:22:29,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:22:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-02-04 03:22:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 03:22:29,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:29,753 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:29,754 INFO L371 AbstractCegarLoop]: === Iteration 41 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation, probe_19Err4RequiresViolation, probe_19Err2RequiresViolation, probe_19Err3RequiresViolation, probe_19Err7RequiresViolation, probe_19Err5RequiresViolation, probe_19Err1RequiresViolation, probe_19Err0RequiresViolation, probe_19Err6RequiresViolation]=== [2018-02-04 03:22:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash 734096084, now seen corresponding path program 1 times [2018-02-04 03:22:29,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:29,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:22:30,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:30,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:22:30,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:22:30,887 INFO L182 omatonBuilderFactory]: Interpolants [8776#true, 8777#false, 8778#(= |#valid| |old(#valid)|), 8779#(and (= 0 (select |old(#valid)| |entry_point_~#a19~0.base|)) (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1) (= |old(#valid)| (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)))), 8780#(and (or (not (= probe_19_~a.offset 0)) (and (= |#valid| |old(#valid)|) (= probe_19_~a.base |probe_19_#in~a.base|))) (= |probe_19_#in~a.offset| probe_19_~a.offset)), 8781#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 8782#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (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|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8783#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8784#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (not (= probe_19_~a.offset 0)) (and (= 1 (select |#valid| |probe_19_#t~ret7.base|)) (= 0 (select |old(#valid)| |probe_19_#t~ret7.base|)) (= |probe_19_#in~a.base| probe_19_~a.base) (not (= 0 |probe_19_#t~ret7.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)))), 8785#(and (= |probe_19_#in~a.offset| probe_19_~a.offset) (or (<= 1 probe_19_~a.offset) (<= (+ probe_19_~a.offset 1) 0) (and (= 1 (select |#valid| probe_19_~a.base)) (= |probe_19_#in~a.base| probe_19_~a.base) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_19_~a.base) (+ probe_19_~a.offset 4))))))), 8786#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 8787#(and (= |#valid| |old(#valid)|) (= f19_~a.offset |f19_#in~a.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f19_~a.base |f19_#in~a.base|)), 8788#(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|)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8789#(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|))), 8790#(and (= f19_~a.offset |f19_#in~a.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (store |#valid| |f19_#t~ret2.base| (select |old(#valid)| |f19_#t~ret2.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |f19_#t~ret2.base|)) (not (= 0 |f19_#t~ret2.base|)) (= f19_~a.base |f19_#in~a.base|)), 8791#(and (= (store |#valid| (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) |old(#valid)|) (= (select |#memory_$Pointer$.base| f19_~a.base) (store (select |old(#memory_$Pointer$.base)| f19_~a.base) f19_~a.offset (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|)) 0) (= f19_~a.offset |f19_#in~a.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= f19_~a.base |f19_#in~a.base|)), 8792#(or (not (= |f19_#in~a.offset| 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (= (store |#valid| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) |old(#valid)|) (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (store (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))) (or (= (select |#memory_$Pointer$.base| |f19_#in~a.base|) (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |f19_#in~a.base|) (select |#memory_$Pointer$.base| |f19_#in~a.base|)) 0)))), 8793#(or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) |probe_19_#in~a.offset|))) (not (= |probe_19_#in~a.base| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) |probe_19_#in~a.offset|))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) |probe_19_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) |probe_19_#in~a.offset|))) (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) 4))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) |probe_19_#in~a.offset|) (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe_19_#in~a.base|) |probe_19_#in~a.offset|)))) (not (= |probe_19_#in~a.offset| 0))), 8794#(and (= 0 (select |old(#valid)| |entry_point_~#a19~0.base|)) (not (= |entry_point_~#a19~0.base| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|))) (not (= |entry_point_~#a19~0.base| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|) (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4))) (= 0 |entry_point_~#a19~0.offset|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|))) |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)) (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4)))), 8795#(and (or (not (= disconnect_19_~a.offset 0)) (and (= |#valid| |old(#valid)|) (= |disconnect_19_#in~a.base| disconnect_19_~a.base))) (= |disconnect_19_#in~a.offset| disconnect_19_~a.offset)), 8796#(and (= |disconnect_19_#in~a.offset| disconnect_19_~a.offset) (or (and (= |#valid| |old(#valid)|) (= |disconnect_19_#in~a.base| disconnect_19_~a.base) (= (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4)) |disconnect_19_#t~mem13.base|)) (not (= disconnect_19_~a.offset 0)))), 8797#(and (or (and (= |disconnect_19_#in~a.base| disconnect_19_~a.base) (= (store |#valid| (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4)))) |old(#valid)|) (= |disconnect_19_#in~a.offset| disconnect_19_~a.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4))) 0)) (not (= disconnect_19_~a.offset 0)) (and (= disconnect_19_~a.base |disconnect_19_#in~a.base|) (= 0 (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4))))) (or (= disconnect_19_~a.offset 0) (= |disconnect_19_#in~a.offset| disconnect_19_~a.offset))), 8798#(and (= |#valid| |old(#valid)|) (= f19_undo_~a.base |f19_undo_#in~a.base|) (= f19_undo_~a.offset |f19_undo_#in~a.offset|)), 8799#(and (= (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) |f19_undo_#t~mem5.base|) (= |#valid| |old(#valid)|)), 8800#(or (and (or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) (@diff |#valid| |old(#valid)|))) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|))), 8801#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|)) 0) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|))) (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) 4))) |old(#valid)|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) (+ (- 0) 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|)) (= (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|) (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) (+ (- 0) 4))) (= 0 (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) (+ (- 0) 4))) (not (= |disconnect_19_#in~a.offset| 0))), 8802#(and (= (select (store |#valid| |entry_point_~#a19~0.base| 0) (@diff (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)) |old(#valid)|))) (= (select (store |#valid| |entry_point_~#a19~0.base| 0) |entry_point_~#a19~0.base|) (select |old(#valid)| |entry_point_~#a19~0.base|)))] [2018-02-04 03:22:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:22:30,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:22:30,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:22:30,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:22:30,888 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 27 states. [2018-02-04 03:22:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:31,663 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-02-04 03:22:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:22:31,663 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-02-04 03:22:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:31,664 INFO L225 Difference]: With dead ends: 60 [2018-02-04 03:22:31,664 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 03:22:31,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:22:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 03:22:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 03:22:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 03:22:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 03:22:31,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-02-04 03:22:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:31,664 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 03:22:31,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:22:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 03:22:31,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 03:22:31,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:22:31 BoogieIcfgContainer [2018-02-04 03:22:31,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:22:31,670 INFO L168 Benchmark]: Toolchain (without parser) took 18961.43 ms. Allocated memory was 399.0 MB in the beginning and 962.1 MB in the end (delta: 563.1 MB). Free memory was 355.4 MB in the beginning and 644.8 MB in the end (delta: -289.4 MB). Peak memory consumption was 273.7 MB. Max. memory is 5.3 GB. [2018-02-04 03:22:31,670 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 399.0 MB. Free memory is still 362.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:22:31,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.85 ms. Allocated memory is still 399.0 MB. Free memory was 355.4 MB in the beginning and 342.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:22:31,671 INFO L168 Benchmark]: Boogie Preprocessor took 29.19 ms. Allocated memory is still 399.0 MB. Free memory was 342.2 MB in the beginning and 340.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:22:31,671 INFO L168 Benchmark]: RCFGBuilder took 256.28 ms. Allocated memory is still 399.0 MB. Free memory was 340.9 MB in the beginning and 314.3 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:22:31,671 INFO L168 Benchmark]: TraceAbstraction took 18505.01 ms. Allocated memory was 399.0 MB in the beginning and 962.1 MB in the end (delta: 563.1 MB). Free memory was 314.3 MB in the beginning and 644.8 MB in the end (delta: -330.6 MB). Peak memory consumption was 232.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:22:31,672 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 399.0 MB. Free memory is still 362.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.85 ms. Allocated memory is still 399.0 MB. Free memory was 355.4 MB in the beginning and 342.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.19 ms. Allocated memory is still 399.0 MB. Free memory was 342.2 MB in the beginning and 340.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 256.28 ms. Allocated memory is still 399.0 MB. Free memory was 340.9 MB in the beginning and 314.3 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 18505.01 ms. Allocated memory was 399.0 MB in the beginning and 962.1 MB in the end (delta: 563.1 MB). Free memory was 314.3 MB in the beginning and 644.8 MB in the end (delta: -330.6 MB). Peak memory consumption was 232.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference 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 - 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 - PositiveResult [Line: 1490]: 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]: pointer dereference always succeeds For all program executions holds that pointer dereference 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]: pointer dereference always succeeds For all program executions holds that pointer dereference 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]: pointer dereference always succeeds For all program executions holds that pointer dereference 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]: pointer dereference always succeeds For all program executions holds that pointer dereference 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 - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 89 locations, 21 error locations. SAFE Result, 18.4s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2729 SDtfs, 2448 SDslu, 13134 SDs, 0 SdLazy, 12006 SolverSat, 829 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 623 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 131/172 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 337 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1690 NumberOfCodeBlocks, 1690 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1649 ConstructedInterpolants, 0 QuantifiedInterpolants, 758791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 29 PerfectInterpolantSequences, 131/172 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_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-22-31-677.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-22-31-677.csv Received shutdown request...