java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:07:18,218 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:07:18,220 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:07:18,232 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:07:18,232 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:07:18,233 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:07:18,234 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:07:18,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:07:18,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:07:18,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:07:18,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:07:18,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:07:18,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:07:18,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:07:18,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:07:18,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:07:18,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:07:18,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:07:18,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:07:18,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:07:18,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:07:18,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:07:18,250 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:07:18,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:07:18,252 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:07:18,253 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:07:18,253 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:07:18,254 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:07:18,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:07:18,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:07:18,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:07:18,254 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:07:18,263 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:07:18,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:07:18,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:07:18,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:07:18,264 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:07:18,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:07:18,265 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:07:18,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:07:18,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:07:18,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:07:18,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:07:18,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:07:18,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:07:18,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:07:18,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:07:18,303 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:07:18,306 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:07:18,307 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:07:18,307 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:07:18,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test19_false-valid-free.i [2018-02-04 03:07:18,449 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:07:18,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:07:18,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:07:18,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:07:18,455 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:07:18,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18, skipping insertion in model container [2018-02-04 03:07:18,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,467 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:07:18,501 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:07:18,595 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:07:18,610 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:07:18,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18 WrapperNode [2018-02-04 03:07:18,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:07:18,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:07:18,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:07:18,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:07:18,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (1/1) ... [2018-02-04 03:07:18,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:07:18,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:07:18,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:07:18,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:07:18,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:07:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:07:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:07:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:07:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure f19 [2018-02-04 03:07:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure f19_undo [2018-02-04 03:07:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure g19 [2018-02-04 03:07:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_unsafe_19 [2018-02-04 03:07:18,689 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_19 [2018-02-04 03:07:18,689 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:07:18,689 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure f19 [2018-02-04 03:07:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure f19_undo [2018-02-04 03:07:18,690 INFO L128 BoogieDeclarations]: Found specification of procedure g19 [2018-02-04 03:07:18,690 INFO L128 BoogieDeclarations]: Found specification of procedure probe_unsafe_19 [2018-02-04 03:07:18,690 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_19 [2018-02-04 03:07:18,690 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:07:18,690 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:07:18,690 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:07:18,690 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:07:18,897 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:07:18,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:18 BoogieIcfgContainer [2018-02-04 03:07:18,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:07:18,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:07:18,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:07:18,900 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:07:18,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:07:18" (1/3) ... [2018-02-04 03:07:18,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc1d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:18, skipping insertion in model container [2018-02-04 03:07:18,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:18" (2/3) ... [2018-02-04 03:07:18,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc1d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:18, skipping insertion in model container [2018-02-04 03:07:18,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:18" (3/3) ... [2018-02-04 03:07:18,902 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test19_false-valid-free.i [2018-02-04 03:07:18,908 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:07:18,913 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 03:07:18,937 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:07:18,938 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:07:18,938 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:07:18,938 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:07:18,938 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:07:18,938 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:07:18,938 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:07:18,938 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:07:18,939 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:07:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-02-04 03:07:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:07:18,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:18,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:18,961 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1664045335, now seen corresponding path program 1 times [2018-02-04 03:07:19,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:19,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:19,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:19,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,175 INFO L182 omatonBuilderFactory]: Interpolants [96#(= 1 (select |#valid| probe_unsafe_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_unsafe_19_#in~a.base|))] [2018-02-04 03:07:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:19,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:19,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:19,243 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 6 states. [2018-02-04 03:07:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:19,520 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-02-04 03:07:19,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:07:19,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 03:07:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:19,530 INFO L225 Difference]: With dead ends: 136 [2018-02-04 03:07:19,530 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 03:07:19,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 03:07:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-02-04 03:07:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 03:07:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-04 03:07:19,566 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-04 03:07:19,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:19,566 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-04 03:07:19,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-04 03:07:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:07:19,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:19,567 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:19,567 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:19,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1664045336, now seen corresponding path program 1 times [2018-02-04 03:07:19,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:19,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:19,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:19,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,667 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_unsafe_19_#in~a.base|)) (= 0 |probe_unsafe_19_#in~a.offset|)), 339#(and (= probe_unsafe_19_~a.offset 0) (= 8 (select |#length| probe_unsafe_19_~a.base))), 340#(= |old(#length)| |#length|), 335#true] [2018-02-04 03:07:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:19,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:19,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:19,670 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 6 states. [2018-02-04 03:07:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:19,868 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2018-02-04 03:07:19,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:07:19,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-04 03:07:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:19,870 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:07:19,870 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:07:19,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:07:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-04 03:07:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 03:07:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2018-02-04 03:07:19,877 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 15 [2018-02-04 03:07:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:19,877 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2018-02-04 03:07:19,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2018-02-04 03:07:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:07:19,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:19,878 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:19,879 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432345, now seen corresponding path program 1 times [2018-02-04 03:07:19,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:19,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:19,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:19,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,991 INFO L182 omatonBuilderFactory]: Interpolants [580#true, 581#false, 582#(= (select |#valid| |entry_point_~#a19~0.base|) 1), 583#(= 1 (select |#valid| |probe_unsafe_19_#in~a.base|)), 584#(= 1 (select |#valid| probe_unsafe_19_~a.base)), 585#(= |#valid| |old(#valid)|), 586#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 587#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-04 03:07:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:19,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:19,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:19,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:19,992 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 8 states. [2018-02-04 03:07:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:20,299 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2018-02-04 03:07:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:07:20,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 03:07:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:20,301 INFO L225 Difference]: With dead ends: 147 [2018-02-04 03:07:20,301 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 03:07:20,302 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:07:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 03:07:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2018-02-04 03:07:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 03:07:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2018-02-04 03:07:20,312 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 17 [2018-02-04 03:07:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:20,312 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2018-02-04 03:07:20,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2018-02-04 03:07:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:07:20,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:20,313 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:20,313 INFO L371 AbstractCegarLoop]: === Iteration 4 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:20,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432346, now seen corresponding path program 1 times [2018-02-04 03:07:20,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:20,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:20,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:07:20,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,421 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_unsafe_19_#in~a.base|) 1) (= 8 (select |#length| |probe_unsafe_19_#in~a.base|)) (= 0 |probe_unsafe_19_#in~a.offset|)), 855#(and (= (select |#valid| probe_unsafe_19_~a.base) 1) (= probe_unsafe_19_~a.offset 0) (= 8 (select |#length| probe_unsafe_19_~a.base))), 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_unsafe_19_~a.base) 8) (= probe_unsafe_19_~a.offset 0))] [2018-02-04 03:07:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:07:20,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:07:20,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:07:20,422 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand 9 states. [2018-02-04 03:07:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:20,696 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2018-02-04 03:07:20,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:07:20,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 03:07:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:20,697 INFO L225 Difference]: With dead ends: 149 [2018-02-04 03:07:20,697 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 03:07:20,698 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-04 03:07:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 03:07:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 82. [2018-02-04 03:07:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 03:07:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-04 03:07:20,706 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 17 [2018-02-04 03:07:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:20,706 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-04 03:07:20,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:07:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-04 03:07:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:07:20,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:20,707 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:20,707 INFO L371 AbstractCegarLoop]: === Iteration 5 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:20,707 INFO L82 PathProgramCache]: Analyzing trace with hash 522081757, now seen corresponding path program 1 times [2018-02-04 03:07:20,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:20,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:20,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:20,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:07:20,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:20,769 INFO L182 omatonBuilderFactory]: Interpolants [1104#(and (= 0 |probe_unsafe_19_#t~ret7.offset|) (= 0 |probe_unsafe_19_#t~ret7.base|)), 1105#(and (= 0 (select (select |#memory_$Pointer$.offset| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))), 1106#(and (= 0 |probe_unsafe_19_#t~mem9.offset|) (= |probe_unsafe_19_#t~mem9.base| 0)), 1101#true, 1102#false, 1103#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|))] [2018-02-04 03:07:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:20,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:20,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:20,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:20,770 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 6 states. [2018-02-04 03:07:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:20,815 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-04 03:07:20,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:07:20,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:07:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:20,816 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:07:20,816 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:07:20,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:07:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-02-04 03:07:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:07:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-02-04 03:07:20,821 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 26 [2018-02-04 03:07:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:20,822 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-02-04 03:07:20,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-02-04 03:07:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:07:20,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:20,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:20,823 INFO L371 AbstractCegarLoop]: === Iteration 6 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:20,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1860386785, now seen corresponding path program 1 times [2018-02-04 03:07:20,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:20,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:20,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:20,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,876 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_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|), 1293#(and (= probe_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|) (= 1 (select |#valid| probe_unsafe_19_~a.base))), 1294#(= 1 (select |#valid| |probe_unsafe_19_#in~a.base|)), 1295#(= 1 (select |#valid| |entry_point_~#a19~0.base|))] [2018-02-04 03:07:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:20,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:20,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:20,877 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 8 states. [2018-02-04 03:07:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:20,952 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-02-04 03:07:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:07:20,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 03:07:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:20,953 INFO L225 Difference]: With dead ends: 101 [2018-02-04 03:07:20,953 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 03:07:20,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:07:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 03:07:20,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-04 03:07:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 03:07:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-02-04 03:07:20,958 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 26 [2018-02-04 03:07:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:20,958 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-02-04 03:07:20,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-02-04 03:07:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:07:20,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:20,959 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:20,960 INFO L371 AbstractCegarLoop]: === Iteration 7 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1860386784, now seen corresponding path program 1 times [2018-02-04 03:07:20,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:20,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:20,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:07:20,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,996 INFO L182 omatonBuilderFactory]: Interpolants [1497#true, 1498#false, 1499#(<= 3 probe_unsafe_19_~ret~0), 1500#(<= 3 |probe_unsafe_19_#res|), 1501#(<= 3 |entry_point_#t~ret14|), 1502#(<= 3 entry_point_~ret~1)] [2018-02-04 03:07:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:20,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:20,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:20,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:20,997 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 6 states. [2018-02-04 03:07:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:21,021 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-02-04 03:07:21,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:07:21,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:07:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:21,024 INFO L225 Difference]: With dead ends: 97 [2018-02-04 03:07:21,024 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 03:07:21,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:07:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 03:07:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-02-04 03:07:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:07:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-04 03:07:21,027 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 26 [2018-02-04 03:07:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:21,028 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-04 03:07:21,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-04 03:07:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:07:21,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:21,029 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:21,029 INFO L371 AbstractCegarLoop]: === Iteration 8 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1338867621, now seen corresponding path program 1 times [2018-02-04 03:07:21,030 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:21,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:21,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:21,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,084 INFO L182 omatonBuilderFactory]: Interpolants [1696#false, 1697#(= 1 (select |#valid| probe_unsafe_19_~a.base)), 1698#(= 1 (select |#valid| |f19_#in~a.base|)), 1699#(= 1 (select |#valid| f19_~a.base)), 1700#(= |#valid| |old(#valid)|), 1695#true] [2018-02-04 03:07:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:21,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:21,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:21,084 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 6 states. [2018-02-04 03:07:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:21,203 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 03:07:21,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:07:21,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 03:07:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:21,205 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:07:21,205 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:07:21,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:07:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:07:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2018-02-04 03:07:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:07:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-02-04 03:07:21,210 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 28 [2018-02-04 03:07:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:21,211 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-02-04 03:07:21,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-02-04 03:07:21,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:07:21,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:21,212 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:21,215 INFO L371 AbstractCegarLoop]: === Iteration 9 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:21,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1338867620, now seen corresponding path program 1 times [2018-02-04 03:07:21,216 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:21,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:21,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:07:21,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,290 INFO L182 omatonBuilderFactory]: Interpolants [1920#(= |old(#length)| |#length|), 1912#true, 1913#false, 1914#(= 0 |entry_point_~#a19~0.offset|), 1915#(= 0 |probe_unsafe_19_#in~a.offset|), 1916#(= probe_unsafe_19_~a.offset 0), 1917#(and (<= (+ probe_unsafe_19_~a.offset 8) (select |#length| probe_unsafe_19_~a.base)) (= probe_unsafe_19_~a.offset 0)), 1918#(and (<= 8 (select |#length| |f19_#in~a.base|)) (= 0 |f19_#in~a.offset|)), 1919#(and (= f19_~a.offset 0) (<= 8 (select |#length| f19_~a.base)))] [2018-02-04 03:07:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:07:21,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:07:21,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:07:21,291 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-02-04 03:07:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:21,444 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 03:07:21,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:07:21,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 03:07:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:21,448 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:07:21,448 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:07:21,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:07:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:07:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-02-04 03:07:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 03:07:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-04 03:07:21,452 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 28 [2018-02-04 03:07:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:21,452 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-04 03:07:21,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:07:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-04 03:07:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:07:21,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:21,453 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:21,454 INFO L371 AbstractCegarLoop]: === Iteration 10 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1748755101, now seen corresponding path program 1 times [2018-02-04 03:07:21,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:21,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:21,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:21,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,540 INFO L182 omatonBuilderFactory]: Interpolants [2144#(= 1 (select |#valid| probe_unsafe_19_~a.base)), 2145#(= (select |#valid| |f19_#in~a.base|) 1), 2146#(= 1 (select |#valid| f19_~a.base)), 2147#(= |#valid| |old(#valid)|), 2148#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 2149#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 2142#true, 2143#false] [2018-02-04 03:07:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:21,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:21,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:21,541 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 8 states. [2018-02-04 03:07:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:21,727 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-04 03:07:21,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:07:21,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-04 03:07:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:21,728 INFO L225 Difference]: With dead ends: 117 [2018-02-04 03:07:21,728 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 03:07:21,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:07:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 03:07:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-02-04 03:07:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:07:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-02-04 03:07:21,732 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 30 [2018-02-04 03:07:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:21,732 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-02-04 03:07:21,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-02-04 03:07:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:07:21,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:21,733 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:21,733 INFO L371 AbstractCegarLoop]: === Iteration 11 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1748755102, now seen corresponding path program 1 times [2018-02-04 03:07:21,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:21,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:21,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:07:21,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,868 INFO L182 omatonBuilderFactory]: Interpolants [2371#true, 2372#false, 2373#(= 0 |entry_point_~#a19~0.offset|), 2374#(= 0 |probe_unsafe_19_#in~a.offset|), 2375#(= probe_unsafe_19_~a.offset 0), 2376#(and (<= (+ probe_unsafe_19_~a.offset 8) (select |#length| probe_unsafe_19_~a.base)) (= probe_unsafe_19_~a.offset 0) (= 1 (select |#valid| probe_unsafe_19_~a.base))), 2377#(and (<= 8 (select |#length| |f19_#in~a.base|)) (= (select |#valid| |f19_#in~a.base|) 1) (= 0 |f19_#in~a.offset|)), 2378#(and (= (select |#valid| f19_~a.base) 1) (= f19_~a.offset 0) (<= 8 (select |#length| f19_~a.base))), 2379#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2380#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 2381#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 2382#(and (= f19_~a.offset 0) (<= 8 (select |#length| f19_~a.base)))] [2018-02-04 03:07:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:21,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:07:21,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:07:21,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:07:21,869 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 12 states. [2018-02-04 03:07:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:22,207 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-04 03:07:22,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:07:22,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-02-04 03:07:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:22,208 INFO L225 Difference]: With dead ends: 124 [2018-02-04 03:07:22,208 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:07:22,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:07:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:07:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-04 03:07:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 03:07:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-04 03:07:22,212 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2018-02-04 03:07:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:22,212 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-04 03:07:22,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:07:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-04 03:07:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:07:22,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:22,213 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:22,213 INFO L371 AbstractCegarLoop]: === Iteration 12 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1057519410, now seen corresponding path program 1 times [2018-02-04 03:07:22,214 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:22,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:22,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:22,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:07:22,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:22,262 INFO L182 omatonBuilderFactory]: Interpolants [2620#true, 2621#false, 2622#(= |#valid| |old(#valid)|), 2623#(and (= (select |old(#valid)| |entry_point_~#a19~0.base|) 0) (= |#valid| (store |old(#valid)| |entry_point_~#a19~0.base| (select |#valid| |entry_point_~#a19~0.base|))))] [2018-02-04 03:07:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:22,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:07:22,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:07:22,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:07:22,263 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 4 states. [2018-02-04 03:07:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:22,328 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-04 03:07:22,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:07:22,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 03:07:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:22,329 INFO L225 Difference]: With dead ends: 105 [2018-02-04 03:07:22,329 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:07:22,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:07:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:07:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-02-04 03:07:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 03:07:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-02-04 03:07:22,331 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 28 [2018-02-04 03:07:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:22,331 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-02-04 03:07:22,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:07:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-02-04 03:07:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:07:22,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:22,332 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:22,332 INFO L371 AbstractCegarLoop]: === Iteration 13 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:22,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1571490764, now seen corresponding path program 1 times [2018-02-04 03:07:22,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:22,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:22,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:22,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:22,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:22,380 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_unsafe_19_#t~ret7.base|)), 2821#(not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))), 2822#(not (= 0 |probe_unsafe_19_#t~mem9.base|))] [2018-02-04 03:07:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:22,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:07:22,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:07:22,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:07:22,381 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-02-04 03:07:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:22,420 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-02-04 03:07:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:07:22,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 03:07:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:22,420 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:07:22,421 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:07:22,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:07:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:07:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 03:07:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 03:07:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-02-04 03:07:22,423 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 30 [2018-02-04 03:07:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:22,423 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-02-04 03:07:22,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:07:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-02-04 03:07:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:07:22,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:22,423 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:22,424 INFO L371 AbstractCegarLoop]: === Iteration 14 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1767360087, now seen corresponding path program 1 times [2018-02-04 03:07:22,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:22,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:07:22,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:22,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:22,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:22,447 INFO L182 omatonBuilderFactory]: Interpolants [2992#(= 0 |probe_unsafe_19_#t~ret10|), 2993#(= 0 probe_unsafe_19_~ret~0), 2989#true, 2990#false, 2991#(= 0 |f19_#res|)] [2018-02-04 03:07:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:07:22,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:07:22,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:07:22,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:07:22,448 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 5 states. [2018-02-04 03:07:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:22,457 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-02-04 03:07:22,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:07:22,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-02-04 03:07:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:22,458 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:07:22,458 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:07:22,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:07:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:07:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2018-02-04 03:07:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 03:07:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-02-04 03:07:22,460 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 37 [2018-02-04 03:07:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:22,461 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-02-04 03:07:22,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:07:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-02-04 03:07:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:07:22,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:22,462 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:22,462 INFO L371 AbstractCegarLoop]: === Iteration 15 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:22,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1640103528, now seen corresponding path program 1 times [2018-02-04 03:07:22,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:22,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:22,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:22,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:07:22,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:22,601 INFO L182 omatonBuilderFactory]: Interpolants [3169#true, 3170#false, 3171#(= 0 |entry_point_~#a19~0.offset|), 3172#(= 0 |probe_unsafe_19_#in~a.offset|), 3173#(= probe_unsafe_19_~a.offset 0), 3174#(= 0 |ldv_malloc_#t~malloc1.offset|), 3175#(= 0 |ldv_malloc_#res.offset|), 3176#(and (= 0 |probe_unsafe_19_#t~ret7.offset|) (= probe_unsafe_19_~a.offset 0)), 3177#(and (= 0 (select (select |#memory_$Pointer$.offset| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))) (= probe_unsafe_19_~a.offset 0)), 3178#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 3179#(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|)), 3180#(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|)), 3181#(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))), 3182#(= 0 (select (select |#memory_$Pointer$.offset| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))), 3183#(= |probe_unsafe_19_#t~mem12.offset| 0)] [2018-02-04 03:07:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:22,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:07:22,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:07:22,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:07:22,601 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 15 states. [2018-02-04 03:07:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:22,827 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-04 03:07:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:07:22,827 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-04 03:07:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:22,828 INFO L225 Difference]: With dead ends: 83 [2018-02-04 03:07:22,828 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 03:07:22,828 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-04 03:07:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 03:07:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 03:07:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 03:07:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-02-04 03:07:22,830 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2018-02-04 03:07:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:22,830 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-02-04 03:07:22,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:07:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-02-04 03:07:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:07:22,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:22,831 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:22,831 INFO L371 AbstractCegarLoop]: === Iteration 16 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1640103527, now seen corresponding path program 1 times [2018-02-04 03:07:22,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:22,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:23,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:23,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:07:23,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:23,032 INFO L182 omatonBuilderFactory]: Interpolants [3371#true, 3372#false, 3373#(= 0 |entry_point_~#a19~0.offset|), 3374#(= 0 |probe_unsafe_19_#in~a.offset|), 3375#(= probe_unsafe_19_~a.offset 0), 3376#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 3377#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 3378#(and (= 1 (select |#valid| |probe_unsafe_19_#t~ret7.base|)) (= probe_unsafe_19_~a.offset 0)), 3379#(and (= probe_unsafe_19_~a.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))), 3380#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 3381#(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|)), 3382#(= |#valid| |old(#valid)|), 3383#(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|)), 3384#(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))), 3385#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))), 3386#(= 1 (select |#valid| |probe_unsafe_19_#t~mem12.base|))] [2018-02-04 03:07:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:23,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:07:23,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:07:23,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:07:23,033 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 16 states. [2018-02-04 03:07:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:23,274 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-02-04 03:07:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:07:23,274 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-02-04 03:07:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:23,275 INFO L225 Difference]: With dead ends: 103 [2018-02-04 03:07:23,275 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 03:07:23,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:07:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 03:07:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-02-04 03:07:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:07:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-04 03:07:23,277 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 37 [2018-02-04 03:07:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:23,277 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-04 03:07:23,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:07:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-04 03:07:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:07:23,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:23,278 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:23,278 INFO L371 AbstractCegarLoop]: === Iteration 17 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:23,278 INFO L82 PathProgramCache]: Analyzing trace with hash -124647017, now seen corresponding path program 1 times [2018-02-04 03:07:23,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:23,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:23,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:23,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:23,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:23,313 INFO L182 omatonBuilderFactory]: Interpolants [3600#false, 3601#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 3602#(not (= 0 |ldv_malloc_#res.base|)), 3603#(not (= 0 |f19_#t~ret2.base|)), 3604#(not (= 0 (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset))), 3605#(not (= 0 |f19_#t~mem4.base|)), 3599#true] [2018-02-04 03:07:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:23,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:07:23,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:07:23,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:07:23,313 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-02-04 03:07:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:23,339 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-04 03:07:23,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:07:23,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 03:07:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:23,340 INFO L225 Difference]: With dead ends: 90 [2018-02-04 03:07:23,340 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 03:07:23,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:07:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 03:07:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-04 03:07:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:07:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-04 03:07:23,344 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2018-02-04 03:07:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:23,344 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-04 03:07:23,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:07:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-04 03:07:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:07:23,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:23,344 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:23,345 INFO L371 AbstractCegarLoop]: === Iteration 18 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:23,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1308023878, now seen corresponding path program 1 times [2018-02-04 03:07:23,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:23,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:23,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:23,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:23,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:23,394 INFO L182 omatonBuilderFactory]: Interpolants [3792#(= 1 (select |#valid| probe_unsafe_19_~a.base)), 3793#(= |#valid| |old(#valid)|), 3794#(= 1 (select |#valid| |f19_undo_#in~a.base|)), 3795#(= 1 (select |#valid| f19_undo_~a.base)), 3790#true, 3791#false] [2018-02-04 03:07:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:23,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:23,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:23,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:23,394 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-02-04 03:07:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:23,485 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-04 03:07:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:07:23,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 03:07:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:23,486 INFO L225 Difference]: With dead ends: 104 [2018-02-04 03:07:23,486 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 03:07:23,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:07:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 03:07:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-02-04 03:07:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 03:07:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-02-04 03:07:23,489 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 44 [2018-02-04 03:07:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:23,489 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-02-04 03:07:23,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-02-04 03:07:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:07:23,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:23,490 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:23,490 INFO L371 AbstractCegarLoop]: === Iteration 19 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1308023877, now seen corresponding path program 1 times [2018-02-04 03:07:23,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:23,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:23,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:23,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:07:23,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:23,555 INFO L182 omatonBuilderFactory]: Interpolants [4004#true, 4005#false, 4006#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 4007#(and (= 0 |f19_#t~ret2.base|) (= 0 |f19_#t~ret2.offset|)), 4008#(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))), 4009#(and (= 0 |f19_#t~mem4.base|) (= |f19_#t~mem4.offset| 0))] [2018-02-04 03:07:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:23,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:07:23,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:07:23,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:23,555 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2018-02-04 03:07:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:23,588 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-04 03:07:23,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:07:23,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 03:07:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:23,589 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:07:23,589 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:07:23,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:07:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 03:07:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:07:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-02-04 03:07:23,592 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 44 [2018-02-04 03:07:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:23,592 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-02-04 03:07:23,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:07:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-02-04 03:07:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:07:23,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:23,593 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:23,593 INFO L371 AbstractCegarLoop]: === Iteration 20 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:23,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1813582502, now seen corresponding path program 1 times [2018-02-04 03:07:23,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:23,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:07:23,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:23,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:23,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:23,622 INFO L182 omatonBuilderFactory]: Interpolants [4202#true, 4203#false, 4204#(<= 3 |f19_#res|), 4205#(<= 3 |probe_unsafe_19_#t~ret10|), 4206#(<= 3 probe_unsafe_19_~ret~0)] [2018-02-04 03:07:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:07:23,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:07:23,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:07:23,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:07:23,623 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 5 states. [2018-02-04 03:07:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:23,639 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 03:07:23,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:07:23,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-02-04 03:07:23,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:23,640 INFO L225 Difference]: With dead ends: 92 [2018-02-04 03:07:23,640 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 03:07:23,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:07:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 03:07:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-02-04 03:07:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:07:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-02-04 03:07:23,643 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-02-04 03:07:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:23,643 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-02-04 03:07:23,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:07:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-02-04 03:07:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:07:23,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:23,644 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:23,644 INFO L371 AbstractCegarLoop]: === Iteration 21 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:23,644 INFO L82 PathProgramCache]: Analyzing trace with hash 182043132, now seen corresponding path program 1 times [2018-02-04 03:07:23,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:23,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:23,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:23,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:23,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:23,689 INFO L182 omatonBuilderFactory]: Interpolants [4389#true, 4390#false, 4391#(= f19_~a.base |f19_#in~a.base|), 4392#(and (= (select |#valid| f19_~a.base) 1) (= f19_~a.base |f19_#in~a.base|)), 4393#(= 1 (select |#valid| |f19_#in~a.base|)), 4394#(= 1 (select |#valid| probe_unsafe_19_~a.base)), 4395#(= 1 (select |#valid| |f19_undo_#in~a.base|)), 4396#(= 1 (select |#valid| f19_undo_~a.base))] [2018-02-04 03:07:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:23,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:23,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:23,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:23,690 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-02-04 03:07:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:23,783 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-04 03:07:23,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:07:23,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 03:07:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:23,784 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:07:23,784 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:07:23,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:07:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:07:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-02-04 03:07:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:07:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-02-04 03:07:23,787 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 46 [2018-02-04 03:07:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:23,787 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-02-04 03:07:23,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-02-04 03:07:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:07:23,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:23,788 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:23,788 INFO L371 AbstractCegarLoop]: === Iteration 22 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:23,788 INFO L82 PathProgramCache]: Analyzing trace with hash 182043133, now seen corresponding path program 1 times [2018-02-04 03:07:23,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:23,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:23,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:23,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:07:23,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:23,912 INFO L182 omatonBuilderFactory]: Interpolants [4592#(or (not (= |f19_#in~a.offset| 0)) (<= 4 (select |#length| |f19_#in~a.base|))), 4593#(and (<= 4 (select |#length| probe_unsafe_19_~a.base)) (= 0 probe_unsafe_19_~a.offset)), 4594#(and (= 0 |f19_undo_#in~a.offset|) (<= 4 (select |#length| |f19_undo_#in~a.base|))), 4595#(and (<= 4 (select |#length| f19_undo_~a.base)) (= f19_undo_~a.offset 0)), 4585#true, 4586#false, 4587#(= 0 |entry_point_~#a19~0.offset|), 4588#(= 0 |probe_unsafe_19_#in~a.offset|), 4589#(= 0 probe_unsafe_19_~a.offset), 4590#(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))), 4591#(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))))] [2018-02-04 03:07:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:23,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:07:23,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:07:23,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:07:23,913 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-02-04 03:07:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:24,012 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-04 03:07:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:07:24,012 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-04 03:07:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:24,013 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:07:24,013 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:07:24,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:07:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:07:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 03:07:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:07:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-04 03:07:24,015 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2018-02-04 03:07:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:24,015 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-04 03:07:24,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:07:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-04 03:07:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:07:24,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:24,016 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:24,016 INFO L371 AbstractCegarLoop]: === Iteration 23 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1348369820, now seen corresponding path program 1 times [2018-02-04 03:07:24,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:24,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:24,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:24,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:07:24,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:24,083 INFO L182 omatonBuilderFactory]: Interpolants [4800#(= 0 (select (select |#memory_$Pointer$.offset| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|)), 4801#(= 0 (select (select |#memory_$Pointer$.offset| f19_undo_~a.base) f19_undo_~a.offset)), 4802#(= |f19_undo_#t~mem5.offset| 0), 4792#true, 4793#false, 4794#(and (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 4795#(= 0 |ldv_malloc_#t~malloc1.offset|), 4796#(= 0 |ldv_malloc_#res.offset|), 4797#(and (= 0 |f19_#t~ret2.offset|) (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 4798#(= 0 (select (select |#memory_$Pointer$.offset| |f19_#in~a.base|) |f19_#in~a.offset|)), 4799#(= 0 (select (select |#memory_$Pointer$.offset| probe_unsafe_19_~a.base) probe_unsafe_19_~a.offset))] [2018-02-04 03:07:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:24,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:07:24,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:07:24,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:07:24,084 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 11 states. [2018-02-04 03:07:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:24,225 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 03:07:24,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:07:24,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 03:07:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:24,226 INFO L225 Difference]: With dead ends: 95 [2018-02-04 03:07:24,226 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 03:07:24,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:07:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 03:07:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-02-04 03:07:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:07:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-02-04 03:07:24,228 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2018-02-04 03:07:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:24,229 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-02-04 03:07:24,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:07:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-02-04 03:07:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:07:24,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:24,229 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:24,230 INFO L371 AbstractCegarLoop]: === Iteration 24 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1348369821, now seen corresponding path program 1 times [2018-02-04 03:07:24,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:24,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:24,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:24,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:07:24,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:24,325 INFO L182 omatonBuilderFactory]: Interpolants [5008#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |f19_#in~a.base|) |f19_#in~a.offset|))), 5009#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) probe_unsafe_19_~a.offset))), 5010#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|))), 5011#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| f19_undo_~a.base) f19_undo_~a.offset))), 5012#(= 1 (select |#valid| |f19_undo_#t~mem5.base|)), 5002#true, 5003#false, 5004#(and (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 5005#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 5006#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 5007#(and (= 1 (select |#valid| |f19_#t~ret2.base|)) (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|))] [2018-02-04 03:07:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:24,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:07:24,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:07:24,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:07:24,325 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 11 states. [2018-02-04 03:07:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:24,496 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-04 03:07:24,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:07:24,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 03:07:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:24,496 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:07:24,496 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:07:24,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:07:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:07:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 03:07:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:07:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-04 03:07:24,498 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 47 [2018-02-04 03:07:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:24,498 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-04 03:07:24,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:07:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-04 03:07:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:07:24,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:24,499 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:24,499 INFO L371 AbstractCegarLoop]: === Iteration 25 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash -32858344, now seen corresponding path program 1 times [2018-02-04 03:07:24,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:24,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:24,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:24,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:07:24,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:24,814 INFO L182 omatonBuilderFactory]: Interpolants [5216#(= |#valid| |old(#valid)|), 5217#(and (= |#valid| |old(#valid)|) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 5218#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 5219#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 5220#(and (not (= 0 |probe_unsafe_19_#t~ret7.base|)) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= 0 (select |old(#valid)| |probe_unsafe_19_#t~ret7.base|))), 5221#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))), 5222#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 5223#(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|)), 5224#(and (= (select |#valid| f19_~a.base) 1) (= (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|)), 5225#(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))), 5226#(or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) (= 1 (select |#valid| |probe_unsafe_19_#in~a.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))) (and (or (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= probe_unsafe_19_~a.offset 0)) (not (= |probe_unsafe_19_#in~a.offset| 0)))), 5227#(or (= 0 (select |old(#valid)| |probe_unsafe_19_#in~a.base|)) (and (not (= 0 |probe_unsafe_19_#t~mem12.base|)) (= 1 (select (store |#valid| |probe_unsafe_19_#t~mem12.base| 0) |probe_unsafe_19_#in~a.base|))) (not (= |probe_unsafe_19_#in~a.offset| 0))), 5228#(or (= 0 (select |old(#valid)| |probe_unsafe_19_#in~a.base|)) (= 1 (select |#valid| |probe_unsafe_19_#in~a.base|)) (not (= |probe_unsafe_19_#in~a.offset| 0))), 5229#(= 1 (select |#valid| |entry_point_~#a19~0.base|)), 5230#(= 1 (select |#valid| |disconnect_19_#in~a.base|)), 5231#(= (select |#valid| disconnect_19_~a.base) 1), 5213#true, 5214#false, 5215#(and (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1))] [2018-02-04 03:07:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:24,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:07:24,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:07:24,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:07:24,815 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand 19 states. [2018-02-04 03:07:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:25,396 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-02-04 03:07:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:07:25,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-02-04 03:07:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:25,397 INFO L225 Difference]: With dead ends: 110 [2018-02-04 03:07:25,397 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 03:07:25,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:07:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 03:07:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-02-04 03:07:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 03:07:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-02-04 03:07:25,400 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 46 [2018-02-04 03:07:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:25,400 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-02-04 03:07:25,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:07:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-02-04 03:07:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:07:25,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:25,400 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:25,400 INFO L371 AbstractCegarLoop]: === Iteration 26 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash -32858343, now seen corresponding path program 1 times [2018-02-04 03:07:25,401 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:25,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:07:25,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:25,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:07:25,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:25,520 INFO L182 omatonBuilderFactory]: Interpolants [5477#true, 5478#false, 5479#(= 0 |entry_point_~#a19~0.offset|), 5480#(and (or (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= probe_unsafe_19_~a.offset 0)) (or (= probe_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|) (not (= probe_unsafe_19_~a.offset 0)))), 5481#(= f19_~a.base |f19_#in~a.base|), 5482#(and (or (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= probe_unsafe_19_~a.offset 0)) (or (not (= probe_unsafe_19_~a.offset 0)) (<= (select |#length| probe_unsafe_19_~a.base) (select |#length| |probe_unsafe_19_#in~a.base|)))), 5483#(or (not (= |probe_unsafe_19_#in~a.offset| 0)) (<= 8 (select |#length| |probe_unsafe_19_#in~a.base|))), 5484#(and (= 0 |entry_point_~#a19~0.offset|) (<= 8 (select |#length| |entry_point_~#a19~0.base|))), 5485#(and (= 0 |disconnect_19_#in~a.offset|) (<= 8 (select |#length| |disconnect_19_#in~a.base|))), 5486#(and (= disconnect_19_~a.offset 0) (<= 8 (select |#length| disconnect_19_~a.base)))] [2018-02-04 03:07:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:07:25,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:07:25,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:07:25,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:07:25,521 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 10 states. [2018-02-04 03:07:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:25,608 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-02-04 03:07:25,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:07:25,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-02-04 03:07:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:25,609 INFO L225 Difference]: With dead ends: 119 [2018-02-04 03:07:25,609 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:07:25,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:07:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:07:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-02-04 03:07:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 03:07:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-02-04 03:07:25,611 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 46 [2018-02-04 03:07:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:25,612 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-02-04 03:07:25,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:07:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-02-04 03:07:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:07:25,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:25,612 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:25,612 INFO L371 AbstractCegarLoop]: === Iteration 27 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:25,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1018608690, now seen corresponding path program 1 times [2018-02-04 03:07:25,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:25,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:07:25,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:25,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:07:25,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:25,644 INFO L182 omatonBuilderFactory]: Interpolants [5728#(<= 3 |probe_unsafe_19_#t~ret10|), 5729#(<= 3 probe_unsafe_19_~ret~0), 5730#(<= 3 |probe_unsafe_19_#res|), 5731#(<= 3 |entry_point_#t~ret14|), 5732#(<= 3 entry_point_~ret~1), 5725#true, 5726#false, 5727#(<= 3 |f19_#res|)] [2018-02-04 03:07:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:07:25,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:25,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:25,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:25,645 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 8 states. [2018-02-04 03:07:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:25,684 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-02-04 03:07:25,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:07:25,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-04 03:07:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:25,685 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:07:25,685 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:07:25,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:07:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:07:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-04 03:07:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:07:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-04 03:07:25,688 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 47 [2018-02-04 03:07:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:25,689 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-04 03:07:25,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-04 03:07:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:07:25,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:25,689 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:25,690 INFO L371 AbstractCegarLoop]: === Iteration 28 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash -301259046, now seen corresponding path program 1 times [2018-02-04 03:07:25,693 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:25,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:25,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:25,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 03:07:25,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:25,878 INFO L182 omatonBuilderFactory]: Interpolants [5965#true, 5966#false, 5967#(= 0 |entry_point_~#a19~0.offset|), 5968#(and (or (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (not (= probe_unsafe_19_~a.offset 0))) (or (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= probe_unsafe_19_~a.offset 0))), 5969#(and (or (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= probe_unsafe_19_~a.offset 0)) (or (and (<= (+ probe_unsafe_19_~a.offset 8) (select |#length| probe_unsafe_19_~a.base)) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base)) (not (= probe_unsafe_19_~a.offset 0))) (= 1 (select |#valid| probe_unsafe_19_~a.base))), 5970#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5971#(and (= (select |old(#length)| f19_~a.base) (select |#length| f19_~a.base)) (= |#valid| |old(#valid)|) (= f19_~a.base |f19_#in~a.base|)), 5972#(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|))), 5973#(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|))))), 5974#(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|)), 5975#(or (= 0 (select |old(#valid)| |f19_#in~a.base|)) (<= (select |old(#length)| |f19_#in~a.base|) (select |#length| |f19_#in~a.base|))), 5976#(or (not (= |probe_unsafe_19_#in~a.offset| 0)) (<= 8 (select |#length| |probe_unsafe_19_#in~a.base|))), 5977#(and (= 0 |entry_point_~#a19~0.offset|) (<= 8 (select |#length| |entry_point_~#a19~0.base|))), 5978#(and (= 0 |disconnect_19_#in~a.offset|) (<= 8 (select |#length| |disconnect_19_#in~a.base|))), 5979#(and (= disconnect_19_~a.offset 0) (<= 8 (select |#length| disconnect_19_~a.base)))] [2018-02-04 03:07:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:25,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:07:25,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:07:25,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:07:25,878 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 15 states. [2018-02-04 03:07:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:26,208 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-02-04 03:07:26,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:07:26,208 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-02-04 03:07:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:26,209 INFO L225 Difference]: With dead ends: 111 [2018-02-04 03:07:26,209 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 03:07:26,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:07:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 03:07:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 03:07:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 03:07:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-02-04 03:07:26,211 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 50 [2018-02-04 03:07:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:26,211 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-02-04 03:07:26,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:07:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-02-04 03:07:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:07:26,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:26,212 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:26,212 INFO L371 AbstractCegarLoop]: === Iteration 29 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:26,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1444311673, now seen corresponding path program 1 times [2018-02-04 03:07:26,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:26,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:26,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:26,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:07:26,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:26,537 INFO L182 omatonBuilderFactory]: Interpolants [6240#(or (and (not (= 0 |probe_unsafe_19_#t~mem12.base|)) (= (store |#valid| |probe_unsafe_19_#t~mem12.base| (select |old(#valid)| |probe_unsafe_19_#t~mem12.base|)) |old(#valid)|) (= (select (store |#valid| |probe_unsafe_19_#t~mem12.base| 0) |probe_unsafe_19_#t~mem12.base|) (select |old(#valid)| |probe_unsafe_19_#t~mem12.base|))) (not (= |probe_unsafe_19_#in~a.offset| 0))), 6241#(or (= |#valid| |old(#valid)|) (not (= |probe_unsafe_19_#in~a.offset| 0))), 6242#(and (= (select |old(#valid)| |entry_point_~#a19~0.base|) (select (store |#valid| |entry_point_~#a19~0.base| 0) |entry_point_~#a19~0.base|)) (= |old(#valid)| (store (store |#valid| |entry_point_~#a19~0.base| 0) |entry_point_~#a19~0.base| (select |old(#valid)| |entry_point_~#a19~0.base|)))), 6226#true, 6227#false, 6228#(= |#valid| |old(#valid)|), 6229#(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|)))), 6230#(and (= |#valid| |old(#valid)|) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 6231#(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|))), 6232#(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|))), 6233#(and (not (= 0 |probe_unsafe_19_#t~ret7.base|)) (= (store |#valid| |probe_unsafe_19_#t~ret7.base| (select |old(#valid)| |probe_unsafe_19_#t~ret7.base|)) |old(#valid)|) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= 0 (select |old(#valid)| |probe_unsafe_19_#t~ret7.base|))), 6234#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= (store |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))), 6235#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6236#(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|)), 6237#(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|)), 6238#(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))), 6239#(or (and (or (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= probe_unsafe_19_~a.offset 0)) (not (= |probe_unsafe_19_#in~a.offset| 0))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) (= (store |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))))] [2018-02-04 03:07:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:07:26,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:07:26,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:07:26,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:07:26,538 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 17 states. [2018-02-04 03:07:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:26,924 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-02-04 03:07:26,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:07:26,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-04 03:07:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:26,925 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:07:26,925 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 03:07:26,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:07:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 03:07:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 03:07:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:07:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-02-04 03:07:26,927 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 48 [2018-02-04 03:07:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:26,928 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-02-04 03:07:26,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:07:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-02-04 03:07:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:07:26,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:26,928 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:26,928 INFO L371 AbstractCegarLoop]: === Iteration 30 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:26,928 INFO L82 PathProgramCache]: Analyzing trace with hash -612693804, now seen corresponding path program 1 times [2018-02-04 03:07:26,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:26,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:27,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:27,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 03:07:27,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:27,072 INFO L182 omatonBuilderFactory]: Interpolants [6464#true, 6465#false, 6466#(= 1 (select |#valid| probe_unsafe_19_~a.base)), 6467#(= |#valid| |old(#valid)|), 6468#(and (= |#valid| |old(#valid)|) (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 6469#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 6470#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 6471#(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|)), 6472#(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|)))), 6473#(and (not (= probe_unsafe_19_~a.base (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) probe_unsafe_19_~a.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) probe_unsafe_19_~a.offset)))), 6474#(and (= f19_undo_~a.base |f19_undo_#in~a.base|) (= f19_undo_~a.offset |f19_undo_#in~a.offset|)), 6475#(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|))), 6476#(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|)))] [2018-02-04 03:07:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:27,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:07:27,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:07:27,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:07:27,072 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 13 states. [2018-02-04 03:07:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:27,324 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-02-04 03:07:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:07:27,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-02-04 03:07:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:27,325 INFO L225 Difference]: With dead ends: 92 [2018-02-04 03:07:27,325 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 03:07:27,326 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-04 03:07:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 03:07:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 03:07:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 03:07:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-02-04 03:07:27,327 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 51 [2018-02-04 03:07:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:27,328 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-02-04 03:07:27,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:07:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-02-04 03:07:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:07:27,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:27,328 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:27,328 INFO L371 AbstractCegarLoop]: === Iteration 31 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash -749095891, now seen corresponding path program 1 times [2018-02-04 03:07:27,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:27,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:07:27,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:27,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:07:27,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:07:27,703 INFO L182 omatonBuilderFactory]: Interpolants [6688#(or (= 0 (select (select |#memory_$Pointer$.offset| |probe_unsafe_19_#in~a.base|) 4)) (not (= |probe_unsafe_19_#in~a.offset| 0))), 6689#(and (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a19~0.base|) 4)) (= 0 |entry_point_~#a19~0.offset|)), 6690#(and (= 0 (select (select |#memory_$Pointer$.offset| |disconnect_19_#in~a.base|) 4)) (= 0 |disconnect_19_#in~a.offset|)), 6691#(and (= disconnect_19_~a.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4)))), 6692#(= |disconnect_19_#t~mem13.offset| 0), 6675#true, 6676#false, 6677#(= 0 |entry_point_~#a19~0.offset|), 6678#(and (or (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (not (= probe_unsafe_19_~a.offset 0))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 6679#(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))))), 6680#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#t~malloc1.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 6681#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#res.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 6682#(and (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (or (and (= 0 |probe_unsafe_19_#t~ret7.offset|) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base)) (not (= probe_unsafe_19_~a.offset 0)))), 6683#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base)) (not (= probe_unsafe_19_~a.offset 0))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 6684#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 6685#(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|)), 6686#(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|)), 6687#(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))))] [2018-02-04 03:07:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:07:27,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:07:27,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:07:27,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:07:27,704 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 18 states. [2018-02-04 03:07:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:28,041 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 03:07:28,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:07:28,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-02-04 03:07:28,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:28,042 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:07:28,042 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:07:28,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:07:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:07:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-04 03:07:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:07:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-02-04 03:07:28,045 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 51 [2018-02-04 03:07:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:28,045 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-02-04 03:07:28,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:07:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-02-04 03:07:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:07:28,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:28,046 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:28,046 INFO L371 AbstractCegarLoop]: === Iteration 32 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:28,046 INFO L82 PathProgramCache]: Analyzing trace with hash -749095890, now seen corresponding path program 1 times [2018-02-04 03:07:28,047 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:28,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:28,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:28,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:07:28,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:28,645 INFO L182 omatonBuilderFactory]: Interpolants [6912#(or (not (= |probe_unsafe_19_#in~a.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |probe_unsafe_19_#in~a.base|) 4)))), 6913#(and (= 0 |entry_point_~#a19~0.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) 4)))), 6914#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) 4))) (= 0 |disconnect_19_#in~a.offset|)), 6915#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4)))) (= disconnect_19_~a.offset 0)), 6916#(= 1 (select |#valid| |disconnect_19_#t~mem13.base|)), 6895#true, 6896#false, 6897#(= 0 |entry_point_~#a19~0.offset|), 6898#(and (or (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (not (= probe_unsafe_19_~a.offset 0))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 6899#(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))))), 6900#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 6901#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 6902#(and (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (or (and (= 1 (select |#valid| |probe_unsafe_19_#t~ret7.base|)) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base)) (not (= probe_unsafe_19_~a.offset 0)))), 6903#(and (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (or (and (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))) (not (= probe_unsafe_19_~a.offset 0)))), 6904#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6905#(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|)), 6906#(= |#valid| |old(#valid)|), 6907#(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|)), 6908#(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|))))), 6909#(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|)), 6910#(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|)), 6911#(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|)))))] [2018-02-04 03:07:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:28,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:07:28,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:07:28,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:07:28,646 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 22 states. [2018-02-04 03:07:29,023 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-02-04 03:07:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:29,535 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 03:07:29,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:07:29,536 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-02-04 03:07:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:29,536 INFO L225 Difference]: With dead ends: 92 [2018-02-04 03:07:29,536 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 03:07:29,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:07:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 03:07:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-02-04 03:07:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:07:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-02-04 03:07:29,539 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 51 [2018-02-04 03:07:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:29,540 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-02-04 03:07:29,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:07:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-02-04 03:07:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:07:29,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:29,540 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:29,540 INFO L371 AbstractCegarLoop]: === Iteration 33 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1813638726, now seen corresponding path program 1 times [2018-02-04 03:07:29,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:29,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:30,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:30,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:07:30,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:30,016 INFO L182 omatonBuilderFactory]: Interpolants [7136#(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|)), 7137#(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|)), 7138#(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|))))), 7139#(and (not (= (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)) (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) probe_unsafe_19_~a.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) probe_unsafe_19_~a.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))), 7140#(and (= |#valid| |old(#valid)|) (= f19_undo_~a.base |f19_undo_#in~a.base|) (= f19_undo_~a.offset |f19_undo_#in~a.offset|)), 7141#(and (= (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|) |f19_undo_#t~mem5.base|) (= |#valid| |old(#valid)|)), 7142#(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|))), 7143#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))), 7144#(= 1 (select |#valid| |probe_unsafe_19_#t~mem12.base|)), 7122#true, 7123#false, 7124#(= 0 |entry_point_~#a19~0.offset|), 7125#(= 0 |probe_unsafe_19_#in~a.offset|), 7126#(= probe_unsafe_19_~a.offset 0), 7127#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 7128#(= (select |#valid| |ldv_malloc_#res.base|) 1), 7129#(and (= 1 (select |#valid| |probe_unsafe_19_#t~ret7.base|)) (= probe_unsafe_19_~a.offset 0)), 7130#(and (= probe_unsafe_19_~a.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))), 7131#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7132#(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|)), 7133#(= |#valid| |old(#valid)|), 7134#(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|)), 7135#(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|)))))] [2018-02-04 03:07:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:30,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:07:30,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:07:30,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:07:30,017 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 23 states. [2018-02-04 03:07:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:30,676 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-02-04 03:07:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:07:30,677 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-04 03:07:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:30,677 INFO L225 Difference]: With dead ends: 90 [2018-02-04 03:07:30,677 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 03:07:30,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:07:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 03:07:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-04 03:07:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:07:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-02-04 03:07:30,680 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 52 [2018-02-04 03:07:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:30,680 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-02-04 03:07:30,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:07:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-02-04 03:07:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:07:30,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:30,681 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:30,681 INFO L371 AbstractCegarLoop]: === Iteration 34 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1679349496, now seen corresponding path program 1 times [2018-02-04 03:07:30,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:30,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:30,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:30,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:07:30,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:30,709 INFO L182 omatonBuilderFactory]: Interpolants [7349#true, 7350#false, 7351#(= 0 |probe_unsafe_19_#res|), 7352#(= 0 |entry_point_#t~ret14|), 7353#(= entry_point_~ret~1 0)] [2018-02-04 03:07:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:30,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:07:30,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:07:30,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:07:30,709 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 5 states. [2018-02-04 03:07:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:30,717 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-04 03:07:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:07:30,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-02-04 03:07:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:30,718 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:07:30,718 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:07:30,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:07:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:07:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-02-04 03:07:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:07:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-04 03:07:30,721 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 52 [2018-02-04 03:07:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:30,721 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-04 03:07:30,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:07:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-04 03:07:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:07:30,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:30,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] [2018-02-04 03:07:30,722 INFO L371 AbstractCegarLoop]: === Iteration 35 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1775270255, now seen corresponding path program 1 times [2018-02-04 03:07:30,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:30,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:31,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:31,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:07:31,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:31,235 INFO L182 omatonBuilderFactory]: Interpolants [7552#(or (not (= |probe_unsafe_19_#in~a.offset| 0)) (and (= 1 (select |#valid| |probe_unsafe_19_#in~a.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe_unsafe_19_#in~a.base|) 4))))), 7553#(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|))), 7554#(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|)), 7555#(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))))), 7556#(and (= 1 (select |#valid| disconnect_19_~a.base)) (not (= disconnect_19_~a.base |disconnect_19_#t~mem13.base|))), 7557#(= 1 (select |#valid| disconnect_19_~a.base)), 7558#(= 1 (select |#valid| |f19_undo_#in~a.base|)), 7559#(= 1 (select |#valid| f19_undo_~a.base)), 7538#true, 7539#false, 7540#(and (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1)), 7541#(= |#valid| |old(#valid)|), 7542#(and (or (not (= probe_unsafe_19_~a.offset 0)) (and (= |#valid| |old(#valid)|) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 7543#(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)|)))), 7544#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7545#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7546#(and (or (and (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (= 0 (select |old(#valid)| |probe_unsafe_19_#t~ret7.base|))) (not (= probe_unsafe_19_~a.offset 0))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 7547#(and (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base)) (not (= probe_unsafe_19_~a.offset 0))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 7548#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 7549#(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|)), 7550#(and (= (select |#valid| f19_~a.base) 1) (= (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|)), 7551#(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)))))] [2018-02-04 03:07:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:31,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:07:31,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:07:31,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:07:31,236 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 22 states. [2018-02-04 03:07:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:31,991 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-02-04 03:07:31,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:07:31,991 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-02-04 03:07:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:31,991 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:07:31,991 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:07:31,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:07:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:07:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-02-04 03:07:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 03:07:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-02-04 03:07:31,993 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 55 [2018-02-04 03:07:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:31,993 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-02-04 03:07:31,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:07:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-02-04 03:07:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:07:31,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:31,994 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:31,994 INFO L371 AbstractCegarLoop]: === Iteration 36 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1775270256, now seen corresponding path program 1 times [2018-02-04 03:07:31,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:32,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:32,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:32,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:07:32,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:32,076 INFO L182 omatonBuilderFactory]: Interpolants [7792#(= 0 |disconnect_19_#in~a.offset|), 7793#(= 0 disconnect_19_~a.offset), 7794#(and (= 0 disconnect_19_~a.offset) (<= (+ disconnect_19_~a.offset 8) (select |#length| disconnect_19_~a.base))), 7795#(and (<= 8 (select |#length| |f19_undo_#in~a.base|)) (= 0 |f19_undo_#in~a.offset|)), 7796#(and (<= 8 (select |#length| f19_undo_~a.base)) (= f19_undo_~a.offset 0)), 7789#true, 7790#false, 7791#(= 0 |entry_point_~#a19~0.offset|)] [2018-02-04 03:07:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:07:32,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:07:32,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:07:32,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:07:32,076 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 8 states. [2018-02-04 03:07:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:32,111 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-04 03:07:32,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:07:32,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-04 03:07:32,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:32,112 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:07:32,112 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:07:32,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:07:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:07:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-04 03:07:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:07:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-04 03:07:32,114 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 55 [2018-02-04 03:07:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:32,114 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-04 03:07:32,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:07:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-04 03:07:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:07:32,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:32,115 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:32,115 INFO L371 AbstractCegarLoop]: === Iteration 37 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash -801196919, now seen corresponding path program 1 times [2018-02-04 03:07:32,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:32,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:32,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:07:32,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 03:07:32,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:32,240 INFO L182 omatonBuilderFactory]: Interpolants [7985#true, 7986#false, 7987#(and (= probe_unsafe_19_~a.offset |probe_unsafe_19_#in~a.offset|) (= probe_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|)), 7988#(and (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 7989#(= 0 |ldv_malloc_#t~malloc1.offset|), 7990#(= 0 |ldv_malloc_#res.offset|), 7991#(and (= 0 |f19_#t~ret2.offset|) (= f19_~a.offset |f19_#in~a.offset|) (= f19_~a.base |f19_#in~a.base|)), 7992#(= 0 (select (select |#memory_$Pointer$.offset| |f19_#in~a.base|) |f19_#in~a.offset|)), 7993#(= 0 (select (select |#memory_$Pointer$.offset| |probe_unsafe_19_#in~a.base|) |probe_unsafe_19_#in~a.offset|)), 7994#(= 0 (select (select |#memory_$Pointer$.offset| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|)), 7995#(= 0 (select (select |#memory_$Pointer$.offset| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|)), 7996#(= 0 (select (select |#memory_$Pointer$.offset| disconnect_19_~a.base) disconnect_19_~a.offset)), 7997#(= 0 (select (select |#memory_$Pointer$.offset| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|)), 7998#(= 0 (select (select |#memory_$Pointer$.offset| f19_undo_~a.base) f19_undo_~a.offset)), 7999#(= |f19_undo_#t~mem5.offset| 0)] [2018-02-04 03:07:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:07:32,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:07:32,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:07:32,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:07:32,241 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 15 states. [2018-02-04 03:07:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:32,444 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-02-04 03:07:32,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:07:32,444 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 03:07:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:32,445 INFO L225 Difference]: With dead ends: 90 [2018-02-04 03:07:32,445 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 03:07:32,445 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-04 03:07:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 03:07:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-04 03:07:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:07:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-04 03:07:32,447 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 56 [2018-02-04 03:07:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:32,448 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-04 03:07:32,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:07:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-04 03:07:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:07:32,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:32,448 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:32,448 INFO L371 AbstractCegarLoop]: === Iteration 38 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash -801196918, now seen corresponding path program 1 times [2018-02-04 03:07:32,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:32,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:33,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:33,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:07:33,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:33,062 INFO L182 omatonBuilderFactory]: Interpolants [8194#true, 8195#false, 8196#(= 0 |entry_point_~#a19~0.offset|), 8197#(and (or (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base) (not (= probe_unsafe_19_~a.offset 0))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 8198#(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))))), 8199#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 8200#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 8201#(and (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (or (and (= 1 (select |#valid| |probe_unsafe_19_#t~ret7.base|)) (= |probe_unsafe_19_#in~a.base| probe_unsafe_19_~a.base)) (not (= probe_unsafe_19_~a.offset 0)))), 8202#(and (or (not (= probe_unsafe_19_~a.offset 0)) (and (= probe_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))))) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 8203#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 8204#(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|)), 8205#(= |#valid| |old(#valid)|), 8206#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8207#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 8208#(and (= 1 (select |#valid| |f19_#t~ret2.base|)) (= f19_~a.offset |f19_#in~a.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| |f19_#t~ret2.base|) 0) (= f19_~a.base |f19_#in~a.base|)), 8209#(and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| f19_~a.base) f19_~a.offset)) 0) (= (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|)), 8210#(and (= 1 (select |#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|)) 0) (= (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))), 8211#(or (and (not (= (select (select |#memory_$Pointer$.base| |probe_unsafe_19_#in~a.base|) |probe_unsafe_19_#in~a.offset|) (select (select |#memory_$Pointer$.base| |probe_unsafe_19_#in~a.base|) 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |probe_unsafe_19_#in~a.base|) |probe_unsafe_19_#in~a.offset|)))) (not (= |probe_unsafe_19_#in~a.offset| 0))), 8212#(and (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|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_~#a19~0.base|) |entry_point_~#a19~0.offset|)))), 8213#(and (not (= (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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_19_#in~a.base|) |disconnect_19_#in~a.offset|))) (= 0 |disconnect_19_#in~a.offset|)), 8214#(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) (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) (+ disconnect_19_~a.offset 4))))), 8215#(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)))), 8216#(and (= disconnect_19_~a.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_19_~a.base) disconnect_19_~a.offset)))), 8217#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |f19_undo_#in~a.base|) |f19_undo_#in~a.offset|))), 8218#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| f19_undo_~a.base) f19_undo_~a.offset))), 8219#(= 1 (select |#valid| |f19_undo_#t~mem5.base|))] [2018-02-04 03:07:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:33,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:07:33,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:07:33,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:07:33,063 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 26 states. [2018-02-04 03:07:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:33,607 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-04 03:07:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:07:33,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-02-04 03:07:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:33,608 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:07:33,608 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:07:33,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:07:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:07:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-04 03:07:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 03:07:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-04 03:07:33,610 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 56 [2018-02-04 03:07:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:33,610 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-04 03:07:33,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:07:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-04 03:07:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:07:33,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:33,610 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:07:33,610 INFO L371 AbstractCegarLoop]: === Iteration 39 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash -101964777, now seen corresponding path program 1 times [2018-02-04 03:07:33,611 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:07:33,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:07:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:33,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:07:33,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:07:33,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:07:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:33,915 INFO L182 omatonBuilderFactory]: Interpolants [8428#true, 8429#false, 8430#(and (= 0 |entry_point_~#a19~0.offset|) (= (select |#valid| |entry_point_~#a19~0.base|) 1)), 8431#(= |#valid| |old(#valid)|), 8432#(and (= |#valid| |old(#valid)|) (= probe_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset)), 8433#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 8434#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 8435#(and (not (= 0 |probe_unsafe_19_#t~ret7.base|)) (= probe_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= 0 (select |old(#valid)| |probe_unsafe_19_#t~ret7.base|))), 8436#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) (= probe_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|) (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4))))), 8437#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 8438#(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|)), 8439#(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)) (= f19_~a.base |f19_#in~a.base|)), 8440#(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 (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))), 8441#(or (and (or (= |probe_unsafe_19_#in~a.offset| probe_unsafe_19_~a.offset) (= probe_unsafe_19_~a.offset 0)) (not (= |probe_unsafe_19_#in~a.offset| 0))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))) (= probe_unsafe_19_~a.base |probe_unsafe_19_#in~a.base|) (not (= 0 (select (select |#memory_$Pointer$.base| probe_unsafe_19_~a.base) (+ probe_unsafe_19_~a.offset 4)))))), 8442#(or (= 0 (select |old(#valid)| |probe_unsafe_19_#in~a.base|)) (and (not (= 0 |probe_unsafe_19_#t~mem12.base|)) (= 1 (select (store |#valid| |probe_unsafe_19_#t~mem12.base| 0) |probe_unsafe_19_#in~a.base|))) (not (= |probe_unsafe_19_#in~a.offset| 0))), 8443#(or (= 0 (select |old(#valid)| |probe_unsafe_19_#in~a.base|)) (= 1 (select |#valid| |probe_unsafe_19_#in~a.base|)) (not (= |probe_unsafe_19_#in~a.offset| 0))), 8444#(= 1 (select |#valid| |entry_point_~#a19~0.base|)), 8445#(= 1 (select |#valid| |disconnect_19_#in~a.base|)), 8446#(= (select |#valid| disconnect_19_~a.base) 1)] [2018-02-04 03:07:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:07:33,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:07:33,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:07:33,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:07:33,916 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 19 states. [2018-02-04 03:07:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:07:34,391 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-04 03:07:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:07:34,392 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-02-04 03:07:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:07:34,392 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:07:34,392 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:07:34,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:07:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:07:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-02-04 03:07:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:07:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-04 03:07:34,394 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 61 [2018-02-04 03:07:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:07:34,394 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-04 03:07:34,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:07:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-04 03:07:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:07:34,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:07:34,394 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] [2018-02-04 03:07:34,395 INFO L371 AbstractCegarLoop]: === Iteration 40 === [disconnect_19Err0RequiresViolation, disconnect_19Err1RequiresViolation, disconnect_19Err2RequiresViolation, disconnect_19Err3RequiresViolation, probe_unsafe_19Err7RequiresViolation, probe_unsafe_19Err0RequiresViolation, probe_unsafe_19Err2RequiresViolation, probe_unsafe_19Err3RequiresViolation, probe_unsafe_19Err1RequiresViolation, probe_unsafe_19Err6RequiresViolation, probe_unsafe_19Err4RequiresViolation, probe_unsafe_19Err5RequiresViolation, f19_undoErr1RequiresViolation, f19_undoErr2RequiresViolation, f19_undoErr3RequiresViolation, f19_undoErr0RequiresViolation, mainErr0EnsuresViolation, f19Err2RequiresViolation, f19Err3RequiresViolation, f19Err0RequiresViolation, f19Err1RequiresViolation]=== [2018-02-04 03:07:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1134059184, now seen corresponding path program 1 times [2018-02-04 03:07:34,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:07:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:07:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:07:34,441 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:07:34,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:07:34 BoogieIcfgContainer [2018-02-04 03:07:34,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:07:34,470 INFO L168 Benchmark]: Toolchain (without parser) took 16020.17 ms. Allocated memory was 404.2 MB in the beginning and 882.9 MB in the end (delta: 478.7 MB). Free memory was 361.1 MB in the beginning and 589.8 MB in the end (delta: -228.8 MB). Peak memory consumption was 249.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:07:34,471 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:07:34,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.99 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 347.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:07:34,471 INFO L168 Benchmark]: Boogie Preprocessor took 30.94 ms. Allocated memory is still 404.2 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:07:34,471 INFO L168 Benchmark]: RCFGBuilder took 248.47 ms. Allocated memory is still 404.2 MB. Free memory was 346.5 MB in the beginning and 320.5 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-02-04 03:07:34,472 INFO L168 Benchmark]: TraceAbstraction took 15571.11 ms. Allocated memory was 404.2 MB in the beginning and 882.9 MB in the end (delta: 478.7 MB). Free memory was 320.5 MB in the beginning and 589.8 MB in the end (delta: -269.3 MB). Peak memory consumption was 209.4 MB. Max. memory is 5.3 GB. [2018-02-04 03:07:34,473 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.11 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.99 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 347.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.94 ms. Allocated memory is still 404.2 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 248.47 ms. Allocated memory is still 404.2 MB. Free memory was 346.5 MB in the beginning and 320.5 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15571.11 ms. Allocated memory was 404.2 MB in the beginning and 882.9 MB in the end (delta: 478.7 MB). Free memory was 320.5 MB in the beginning and 589.8 MB in the end (delta: -269.3 MB). Peak memory consumption was 209.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1492] CALL entry_point() [L1483] FCALL struct A19 a19; VAL [a19={13:0}] [L1484] CALL, EXPR probe_unsafe_19(&a19) VAL [a={13:0}] [L1455] int ret = - -3; VAL [a={13:0}, a={13:0}, ret=3] [L1457] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={10:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={10:0}, malloc(size)={10:0}, size=4] [L1457] EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={10:0}, ret=3] [L1457] FCALL a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={10:0}, ret=3] [L1458] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={10:0}, ret=3] [L1458] COND FALSE !(!a->q) [L1460] CALL, EXPR f19(a) VAL [a={13:0}] [L1440] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={11:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={11:0}, malloc(size)={11:0}, size=4] [L1440] EXPR ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={11:0}] [L1440] FCALL a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={13:0}, a={13:0}, ldv_malloc(sizeof(int))={11:0}] [L1441] FCALL a->p VAL [a={13:0}, a={13:0}, a->p={11:0}] [L1441] COND TRUE a->p [L1442] RET return 0; VAL [\result=0, a={13:0}, a={13:0}] [L1460] EXPR f19(a) VAL [a={13:0}, a={13:0}, f19(a)=0, ret=3] [L1460] ret = f19(a) [L1461] COND FALSE !(\read(ret)) VAL [a={13:0}, a={13:0}, ret=0] [L1464] CALL, EXPR g19() [L1451] RET return __VERIFIER_nondet_int(); [L1464] EXPR g19() VAL [a={13:0}, a={13:0}, g19()=0, ret=0] [L1464] COND TRUE !g19() [L1470] CALL f19_undo(a) VAL [a={13:0}] [L1447] EXPR, FCALL a->p VAL [a={13:0}, a={13:0}, a->p={11:0}] [L1447] RET, FCALL free(a->p) VAL [a={13:0}, a={13:0}, a->p={11:0}] [L1470] f19_undo(a) VAL [a={13:0}, a={13:0}, ret=0] [L1472] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={10:0}, ret=0] [L1472] FCALL free(a->q) VAL [a={13:0}, a={13:0}, a->q={10:0}, ret=0] [L1474] RET return ret; VAL [\result=0, a={13:0}, a={13:0}, ret=0] [L1484] EXPR probe_unsafe_19(&a19) VAL [a19={13:0}, probe_unsafe_19(&a19)=0] [L1484] int ret = probe_unsafe_19(&a19); [L1486] COND TRUE ret==0 VAL [a19={13:0}, ret=0] [L1487] CALL disconnect_19(&a19) VAL [a={13:0}] [L1478] EXPR, FCALL a->q VAL [a={13:0}, a={13:0}, a->q={10:0}] [L1478] FCALL free(a->q) VAL [a={13:0}, a={13:0}, a->q={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 89 locations, 21 error locations. UNSAFE Result, 15.5s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2628 SDtfs, 2439 SDslu, 12551 SDs, 0 SdLazy, 11472 SolverSat, 829 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 583 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 121/160 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, 39 MinimizatonAttempts, 338 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1623 NumberOfCodeBlocks, 1623 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1522 ConstructedInterpolants, 0 QuantifiedInterpolants, 525987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 28 PerfectInterpolantSequences, 121/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-07-34-486.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test19_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-07-34-486.csv Received shutdown request...