java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:23:04,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:23:04,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:23:04,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:23:04,765 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:23:04,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:23:04,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:23:04,768 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:23:04,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:23:04,770 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:23:04,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:23:04,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:23:04,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:23:04,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:23:04,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:23:04,775 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:23:04,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:23:04,778 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:23:04,779 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:23:04,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:23:04,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:23:04,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:23:04,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:23:04,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:23:04,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:23:04,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:23:04,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:23:04,785 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:23:04,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:23:04,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:23:04,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:23:04,786 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:23:04,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:23:04,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:23:04,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:23:04,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:23:04,797 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:23:04,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:23:04,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:23:04,797 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:23:04,797 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:23:04,797 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:23:04,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:23:04,797 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:23:04,797 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:23:04,798 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:23:04,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:23:04,798 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:23:04,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:23:04,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:23:04,798 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:23:04,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:23:04,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:23:04,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:23:04,799 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:23:04,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:23:04,838 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:23:04,841 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:23:04,842 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:23:04,842 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:23:04,843 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-02 10:23:05,004 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:23:05,005 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:23:05,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:23:05,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:23:05,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:23:05,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:23:04" (1/1) ... [2018-02-02 10:23:05,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a37773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05, skipping insertion in model container [2018-02-02 10:23:05,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:23:04" (1/1) ... [2018-02-02 10:23:05,022 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:23:05,057 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:23:05,145 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:23:05,158 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:23:05,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05 WrapperNode [2018-02-02 10:23:05,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:23:05,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:23:05,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:23:05,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:23:05,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (1/1) ... [2018-02-02 10:23:05,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (1/1) ... [2018-02-02 10:23:05,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (1/1) ... [2018-02-02 10:23:05,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (1/1) ... [2018-02-02 10:23:05,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (1/1) ... [2018-02-02 10:23:05,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (1/1) ... [2018-02-02 10:23:05,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (1/1) ... [2018-02-02 10:23:05,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:23:05,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:23:05,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:23:05,194 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:23:05,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:23:05,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:23:05,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:23:05,232 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:23:05,232 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-02-02 10:23:05,232 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-02-02 10:23:05,232 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-02-02 10:23:05,232 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_19 [2018-02-02 10:23:05,232 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-02-02 10:23:05,232 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:23:05,232 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:23:05,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:23:05,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:23:05,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure probe_19 [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:23:05,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:23:05,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:23:05,455 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:23:05,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:23:05 BoogieIcfgContainer [2018-02-02 10:23:05,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:23:05,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:23:05,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:23:05,459 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:23:05,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:23:04" (1/3) ... [2018-02-02 10:23:05,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e17da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:23:05, skipping insertion in model container [2018-02-02 10:23:05,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:05" (2/3) ... [2018-02-02 10:23:05,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e17da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:23:05, skipping insertion in model container [2018-02-02 10:23:05,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:23:05" (3/3) ... [2018-02-02 10:23:05,462 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_true-valid-memsafety_true-termination.i [2018-02-02 10:23:05,470 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:23:05,475 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-02 10:23:05,503 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:23:05,503 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:23:05,503 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:23:05,503 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:23:05,503 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:23:05,503 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:23:05,503 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:23:05,504 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:23:05,504 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:23:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-02-02 10:23:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:23:05,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:05,526 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:05,526 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-02 10:23:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506467, now seen corresponding path program 1 times [2018-02-02 10:23:05,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:05,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:05,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:05,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:05,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:05,722 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-02 10:23:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:05,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:05,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:05,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:05,777 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-02-02 10:23:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:06,012 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-02-02 10:23:06,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:23:06,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 10:23:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:06,025 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:23:06,026 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:23:06,027 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-02 10:23:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:23:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-02-02 10:23:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:23:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-02 10:23:06,060 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-02 10:23:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:06,061 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-02 10:23:06,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-02 10:23:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:23:06,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:06,062 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:06,062 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-02 10:23:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1329506468, now seen corresponding path program 1 times [2018-02-02 10:23:06,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:06,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:06,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:06,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,139 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-02 10:23:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:06,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:06,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:06,141 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-02-02 10:23:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:06,347 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2018-02-02 10:23:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:06,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 10:23:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:06,348 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:23:06,348 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:23:06,349 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-02 10:23:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:23:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-02 10:23:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:23:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-02-02 10:23:06,356 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-02-02 10:23:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:06,356 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-02-02 10:23:06,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-02-02 10:23:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:23:06,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:06,357 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:06,357 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-02 10:23:06,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488357, now seen corresponding path program 1 times [2018-02-02 10:23:06,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:06,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:06,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:06,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,471 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-02 10:23:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:06,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:06,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:06,472 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-02-02 10:23:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:06,767 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2018-02-02 10:23:06,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:23:06,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 10:23:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:06,770 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:23:06,770 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:23:06,771 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-02 10:23:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:23:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-02-02 10:23:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:23:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-02-02 10:23:06,780 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-02-02 10:23:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:06,781 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-02-02 10:23:06,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-02-02 10:23:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:23:06,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:06,782 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:06,782 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-02 10:23:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1959488358, now seen corresponding path program 1 times [2018-02-02 10:23:06,783 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:06,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:06,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:23:06,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,883 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-02 10:23:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:06,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:23:06,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:23:06,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:23:06,884 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-02-02 10:23:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:07,190 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2018-02-02 10:23:07,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:23:07,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-02 10:23:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:07,191 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:23:07,191 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:23:07,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:23:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:23:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-02-02 10:23:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:23:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-02 10:23:07,198 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-02-02 10:23:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:07,198 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-02 10:23:07,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:23:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-02 10:23:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:23:07,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:07,199 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-02 10:23:07,199 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-02 10:23:07,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1193563309, now seen corresponding path program 1 times [2018-02-02 10:23:07,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:07,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:07,253 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-02 10:23:07,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:07,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:23:07,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:07,254 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-02 10:23:07,254 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-02 10:23:07,255 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-02 10:23:07,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:07,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:07,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:07,256 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 6 states. [2018-02-02 10:23:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:07,289 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-02 10:23:07,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:23:07,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:23:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:07,290 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:23:07,290 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:23:07,291 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-02 10:23:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:23:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-02-02 10:23:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:23:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-02-02 10:23:07,295 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 26 [2018-02-02 10:23:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:07,296 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-02-02 10:23:07,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-02-02 10:23:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:23:07,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:07,297 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-02 10:23:07,297 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-02 10:23:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443383, now seen corresponding path program 1 times [2018-02-02 10:23:07,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:07,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:07,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:07,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:07,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:07,349 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-02 10:23:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:07,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:07,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:07,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:07,349 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 8 states. [2018-02-02 10:23:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:07,428 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-02-02 10:23:07,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:23:07,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-02 10:23:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:07,429 INFO L225 Difference]: With dead ends: 101 [2018-02-02 10:23:07,429 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 10:23:07,429 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-02 10:23:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 10:23:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-02 10:23:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 10:23:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-02-02 10:23:07,435 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 26 [2018-02-02 10:23:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:07,435 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-02-02 10:23:07,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-02-02 10:23:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:23:07,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:07,436 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-02 10:23:07,436 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-02 10:23:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1571443382, now seen corresponding path program 1 times [2018-02-02 10:23:07,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:07,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:07,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:07,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:23:07,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:07,477 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-02 10:23:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:07,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:07,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:07,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:07,478 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 6 states. [2018-02-02 10:23:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:07,494 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-02-02 10:23:07,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:07,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:23:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:07,497 INFO L225 Difference]: With dead ends: 97 [2018-02-02 10:23:07,497 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 10:23:07,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 10:23:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-02-02 10:23:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:23:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-02 10:23:07,502 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 26 [2018-02-02 10:23:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:07,502 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-02 10:23:07,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-02 10:23:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:23:07,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:07,503 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-02 10:23:07,503 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-02 10:23:07,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265041, now seen corresponding path program 1 times [2018-02-02 10:23:07,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:07,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:07,545 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-02 10:23:07,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:07,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:07,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:07,546 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-02 10:23:07,546 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-02 10:23:07,546 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-02 10:23:07,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:07,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:07,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:07,547 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 6 states. [2018-02-02 10:23:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:07,678 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-02 10:23:07,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:07,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 10:23:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:07,679 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:23:07,679 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:23:07,680 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-02 10:23:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:23:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2018-02-02 10:23:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:23:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-02 10:23:07,684 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 28 [2018-02-02 10:23:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:07,684 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-02 10:23:07,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-02 10:23:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:23:07,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:07,685 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-02 10:23:07,685 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-02 10:23:07,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1472265042, now seen corresponding path program 1 times [2018-02-02 10:23:07,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:07,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:07,767 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-02 10:23:07,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:07,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:23:07,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:07,768 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-02 10:23:07,768 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-02 10:23:07,769 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-02 10:23:07,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:23:07,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:23:07,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:23:07,770 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-02-02 10:23:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:07,980 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-02 10:23:07,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:23:07,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:23:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:07,984 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:23:07,984 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:23:07,984 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-02 10:23:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:23:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-02-02 10:23:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:23:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-02 10:23:07,988 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 28 [2018-02-02 10:23:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:07,988 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-02 10:23:07,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:23:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-02 10:23:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:23:07,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:07,989 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-02 10:23:07,990 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-02 10:23:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860499, now seen corresponding path program 1 times [2018-02-02 10:23:07,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:08,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:08,062 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-02 10:23:08,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:08,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:08,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:08,063 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-02 10:23:08,063 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-02 10:23:08,063 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-02 10:23:08,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:08,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:08,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:08,064 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 8 states. [2018-02-02 10:23:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:08,248 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-02 10:23:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:23:08,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-02 10:23:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:08,249 INFO L225 Difference]: With dead ends: 117 [2018-02-02 10:23:08,249 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:23:08,249 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-02 10:23:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:23:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-02-02 10:23:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:23:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-02-02 10:23:08,253 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 30 [2018-02-02 10:23:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:08,253 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-02-02 10:23:08,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-02-02 10:23:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:23:08,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:08,254 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-02 10:23:08,255 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-02 10:23:08,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1711860500, now seen corresponding path program 1 times [2018-02-02 10:23:08,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:08,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:08,432 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-02 10:23:08,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:08,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:23:08,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:08,433 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-02 10:23:08,433 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-02 10:23:08,433 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-02 10:23:08,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:23:08,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:23:08,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:23:08,434 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 12 states. [2018-02-02 10:23:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:08,906 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-02 10:23:08,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:23:08,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-02-02 10:23:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:08,908 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:23:08,908 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:23:08,908 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-02 10:23:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:23:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-02 10:23:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:23:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-02 10:23:08,912 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2018-02-02 10:23:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:08,913 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-02 10:23:08,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:23:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-02 10:23:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:23:08,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:08,914 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-02 10:23:08,914 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-02 10:23:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1708399928, now seen corresponding path program 1 times [2018-02-02 10:23:08,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:08,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:08,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:08,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:23:08,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:08,994 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-02 10:23:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:08,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:23:08,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:23:08,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:23:08,995 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 4 states. [2018-02-02 10:23:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:09,068 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-02 10:23:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:23:09,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-02 10:23:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:09,070 INFO L225 Difference]: With dead ends: 105 [2018-02-02 10:23:09,070 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:23:09,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:23:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-02-02 10:23:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 10:23:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-02-02 10:23:09,073 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 28 [2018-02-02 10:23:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:09,073 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-02-02 10:23:09,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:23:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-02-02 10:23:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:23:09,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:09,075 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-02 10:23:09,075 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-02 10:23:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash -526031434, now seen corresponding path program 1 times [2018-02-02 10:23:09,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:09,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:09,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:09,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:09,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:09,114 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-02 10:23:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:09,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:23:09,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:23:09,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:09,115 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-02-02 10:23:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:09,156 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-02 10:23:09,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:09,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:23:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:09,157 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:23:09,157 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:23:09,157 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-02 10:23:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:23:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 10:23:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:23:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-02-02 10:23:09,160 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 30 [2018-02-02 10:23:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:09,160 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-02-02 10:23:09,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:23:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-02-02 10:23:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:23:09,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:09,161 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-02 10:23:09,162 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-02 10:23:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash 850149805, now seen corresponding path program 1 times [2018-02-02 10:23:09,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:09,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:09,204 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-02 10:23:09,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:09,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:09,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:09,205 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-02 10:23:09,205 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-02 10:23:09,205 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-02 10:23:09,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:23:09,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:23:09,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:09,206 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 5 states. [2018-02-02 10:23:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:09,218 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-02-02 10:23:09,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:23:09,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-02 10:23:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:09,219 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:23:09,220 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:23:09,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:23:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-02 10:23:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 10:23:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-02 10:23:09,222 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-02-02 10:23:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:09,223 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-02 10:23:09,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:23:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-02 10:23:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:23:09,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:09,224 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-02 10:23:09,224 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-02 10:23:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653486, now seen corresponding path program 1 times [2018-02-02 10:23:09,225 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:09,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:09,393 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-02 10:23:09,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:09,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:23:09,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:09,394 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-02 10:23:09,394 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-02 10:23:09,394 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-02 10:23:09,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:23:09,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:23:09,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:23:09,395 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 15 states. [2018-02-02 10:23:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:09,648 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-02 10:23:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:23:09,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-02 10:23:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:09,649 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:23:09,649 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:23:09,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:23:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:23:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 10:23:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:23:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-02-02 10:23:09,652 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2018-02-02 10:23:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:09,652 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-02-02 10:23:09,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:23:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-02-02 10:23:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:23:09,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:09,653 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-02 10:23:09,653 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-02 10:23:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1737653487, now seen corresponding path program 1 times [2018-02-02 10:23:09,655 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:09,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:09,826 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-02 10:23:09,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:09,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:23:09,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:09,826 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-02 10:23:09,826 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-02 10:23:09,826 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-02 10:23:09,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:23:09,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:23:09,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:23:09,827 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 16 states. [2018-02-02 10:23:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:10,045 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-02-02 10:23:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:23:10,045 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-02-02 10:23:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:10,046 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:23:10,046 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 10:23:10,047 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-02 10:23:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 10:23:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-02-02 10:23:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:23:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-02 10:23:10,049 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 37 [2018-02-02 10:23:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:10,050 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-02 10:23:10,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:23:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-02 10:23:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:23:10,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:10,051 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-02 10:23:10,051 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-02 10:23:10,051 INFO L82 PathProgramCache]: Analyzing trace with hash 695150445, now seen corresponding path program 1 times [2018-02-02 10:23:10,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:10,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:10,095 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-02 10:23:10,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:10,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:10,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:10,096 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-02 10:23:10,096 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-02 10:23:10,096 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-02 10:23:10,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:23:10,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:23:10,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:10,097 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-02-02 10:23:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:10,135 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-02 10:23:10,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:10,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 10:23:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:10,136 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:23:10,136 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:23:10,136 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-02 10:23:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:23:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-02 10:23:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:23:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-02 10:23:10,139 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2018-02-02 10:23:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:10,139 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-02 10:23:10,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:23:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-02 10:23:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:23:10,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:10,140 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-02 10:23:10,140 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-02 10:23:10,140 INFO L82 PathProgramCache]: Analyzing trace with hash -200066512, now seen corresponding path program 1 times [2018-02-02 10:23:10,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:10,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:10,179 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-02 10:23:10,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:10,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:10,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:10,180 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-02 10:23:10,180 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-02 10:23:10,180 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-02 10:23:10,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:10,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:10,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:10,181 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-02-02 10:23:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:10,282 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-02 10:23:10,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:23:10,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 10:23:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:10,283 INFO L225 Difference]: With dead ends: 104 [2018-02-02 10:23:10,283 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 10:23:10,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:23:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 10:23:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-02 10:23:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:23:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-02-02 10:23:10,285 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 44 [2018-02-02 10:23:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:10,285 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-02-02 10:23:10,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-02-02 10:23:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:23:10,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:10,286 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-02 10:23:10,286 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-02 10:23:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash -200066511, now seen corresponding path program 1 times [2018-02-02 10:23:10,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:10,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:10,322 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-02 10:23:10,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:10,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:23:10,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:10,322 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-02 10:23:10,322 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-02 10:23:10,323 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-02 10:23:10,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:10,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:10,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:10,323 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2018-02-02 10:23:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:10,370 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-02 10:23:10,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:23:10,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 10:23:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:10,371 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:23:10,371 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:23:10,371 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-02 10:23:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:23:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 10:23:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:23:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-02 10:23:10,373 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-02-02 10:23:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:10,373 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-02 10:23:10,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-02 10:23:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:23:10,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:10,374 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-02 10:23:10,374 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-02 10:23:10,374 INFO L82 PathProgramCache]: Analyzing trace with hash -705625136, now seen corresponding path program 1 times [2018-02-02 10:23:10,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:10,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:10,404 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-02 10:23:10,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:10,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:10,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:10,404 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-02 10:23:10,405 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-02 10:23:10,405 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-02 10:23:10,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:23:10,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:23:10,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:10,405 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2018-02-02 10:23:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:10,422 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-02 10:23:10,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:23:10,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-02 10:23:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:10,423 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:23:10,424 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:23:10,424 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-02 10:23:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:23:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-02-02 10:23:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:23:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-02 10:23:10,426 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-02-02 10:23:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:10,427 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-02 10:23:10,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:23:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-02 10:23:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:23:10,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:10,427 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-02 10:23:10,427 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-02 10:23:10,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018930, now seen corresponding path program 1 times [2018-02-02 10:23:10,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:10,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:10,473 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-02 10:23:10,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:10,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:10,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:10,473 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-02 10:23:10,474 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-02 10:23:10,474 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-02 10:23:10,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:10,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:10,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:10,474 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-02-02 10:23:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:10,570 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-02 10:23:10,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:23:10,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-02 10:23:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:10,571 INFO L225 Difference]: With dead ends: 96 [2018-02-02 10:23:10,571 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 10:23:10,571 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-02 10:23:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 10:23:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-02-02 10:23:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 10:23:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-02 10:23:10,574 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2018-02-02 10:23:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:10,574 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-02 10:23:10,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-02 10:23:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:23:10,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:10,575 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-02 10:23:10,575 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-02 10:23:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1264018931, now seen corresponding path program 1 times [2018-02-02 10:23:10,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:10,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:10,700 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-02 10:23:10,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:10,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:23:10,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:10,701 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-02 10:23:10,701 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-02 10:23:10,701 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-02 10:23:10,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:23:10,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:23:10,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:10,702 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-02-02 10:23:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:10,810 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-02 10:23:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:23:10,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-02 10:23:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:10,813 INFO L225 Difference]: With dead ends: 96 [2018-02-02 10:23:10,813 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 10:23:10,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:23:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 10:23:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-02 10:23:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:23:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-02 10:23:10,815 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2018-02-02 10:23:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:10,816 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-02 10:23:10,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:23:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-02 10:23:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:23:10,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:10,816 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-02 10:23:10,816 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-02 10:23:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash 529881151, now seen corresponding path program 1 times [2018-02-02 10:23:10,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:10,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:10,900 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-02 10:23:10,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:10,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:23:10,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:10,901 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-02 10:23:10,901 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-02 10:23:10,901 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-02 10:23:10,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:23:10,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:23:10,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:10,901 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 11 states. [2018-02-02 10:23:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:11,074 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-02 10:23:11,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:23:11,098 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 10:23:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:11,099 INFO L225 Difference]: With dead ends: 97 [2018-02-02 10:23:11,099 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 10:23:11,099 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-02 10:23:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 10:23:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-02-02 10:23:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:23:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-02-02 10:23:11,102 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2018-02-02 10:23:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:11,102 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-02-02 10:23:11,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:23:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-02-02 10:23:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:23:11,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:11,103 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-02 10:23:11,103 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-02 10:23:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 529881150, now seen corresponding path program 1 times [2018-02-02 10:23:11,104 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:11,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:11,190 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-02 10:23:11,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:11,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:23:11,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:11,191 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-02 10:23:11,192 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-02 10:23:11,192 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-02 10:23:11,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:23:11,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:23:11,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:11,193 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 11 states. [2018-02-02 10:23:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:11,280 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 10:23:11,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:23:11,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 10:23:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:11,281 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:23:11,281 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:23:11,281 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-02 10:23:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:23:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 10:23:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:23:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-02 10:23:11,283 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 47 [2018-02-02 10:23:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:11,283 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-02 10:23:11,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:23:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-02 10:23:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:23:11,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:11,283 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-02 10:23:11,283 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-02 10:23:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash 365897592, now seen corresponding path program 1 times [2018-02-02 10:23:11,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:11,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:11,549 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-02 10:23:11,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:11,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:23:11,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:11,549 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-02 10:23:11,550 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-02 10:23:11,550 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-02 10:23:11,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:23:11,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:23:11,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:23:11,550 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 19 states. [2018-02-02 10:23:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:12,090 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-02-02 10:23:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:23:12,090 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-02-02 10:23:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:12,091 INFO L225 Difference]: With dead ends: 110 [2018-02-02 10:23:12,091 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 10:23:12,091 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:23:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 10:23:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-02-02 10:23:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:23:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-02-02 10:23:12,093 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 46 [2018-02-02 10:23:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:12,093 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-02-02 10:23:12,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:23:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-02-02 10:23:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:23:12,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:12,094 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-02 10:23:12,094 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-02 10:23:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash 365897593, now seen corresponding path program 1 times [2018-02-02 10:23:12,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:12,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:12,194 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-02 10:23:12,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:12,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:23:12,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:12,194 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-02 10:23:12,195 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-02 10:23:12,195 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-02 10:23:12,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:12,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:12,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:12,195 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 10 states. [2018-02-02 10:23:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:12,276 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-02-02 10:23:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:12,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-02-02 10:23:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:12,277 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:23:12,277 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:23:12,277 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-02 10:23:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:23:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-02-02 10:23:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:23:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-02-02 10:23:12,280 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 46 [2018-02-02 10:23:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:12,281 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-02-02 10:23:12,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-02-02 10:23:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:23:12,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:12,281 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-02 10:23:12,281 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-02 10:23:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1542076562, now seen corresponding path program 1 times [2018-02-02 10:23:12,283 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:12,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:12,340 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-02 10:23:12,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:12,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:23:12,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:12,341 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-02 10:23:12,341 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-02 10:23:12,341 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-02 10:23:12,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:12,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:12,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:12,342 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 8 states. [2018-02-02 10:23:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:12,376 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-02-02 10:23:12,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:12,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 10:23:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:12,376 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:23:12,377 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:23:12,377 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-02 10:23:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:23:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-02 10:23:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:23:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-02 10:23:12,379 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 47 [2018-02-02 10:23:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:12,380 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-02 10:23:12,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-02 10:23:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:23:12,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:12,381 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-02 10:23:12,381 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-02 10:23:12,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1831313542, now seen corresponding path program 1 times [2018-02-02 10:23:12,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:12,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:12,554 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-02 10:23:12,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:12,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:23:12,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:12,555 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-02 10:23:12,555 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-02 10:23:12,555 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-02 10:23:12,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:23:12,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:23:12,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:23:12,555 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 15 states. [2018-02-02 10:23:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:12,951 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-02-02 10:23:12,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:23:12,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-02-02 10:23:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:12,951 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:23:12,951 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:23:12,952 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-02 10:23:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:23:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-02 10:23:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:23:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-02-02 10:23:12,953 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 50 [2018-02-02 10:23:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:12,954 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-02-02 10:23:12,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:23:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-02-02 10:23:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:23:12,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:12,954 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-02 10:23:12,954 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-02 10:23:12,954 INFO L82 PathProgramCache]: Analyzing trace with hash -522729561, now seen corresponding path program 1 times [2018-02-02 10:23:12,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:12,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:13,421 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-02 10:23:13,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:13,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:23:13,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:13,422 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-02 10:23:13,423 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-02 10:23:13,423 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-02 10:23:13,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:23:13,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:23:13,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:23:13,423 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 17 states. [2018-02-02 10:23:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:13,826 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-02-02 10:23:13,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:23:13,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-02 10:23:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:13,827 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:23:13,827 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:23:13,827 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-02 10:23:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:23:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-02 10:23:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:23:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-02-02 10:23:13,829 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 48 [2018-02-02 10:23:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:13,829 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-02-02 10:23:13,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:23:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-02-02 10:23:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:23:13,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:13,829 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-02 10:23:13,829 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-02 10:23:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash 680328992, now seen corresponding path program 1 times [2018-02-02 10:23:13,830 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:13,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:13,962 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-02 10:23:13,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:13,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:23:13,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:13,963 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-02 10:23:13,963 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-02 10:23:13,963 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-02 10:23:13,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:23:13,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:23:13,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:23:13,964 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 13 states. [2018-02-02 10:23:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:14,196 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-02-02 10:23:14,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:23:14,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-02-02 10:23:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:14,197 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:23:14,197 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:23:14,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:23:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:23:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-02 10:23:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:23:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-02-02 10:23:14,199 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 51 [2018-02-02 10:23:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:14,199 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-02-02 10:23:14,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:23:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-02-02 10:23:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:23:14,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:14,199 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-02 10:23:14,200 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-02 10:23:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash -936145011, now seen corresponding path program 1 times [2018-02-02 10:23:14,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:14,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:14,547 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-02 10:23:14,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:14,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:23:14,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:14,548 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-02 10:23:14,548 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-02 10:23:14,548 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-02 10:23:14,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:23:14,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:23:14,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:23:14,548 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 18 states. [2018-02-02 10:23:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:14,898 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-02 10:23:14,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:23:14,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-02-02 10:23:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:14,899 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:23:14,899 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:23:14,899 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-02 10:23:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:23:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-02 10:23:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 10:23:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-02-02 10:23:14,901 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 51 [2018-02-02 10:23:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:14,901 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-02-02 10:23:14,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:23:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-02-02 10:23:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:23:14,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:14,901 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-02 10:23:14,901 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-02 10:23:14,901 INFO L82 PathProgramCache]: Analyzing trace with hash -936145010, now seen corresponding path program 1 times [2018-02-02 10:23:14,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:14,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:15,428 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-02 10:23:15,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:15,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:23:15,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:15,429 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-02 10:23:15,429 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-02 10:23:15,429 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-02 10:23:15,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:23:15,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:23:15,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:23:15,430 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 22 states. [2018-02-02 10:23:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:16,078 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-02 10:23:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:23:16,078 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-02-02 10:23:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:16,079 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:23:16,079 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:23:16,079 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-02 10:23:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:23:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-02-02 10:23:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 10:23:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-02-02 10:23:16,082 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 51 [2018-02-02 10:23:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:16,082 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-02-02 10:23:16,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:23:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-02-02 10:23:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:23:16,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:16,083 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-02 10:23:16,083 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-02 10:23:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash -384637660, now seen corresponding path program 1 times [2018-02-02 10:23:16,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:16,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:16,612 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-02 10:23:16,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:16,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:23:16,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:16,612 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-02 10:23:16,612 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-02 10:23:16,613 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-02 10:23:16,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:23:16,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:23:16,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:23:16,613 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 23 states. [2018-02-02 10:23:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:17,295 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-02 10:23:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:23:17,295 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-02 10:23:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:17,296 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:23:17,296 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:23:17,297 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-02 10:23:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:23:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-02 10:23:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 10:23:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-02-02 10:23:17,299 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 52 [2018-02-02 10:23:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:17,299 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-02-02 10:23:17,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:23:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-02-02 10:23:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:23:17,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:17,300 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-02 10:23:17,300 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-02 10:23:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1081279336, now seen corresponding path program 1 times [2018-02-02 10:23:17,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:17,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:17,323 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-02 10:23:17,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:17,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:17,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:17,324 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-02 10:23:17,324 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-02 10:23:17,324 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-02 10:23:17,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:23:17,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:23:17,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:17,325 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 5 states. [2018-02-02 10:23:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:17,332 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 10:23:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:23:17,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-02 10:23:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:17,333 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:23:17,333 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:23:17,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:23:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-02-02 10:23:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 10:23:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-02 10:23:17,335 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 52 [2018-02-02 10:23:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:17,335 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-02 10:23:17,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:23:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-02 10:23:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:23:17,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:17,336 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-02 10:23:17,336 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-02 10:23:17,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562575, now seen corresponding path program 1 times [2018-02-02 10:23:17,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:17,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:17,809 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-02 10:23:17,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:17,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:23:17,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:17,810 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-02 10:23:17,810 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-02 10:23:17,810 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-02 10:23:17,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:23:17,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:23:17,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:23:17,811 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 22 states. [2018-02-02 10:23:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:18,547 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-02 10:23:18,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:23:18,548 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-02-02 10:23:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:18,548 INFO L225 Difference]: With dead ends: 96 [2018-02-02 10:23:18,548 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 10:23:18,549 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-02 10:23:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 10:23:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-02-02 10:23:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:23:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-02 10:23:18,550 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 55 [2018-02-02 10:23:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:18,550 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-02 10:23:18,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:23:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-02 10:23:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:23:18,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:18,551 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-02 10:23:18,551 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-02 10:23:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1569562576, now seen corresponding path program 1 times [2018-02-02 10:23:18,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:18,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:18,601 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-02 10:23:18,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:18,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:18,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:18,601 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-02 10:23:18,601 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-02 10:23:18,602 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-02 10:23:18,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:18,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:18,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:18,602 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 8 states. [2018-02-02 10:23:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:18,650 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-02 10:23:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:18,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-02 10:23:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:18,651 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:23:18,651 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:23:18,651 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-02 10:23:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:23:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-02 10:23:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 10:23:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-02 10:23:18,652 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 55 [2018-02-02 10:23:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:18,652 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-02 10:23:18,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-02 10:23:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:23:18,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:18,653 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-02 10:23:18,653 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-02 10:23:18,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799554, now seen corresponding path program 1 times [2018-02-02 10:23:18,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:18,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:19,134 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-02 10:23:19,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:19,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:23:19,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:19,135 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-02 10:23:19,135 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-02 10:23:19,135 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-02 10:23:19,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:23:19,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:23:19,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:23:19,136 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 26 states. [2018-02-02 10:23:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:19,719 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-02 10:23:19,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:23:19,720 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-02-02 10:23:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:19,720 INFO L225 Difference]: With dead ends: 93 [2018-02-02 10:23:19,720 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:23:19,720 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-02 10:23:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:23:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-02-02 10:23:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:23:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-02 10:23:19,722 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 56 [2018-02-02 10:23:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:19,722 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-02 10:23:19,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:23:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-02 10:23:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:23:19,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:19,722 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-02 10:23:19,722 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-02 10:23:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1411799553, now seen corresponding path program 1 times [2018-02-02 10:23:19,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:19,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:19,811 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-02 10:23:19,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:19,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:23:19,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:19,812 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-02 10:23:19,812 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-02 10:23:19,812 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-02 10:23:19,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:23:19,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:23:19,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:23:19,813 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 15 states. [2018-02-02 10:23:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:20,052 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-02 10:23:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:23:20,053 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-02 10:23:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:20,053 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:23:20,053 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:23:20,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:23:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:23:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-02 10:23:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 10:23:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-02 10:23:20,055 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 56 [2018-02-02 10:23:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:20,056 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-02 10:23:20,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:23:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-02 10:23:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:23:20,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:20,056 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-02 10:23:20,057 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-02 10:23:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1384633629, now seen corresponding path program 1 times [2018-02-02 10:23:20,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:20,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:20,102 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-02 10:23:20,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:20,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:23:20,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:20,102 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-02 10:23:20,102 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-02 10:23:20,103 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-02 10:23:20,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:20,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:20,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:20,103 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 6 states. [2018-02-02 10:23:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:20,116 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-02-02 10:23:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:20,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-02 10:23:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:20,117 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:23:20,117 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:23:20,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:23:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-02-02 10:23:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:23:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-02 10:23:20,119 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 61 [2018-02-02 10:23:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:20,119 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-02 10:23:20,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-02 10:23:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:23:20,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:20,120 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-02 10:23:20,120 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-02 10:23:20,120 INFO L82 PathProgramCache]: Analyzing trace with hash 843947090, now seen corresponding path program 1 times [2018-02-02 10:23:20,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:20,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:21,222 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-02 10:23:21,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:21,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:23:21,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:21,223 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-02 10:23:21,223 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-02 10:23:21,223 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-02 10:23:21,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:23:21,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:23:21,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:23:21,224 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 24 states. [2018-02-02 10:23:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:21,867 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-02-02 10:23:21,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:23:21,867 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-02-02 10:23:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:21,867 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:23:21,867 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 10:23:21,867 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-02 10:23:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 10:23:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 10:23:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:23:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-02-02 10:23:21,868 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 63 [2018-02-02 10:23:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:21,869 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-02-02 10:23:21,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:23:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-02-02 10:23:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:23:21,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:21,869 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-02 10:23:21,869 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-02 10:23:21,869 INFO L82 PathProgramCache]: Analyzing trace with hash 734096084, now seen corresponding path program 1 times [2018-02-02 10:23:21,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:21,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:23,059 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-02 10:23:23,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:23,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:23:23,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:23,060 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-02 10:23:23,060 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-02 10:23:23,060 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-02 10:23:23,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:23:23,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:23:23,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:23:23,061 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 27 states. [2018-02-02 10:23:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:23,854 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-02-02 10:23:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:23:23,854 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-02-02 10:23:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:23,854 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:23:23,854 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 10:23:23,855 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-02 10:23:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 10:23:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 10:23:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 10:23:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 10:23:23,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-02-02 10:23:23,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:23,855 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 10:23:23,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:23:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 10:23:23,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 10:23:23,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:23:23 BoogieIcfgContainer [2018-02-02 10:23:23,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:23:23,859 INFO L168 Benchmark]: Toolchain (without parser) took 18855.19 ms. Allocated memory was 402.7 MB in the beginning and 1.0 GB in the end (delta: 622.9 MB). Free memory was 359.3 MB in the beginning and 515.8 MB in the end (delta: -156.4 MB). Peak memory consumption was 466.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:23,860 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:23:23,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.85 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 346.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:23,861 INFO L168 Benchmark]: Boogie Preprocessor took 28.77 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 343.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:23,861 INFO L168 Benchmark]: RCFGBuilder took 262.01 ms. Allocated memory is still 402.7 MB. Free memory was 343.5 MB in the beginning and 318.2 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:23,861 INFO L168 Benchmark]: TraceAbstraction took 18402.86 ms. Allocated memory was 402.7 MB in the beginning and 1.0 GB in the end (delta: 622.9 MB). Free memory was 318.2 MB in the beginning and 515.8 MB in the end (delta: -197.6 MB). Peak memory consumption was 425.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:23:23,862 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.12 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.85 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 346.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.77 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 343.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 262.01 ms. Allocated memory is still 402.7 MB. Free memory was 343.5 MB in the beginning and 318.2 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 18402.86 ms. Allocated memory was 402.7 MB in the beginning and 1.0 GB in the end (delta: 622.9 MB). Free memory was 318.2 MB in the beginning and 515.8 MB in the end (delta: -197.6 MB). Peak memory consumption was 425.3 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.3s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 10.0s 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 623 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 8.7s 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.2s SatisfiabilityAnalysisTime, 7.4s 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-02_10-23-23-870.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-02_10-23-23-870.csv Received shutdown request...