java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:19:25,236 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:19:25,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:19:25,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:19:25,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:19:25,253 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:19:25,254 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:19:25,255 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:19:25,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:19:25,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:19:25,259 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:19:25,259 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:19:25,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:19:25,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:19:25,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:19:25,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:19:25,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:19:25,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:19:25,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:19:25,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:19:25,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:19:25,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:19:25,271 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:19:25,272 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:19:25,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:19:25,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:19:25,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:19:25,274 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:19:25,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:19:25,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:19:25,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:19:25,276 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:19:25,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:19:25,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:19:25,287 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:19:25,288 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:19:25,288 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:19:25,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:19:25,288 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:19:25,288 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:19:25,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:19:25,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:19:25,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:19:25,289 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:19:25,289 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:19:25,289 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:19:25,289 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:19:25,289 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:19:25,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:19:25,290 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:19:25,290 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:19:25,290 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:19:25,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:19:25,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:19:25,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:19:25,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:19:25,329 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:19:25,332 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:19:25,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:19:25,333 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:19:25,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-02 10:19:25,480 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:19:25,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:19:25,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:19:25,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:19:25,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:19:25,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a21a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25, skipping insertion in model container [2018-02-02 10:19:25,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,507 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:19:25,544 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:19:25,634 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:19:25,649 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:19:25,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25 WrapperNode [2018-02-02 10:19:25,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:19:25,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:19:25,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:19:25,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:19:25,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (1/1) ... [2018-02-02 10:19:25,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:19:25,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:19:25,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:19:25,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:19:25,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:19:25,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:19:25,714 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:19:25,714 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:19:25,714 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:19:25,714 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:19:25,714 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:19:25,714 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:19:25,714 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:19:25,714 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:19:25,715 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:19:25,715 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:19:25,715 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:19:25,715 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:19:25,715 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:19:25,715 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:19:25,715 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:19:25,715 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:19:25,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:19:25,885 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:19:25,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:19:25 BoogieIcfgContainer [2018-02-02 10:19:25,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:19:25,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:19:25,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:19:25,888 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:19:25,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:19:25" (1/3) ... [2018-02-02 10:19:25,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7768f8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:19:25, skipping insertion in model container [2018-02-02 10:19:25,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:25" (2/3) ... [2018-02-02 10:19:25,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7768f8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:19:25, skipping insertion in model container [2018-02-02 10:19:25,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:19:25" (3/3) ... [2018-02-02 10:19:25,890 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-02 10:19:25,896 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:19:25,901 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 10:19:25,937 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:19:25,937 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:19:25,938 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:19:25,938 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:19:25,938 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:19:25,938 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:19:25,938 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:19:25,938 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:19:25,939 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:19:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 10:19:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:19:25,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:25,960 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:25,960 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-02-02 10:19:26,000 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:26,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:26,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:19:26,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,105 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= |#valid| |old(#valid)|)] [2018-02-02 10:19:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:19:26,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:19:26,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:19:26,116 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 10:19:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:26,196 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-02 10:19:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:19:26,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:19:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:26,248 INFO L225 Difference]: With dead ends: 74 [2018-02-02 10:19:26,248 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 10:19:26,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:19:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 10:19:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-02-02 10:19:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:19:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-02 10:19:26,276 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-02-02 10:19:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:26,277 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-02 10:19:26,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:19:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-02 10:19:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:19:26,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:26,278 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:26,278 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-02-02 10:19:26,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:26,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:26,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:19:26,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,370 INFO L182 omatonBuilderFactory]: Interpolants [180#true, 181#false, 182#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 183#(not (= 0 |ldv_malloc_#res.base|)), 184#(not (= 0 |entry_point_#t~ret2.base|)), 185#(not (= 0 entry_point_~array~0.base))] [2018-02-02 10:19:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:26,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:26,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:26,373 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-02 10:19:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:26,444 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-02-02 10:19:26,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:26,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:19:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:26,446 INFO L225 Difference]: With dead ends: 78 [2018-02-02 10:19:26,446 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 10:19:26,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 10:19:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-02-02 10:19:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:19:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-02 10:19:26,453 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-02-02 10:19:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:26,453 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-02 10:19:26,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-02 10:19:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:19:26,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:26,454 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] [2018-02-02 10:19:26,454 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-02-02 10:19:26,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:26,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:26,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:19:26,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,520 INFO L182 omatonBuilderFactory]: Interpolants [320#true, 321#false, 322#(<= 10 entry_point_~len~0), 323#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-02 10:19:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:19:26,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:19:26,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:26,521 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-02-02 10:19:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:26,552 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-02-02 10:19:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:19:26,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 10:19:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:26,554 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:19:26,554 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:19:26,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:19:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-02-02 10:19:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:19:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-02-02 10:19:26,560 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-02-02 10:19:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:26,561 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-02-02 10:19:26,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:19:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-02-02 10:19:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:19:26,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:26,562 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] [2018-02-02 10:19:26,562 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-02-02 10:19:26,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:26,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:26,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:26,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:19:26,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:26,617 INFO L182 omatonBuilderFactory]: Interpolants [466#true, 467#false, 468#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 469#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 470#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:19:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:26,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:26,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:26,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:26,618 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-02-02 10:19:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:26,650 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-02 10:19:26,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:26,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 10:19:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:26,652 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:19:26,652 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 10:19:26,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 10:19:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 10:19:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 10:19:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-02 10:19:26,656 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-02-02 10:19:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:26,657 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-02 10:19:26,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-02 10:19:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:19:26,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:26,658 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] [2018-02-02 10:19:26,658 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-02-02 10:19:26,659 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:26,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:26,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:26,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:26,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:26,716 INFO L182 omatonBuilderFactory]: Interpolants [567#true, 568#false, 569#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 570#(and (= 0 |entry_point_#t~ret4.base|) (= 0 |entry_point_#t~ret4.offset|)), 571#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-02 10:19:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:26,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:26,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:26,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:26,717 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-02-02 10:19:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:26,728 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-02-02 10:19:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:26,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 10:19:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:26,729 INFO L225 Difference]: With dead ends: 51 [2018-02-02 10:19:26,729 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 10:19:26,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 10:19:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-02 10:19:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:19:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-02 10:19:26,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-02-02 10:19:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:26,732 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-02 10:19:26,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-02 10:19:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:19:26,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:26,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] [2018-02-02 10:19:26,733 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-02-02 10:19:26,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:26,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:26,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:19:26,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,842 INFO L182 omatonBuilderFactory]: Interpolants [672#true, 673#false, 674#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 675#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 676#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 677#(= 1 (select |#valid| entry_point_~array~0.base)), 678#(= |#valid| |old(#valid)|), 679#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 680#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 10:19:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:26,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:19:26,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:19:26,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:26,842 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 9 states. [2018-02-02 10:19:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:26,984 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-02-02 10:19:26,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:19:26,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:19:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:26,985 INFO L225 Difference]: With dead ends: 69 [2018-02-02 10:19:26,985 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 10:19:26,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 10:19:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-02-02 10:19:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:19:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-02 10:19:26,989 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2018-02-02 10:19:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:26,989 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-02 10:19:26,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:19:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-02 10:19:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:19:26,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:26,990 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] [2018-02-02 10:19:26,990 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:26,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-02-02 10:19:26,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:27,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:27,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:27,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:19:27,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:27,265 INFO L182 omatonBuilderFactory]: Interpolants [816#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 817#(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|))), 818#(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|))))), 819#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 808#true, 809#false, 810#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 811#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 812#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 813#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 814#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 815#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-02 10:19:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:27,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:19:27,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:19:27,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:27,266 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 12 states. [2018-02-02 10:19:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:27,702 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-02-02 10:19:27,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:19:27,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 10:19:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:27,703 INFO L225 Difference]: With dead ends: 100 [2018-02-02 10:19:27,704 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 10:19:27,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:19:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 10:19:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-02-02 10:19:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 10:19:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-02-02 10:19:27,708 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 28 [2018-02-02 10:19:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:27,709 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-02-02 10:19:27,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:19:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-02-02 10:19:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:19:27,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:27,710 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] [2018-02-02 10:19:27,710 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1097237542, now seen corresponding path program 1 times [2018-02-02 10:19:27,711 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:27,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:19:27,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:27,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:19:27,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:27,741 INFO L182 omatonBuilderFactory]: Interpolants [1008#true, 1009#false, 1010#(= entry_point_~i~0 0), 1011#(<= (+ entry_point_~j~0 1) 0)] [2018-02-02 10:19:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:19:27,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:19:27,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:19:27,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:27,742 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2018-02-02 10:19:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:27,765 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-02 10:19:27,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:27,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 10:19:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:27,766 INFO L225 Difference]: With dead ends: 67 [2018-02-02 10:19:27,766 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 10:19:27,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 10:19:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-02 10:19:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 10:19:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-02-02 10:19:27,774 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29 [2018-02-02 10:19:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:27,774 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-02-02 10:19:27,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:19:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-02-02 10:19:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:19:27,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:27,775 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] [2018-02-02 10:19:27,775 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:27,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1190998490, now seen corresponding path program 1 times [2018-02-02 10:19:27,777 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:27,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:27,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:27,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:27,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:27,878 INFO L182 omatonBuilderFactory]: Interpolants [1143#true, 1144#false, 1145#(= |#valid| |old(#valid)|), 1146#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 1147#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 1148#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret2.base| (select |#valid| |entry_point_#t~ret2.base|))) (not (= 0 |entry_point_#t~ret2.base|)) (= (select |old(#valid)| |entry_point_#t~ret2.base|) 0)), 1149#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))))] [2018-02-02 10:19:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:27,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:19:27,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:19:27,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:27,879 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 7 states. [2018-02-02 10:19:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:27,975 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-02-02 10:19:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:19:27,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-02 10:19:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:27,975 INFO L225 Difference]: With dead ends: 69 [2018-02-02 10:19:27,976 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 10:19:27,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 10:19:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 10:19:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 10:19:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-02 10:19:27,978 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2018-02-02 10:19:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:27,978 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-02 10:19:27,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:19:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-02 10:19:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:19:27,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:27,979 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] [2018-02-02 10:19:27,979 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1833910404, now seen corresponding path program 1 times [2018-02-02 10:19:27,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:27,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:28,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:28,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:19:28,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:28,020 INFO L182 omatonBuilderFactory]: Interpolants [1283#true, 1284#false, 1285#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1286#(not (= 0 |ldv_malloc_#res.base|)), 1287#(not (= 0 |entry_point_#t~ret4.base|)), 1288#(not (= 0 entry_point_~p~0.base))] [2018-02-02 10:19:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:28,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:28,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:28,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:28,021 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-02 10:19:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:28,048 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-02 10:19:28,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:28,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 10:19:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:28,049 INFO L225 Difference]: With dead ends: 58 [2018-02-02 10:19:28,050 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 10:19:28,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 10:19:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-02 10:19:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:19:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-02 10:19:28,053 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2018-02-02 10:19:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:28,053 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-02 10:19:28,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-02 10:19:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:19:28,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:28,054 INFO L351 BasicCegarLoop]: trace histogram [2, 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] [2018-02-02 10:19:28,054 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1409435322, now seen corresponding path program 1 times [2018-02-02 10:19:28,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:28,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:28,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:19:28,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,094 INFO L182 omatonBuilderFactory]: Interpolants [1408#false, 1409#(<= 10 entry_point_~len~0), 1410#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1411#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1407#true] [2018-02-02 10:19:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:28,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:28,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:28,095 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 5 states. [2018-02-02 10:19:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:28,144 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-02-02 10:19:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:28,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:19:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:28,147 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:19:28,148 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:19:28,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:19:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2018-02-02 10:19:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 10:19:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-02-02 10:19:28,151 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34 [2018-02-02 10:19:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:28,152 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-02-02 10:19:28,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-02-02 10:19:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:19:28,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:28,153 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:28,153 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:28,153 INFO L82 PathProgramCache]: Analyzing trace with hash 804244387, now seen corresponding path program 1 times [2018-02-02 10:19:28,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:28,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:28,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:19:28,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,407 INFO L182 omatonBuilderFactory]: Interpolants [1568#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1569#(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|))), 1570#(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|))))), 1571#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 1572#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1) (<= (+ (* 4 entry_point_~i~0) 36) (select |#length| entry_point_~array~0.base))), 1573#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~i~0) 36) (select |#length| entry_point_~array~0.base))), 1560#true, 1561#false, 1562#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 1563#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 1564#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 2147483648 |ldv_malloc_#in~size|))), 1565#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 1566#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 1567#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-02 10:19:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:19:28,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:19:28,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:19:28,408 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 14 states. [2018-02-02 10:19:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:28,741 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-02-02 10:19:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:19:28,741 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-02 10:19:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:28,742 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:19:28,742 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:19:28,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:19:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:19:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-02-02 10:19:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:19:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-02-02 10:19:28,746 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 41 [2018-02-02 10:19:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:28,746 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-02-02 10:19:28,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:19:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-02-02 10:19:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:19:28,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:28,747 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:28,747 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:28,747 INFO L82 PathProgramCache]: Analyzing trace with hash 835021389, now seen corresponding path program 1 times [2018-02-02 10:19:28,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:28,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:28,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:28,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,805 INFO L182 omatonBuilderFactory]: Interpolants [1760#(and (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 1761#(= |old(#length)| |#length|), 1762#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base))), 1757#true, 1758#false, 1759#(and (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))] [2018-02-02 10:19:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:19:28,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:28,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:28,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:28,805 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 6 states. [2018-02-02 10:19:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:28,889 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-02-02 10:19:28,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:28,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-02 10:19:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:28,890 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:19:28,890 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:19:28,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:19:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-02 10:19:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:19:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-02-02 10:19:28,894 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 42 [2018-02-02 10:19:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:28,894 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-02-02 10:19:28,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-02-02 10:19:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:19:28,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:28,895 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2018-02-02 10:19:28,895 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:28,896 INFO L82 PathProgramCache]: Analyzing trace with hash 115859282, now seen corresponding path program 1 times [2018-02-02 10:19:28,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:28,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:29,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:29,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:19:29,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:29,132 INFO L182 omatonBuilderFactory]: Interpolants [1922#true, 1923#false, 1924#(= 0 |ldv_malloc_#t~malloc1.offset|), 1925#(= 0 |ldv_malloc_#res.offset|), 1926#(= 0 |entry_point_#t~ret2.offset|), 1927#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 1928#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 1929#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 1930#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 1931#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 1932#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 1933#(= |entry_point_#t~mem7.offset| 0)] [2018-02-02 10:19:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:29,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:19:29,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:19:29,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:29,133 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 12 states. [2018-02-02 10:19:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:29,273 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-02 10:19:29,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:19:29,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-02-02 10:19:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:29,274 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:19:29,274 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:19:29,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:19:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2018-02-02 10:19:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:19:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-02-02 10:19:29,276 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 43 [2018-02-02 10:19:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:29,276 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-02-02 10:19:29,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:19:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-02-02 10:19:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:19:29,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:29,277 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2018-02-02 10:19:29,277 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash 115859283, now seen corresponding path program 1 times [2018-02-02 10:19:29,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:29,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:29,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:29,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:19:29,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:29,508 INFO L182 omatonBuilderFactory]: Interpolants [2112#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2113#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2114#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 2115#(= |#valid| |old(#valid)|), 2116#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= entry_point_~array~0.offset 0) (or (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 2117#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 2103#true, 2104#false, 2105#(= 0 |ldv_malloc_#t~malloc1.offset|), 2106#(= 0 |ldv_malloc_#res.offset|), 2107#(= 0 |entry_point_#t~ret2.offset|), 2108#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2109#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2110#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 2111#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0))] [2018-02-02 10:19:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:29,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:19:29,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:19:29,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:19:29,509 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 15 states. [2018-02-02 10:19:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:29,834 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-02-02 10:19:29,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:19:29,834 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-02-02 10:19:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:29,835 INFO L225 Difference]: With dead ends: 78 [2018-02-02 10:19:29,835 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 10:19:29,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:19:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 10:19:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 10:19:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 10:19:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2018-02-02 10:19:29,838 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 43 [2018-02-02 10:19:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:29,838 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2018-02-02 10:19:29,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:19:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2018-02-02 10:19:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:19:29,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:29,839 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2018-02-02 10:19:29,839 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:29,839 INFO L82 PathProgramCache]: Analyzing trace with hash -329856377, now seen corresponding path program 1 times [2018-02-02 10:19:29,840 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:29,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:19:29,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:29,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:19:29,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:29,880 INFO L182 omatonBuilderFactory]: Interpolants [2288#(= entry_point_~i~0 0), 2289#(<= 1 entry_point_~i~0), 2290#(<= 0 entry_point_~j~0), 2286#true, 2287#false] [2018-02-02 10:19:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:19:29,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:29,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:29,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:29,881 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 5 states. [2018-02-02 10:19:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:29,912 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-02-02 10:19:29,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:29,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-02 10:19:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:29,913 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:19:29,914 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:19:29,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:19:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 10:19:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:19:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-02-02 10:19:29,916 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 45 [2018-02-02 10:19:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:29,917 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-02-02 10:19:29,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-02-02 10:19:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:19:29,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:29,917 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:29,917 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1632885427, now seen corresponding path program 2 times [2018-02-02 10:19:29,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:29,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:30,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:30,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:30,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:30,013 INFO L182 omatonBuilderFactory]: Interpolants [2448#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 2449#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 2450#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 2445#true, 2446#false, 2447#(<= 10 entry_point_~len~0)] [2018-02-02 10:19:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:30,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:30,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:30,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:30,014 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2018-02-02 10:19:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:30,093 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-02-02 10:19:30,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:30,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-02 10:19:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:30,094 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:19:30,094 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:19:30,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:19:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2018-02-02 10:19:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 10:19:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-02-02 10:19:30,098 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 47 [2018-02-02 10:19:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:30,098 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-02-02 10:19:30,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-02-02 10:19:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:19:30,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:30,099 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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] [2018-02-02 10:19:30,099 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576177, now seen corresponding path program 1 times [2018-02-02 10:19:30,100 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:30,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:30,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:30,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:19:30,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:30,372 INFO L182 omatonBuilderFactory]: Interpolants [2656#(and (= entry_point_~array~0.offset 0) (or (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base entry_point_~p~0.base)))), 2657#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 2658#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= entry_point_~array~0.offset 0)), 2659#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 2660#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (<= 1 entry_point_~j~0))), 2661#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 2662#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0)), 2663#(= 1 (select |#valid| entry_point_~array~0.base)), 2646#true, 2647#false, 2648#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 2649#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 2650#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 2651#(and (or (= 1 (select |#valid| entry_point_~array~0.base)) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 2652#(= |#valid| |old(#valid)|), 2653#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 2654#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 2655#(and (or (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0))] [2018-02-02 10:19:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:30,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:19:30,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:19:30,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:30,373 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 18 states. [2018-02-02 10:19:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:30,744 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-02-02 10:19:30,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:19:30,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:19:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:30,745 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:19:30,745 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:19:30,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:19:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:19:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-02-02 10:19:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 10:19:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2018-02-02 10:19:30,749 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 48 [2018-02-02 10:19:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:30,749 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2018-02-02 10:19:30,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:19:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2018-02-02 10:19:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:19:30,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:30,750 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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] [2018-02-02 10:19:30,750 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:30,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576226, now seen corresponding path program 1 times [2018-02-02 10:19:30,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:30,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:19:30,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:30,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:30,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:30,794 INFO L182 omatonBuilderFactory]: Interpolants [2869#true, 2870#false, 2871#(= entry_point_~i~0 0), 2872#(<= entry_point_~i~0 1), 2873#(<= entry_point_~j~0 0), 2874#(<= (+ entry_point_~j~0 1) 0)] [2018-02-02 10:19:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:19:30,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:30,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:30,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:30,794 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 6 states. [2018-02-02 10:19:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:30,830 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-02 10:19:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:30,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-02-02 10:19:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:30,831 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:19:30,831 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:19:30,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:19:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-02-02 10:19:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:19:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-02 10:19:30,833 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 48 [2018-02-02 10:19:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:30,833 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-02 10:19:30,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-02 10:19:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:19:30,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:30,834 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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] [2018-02-02 10:19:30,834 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:30,834 INFO L82 PathProgramCache]: Analyzing trace with hash 255829617, now seen corresponding path program 1 times [2018-02-02 10:19:30,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:30,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:31,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:31,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:19:31,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:31,552 INFO L182 omatonBuilderFactory]: Interpolants [3049#true, 3050#false, 3051#(= |#valid| |old(#valid)|), 3052#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3053#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 3054#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 3055#(and (= entry_point_~array~0.offset 0) (or (and (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3056#(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|))), 3057#(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|))), 3058#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3059#(and (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3060#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 3061#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))) (= entry_point_~array~0.offset 0)), 3062#(and (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0)))), 3063#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (or (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 3064#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 3065#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 3)))), 3066#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0))] [2018-02-02 10:19:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:31,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:19:31,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:19:31,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:31,553 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 18 states. [2018-02-02 10:19:32,299 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 87 DAG size of output 72 [2018-02-02 10:19:32,438 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 89 DAG size of output 74 [2018-02-02 10:19:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:32,788 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-02-02 10:19:32,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:19:32,788 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-02-02 10:19:32,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:32,789 INFO L225 Difference]: With dead ends: 96 [2018-02-02 10:19:32,789 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:19:32,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:19:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:19:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-02-02 10:19:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 10:19:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-02 10:19:32,792 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 51 [2018-02-02 10:19:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:32,792 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-02 10:19:32,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:19:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-02 10:19:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:19:32,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:32,792 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:32,793 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:32,793 INFO L82 PathProgramCache]: Analyzing trace with hash 797091222, now seen corresponding path program 2 times [2018-02-02 10:19:32,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:32,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:19:33,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:33,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:19:33,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:33,089 INFO L182 omatonBuilderFactory]: Interpolants [3264#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3265#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3266#(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|))), 3267#(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|))))), 3268#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 3269#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3270#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3271#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3272#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3257#true, 3258#false, 3259#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 3260#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 3261#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 3262#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 3263#(and (= 0 |entry_point_#t~ret2.offset|) (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1))] [2018-02-02 10:19:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:19:33,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:19:33,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:19:33,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:33,089 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 16 states. [2018-02-02 10:19:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:33,503 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-02-02 10:19:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:19:33,503 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-02-02 10:19:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:33,504 INFO L225 Difference]: With dead ends: 70 [2018-02-02 10:19:33,504 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 10:19:33,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:19:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 10:19:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-02-02 10:19:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 10:19:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-02 10:19:33,506 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 54 [2018-02-02 10:19:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:33,506 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-02 10:19:33,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:19:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-02 10:19:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:19:33,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:33,507 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:33,507 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602309, now seen corresponding path program 2 times [2018-02-02 10:19:33,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:33,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:19:33,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:33,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:19:33,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:19:33,691 INFO L182 omatonBuilderFactory]: Interpolants [3433#true, 3434#false, 3435#(= 0 |ldv_malloc_#t~malloc1.offset|), 3436#(= 0 |ldv_malloc_#res.offset|), 3437#(= 0 |entry_point_#t~ret2.offset|), 3438#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 3439#(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))))), 3440#(= 0 |entry_point_#t~ret4.offset|), 3441#(= 0 entry_point_~p~0.offset), 3442#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3443#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))), 3444#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))), 3445#(= |entry_point_#t~mem7.offset| 0)] [2018-02-02 10:19:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:19:33,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:19:33,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:19:33,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:19:33,692 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 13 states. [2018-02-02 10:19:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:33,966 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-02-02 10:19:33,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:19:33,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-02-02 10:19:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:33,966 INFO L225 Difference]: With dead ends: 69 [2018-02-02 10:19:33,966 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 10:19:33,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:19:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 10:19:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-02-02 10:19:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 10:19:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-02 10:19:33,969 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 56 [2018-02-02 10:19:33,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:33,969 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-02 10:19:33,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:19:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-02 10:19:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:19:33,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:33,970 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:33,970 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602310, now seen corresponding path program 2 times [2018-02-02 10:19:33,971 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:33,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:19:34,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:34,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:19:34,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:19:34,167 INFO L182 omatonBuilderFactory]: Interpolants [3616#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 3617#(= 1 (select |#valid| |entry_point_#t~ret4.base|)), 3618#(= 1 (select |#valid| entry_point_~p~0.base)), 3619#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 3620#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4)))))), 3621#(= |#valid| |old(#valid)|), 3622#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 3623#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 3608#true, 3609#false, 3610#(= 0 |ldv_malloc_#t~malloc1.offset|), 3611#(= 0 |ldv_malloc_#res.offset|), 3612#(= 0 |entry_point_#t~ret2.offset|), 3613#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 3614#(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))))), 3615#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))] [2018-02-02 10:19:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:19:34,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:19:34,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:19:34,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:34,168 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 16 states. [2018-02-02 10:19:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:34,419 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-02-02 10:19:34,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:19:34,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-02 10:19:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:34,420 INFO L225 Difference]: With dead ends: 70 [2018-02-02 10:19:34,420 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 10:19:34,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:19:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 10:19:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-02-02 10:19:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 10:19:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-02-02 10:19:34,423 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 56 [2018-02-02 10:19:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:34,423 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-02-02 10:19:34,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:19:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-02-02 10:19:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:19:34,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:34,423 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:34,423 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1244279398, now seen corresponding path program 3 times [2018-02-02 10:19:34,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:34,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:19:34,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:34,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:19:34,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:19:34,501 INFO L182 omatonBuilderFactory]: Interpolants [3792#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 3786#true, 3787#false, 3788#(<= 10 entry_point_~len~0), 3789#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 3790#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 3791#(<= (+ entry_point_~i~0 8) entry_point_~len~0)] [2018-02-02 10:19:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:19:34,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:19:34,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:19:34,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:34,502 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 7 states. [2018-02-02 10:19:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:34,551 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-02-02 10:19:34,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:34,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-02 10:19:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:34,553 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:19:34,553 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:19:34,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:19:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 75. [2018-02-02 10:19:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:19:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-02 10:19:34,556 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 60 [2018-02-02 10:19:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:34,556 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-02 10:19:34,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:19:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-02 10:19:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:19:34,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:34,557 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:34,557 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691215, now seen corresponding path program 2 times [2018-02-02 10:19:34,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:34,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:34,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:34,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:19:34,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:34,856 INFO L182 omatonBuilderFactory]: Interpolants [4004#true, 4005#false, 4006#(= 0 |ldv_malloc_#t~malloc1.offset|), 4007#(= 0 |ldv_malloc_#res.offset|), 4008#(= 0 |entry_point_#t~ret2.offset|), 4009#(= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0), 4010#(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))))), 4011#(and (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4012#(= (select |#valid| entry_point_~array~0.base) 1), 4013#(= |#valid| |old(#valid)|), 4014#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 4015#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 4016#(not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)), 4017#(not (= entry_point_~array~0.base entry_point_~p~0.base)), 4018#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 4019#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))))), 4020#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 4021#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))] [2018-02-02 10:19:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:34,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:19:34,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:19:34,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:34,857 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 18 states. [2018-02-02 10:19:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:35,254 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-02-02 10:19:35,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:19:35,254 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-02-02 10:19:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:35,255 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:19:35,255 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:19:35,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:19:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:19:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-02-02 10:19:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:19:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-02-02 10:19:35,256 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 61 [2018-02-02 10:19:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:35,257 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-02-02 10:19:35,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:19:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-02-02 10:19:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:19:35,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:35,257 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:35,257 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:35,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691216, now seen corresponding path program 1 times [2018-02-02 10:19:35,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:35,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:19:35,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:35,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:19:35,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:19:35,329 INFO L182 omatonBuilderFactory]: Interpolants [4208#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 4201#true, 4202#false, 4203#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4204#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4205#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4206#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 4207#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))] [2018-02-02 10:19:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:19:35,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:19:35,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:19:35,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:35,330 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 8 states. [2018-02-02 10:19:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:35,407 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-02 10:19:35,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:19:35,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-02 10:19:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:35,408 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:19:35,408 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:19:35,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:19:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:19:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-02-02 10:19:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:19:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-02 10:19:35,411 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 61 [2018-02-02 10:19:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:35,411 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-02 10:19:35,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:19:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-02 10:19:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:19:35,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:35,412 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:35,412 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:35,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081745, now seen corresponding path program 1 times [2018-02-02 10:19:35,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:35,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:19:35,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:35,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:19:35,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:19:35,765 INFO L182 omatonBuilderFactory]: Interpolants [4384#(and (or (and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4385#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 4386#(= |entry_point_#t~mem7.offset| 0), 4372#true, 4373#false, 4374#(= 0 |ldv_malloc_#t~malloc1.offset|), 4375#(= 0 |ldv_malloc_#res.offset|), 4376#(= 0 |entry_point_#t~ret2.offset|), 4377#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4378#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 4379#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 4380#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 4381#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 4382#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1)) (<= (* 4 entry_point_~i~0) 0)) (= entry_point_~array~0.offset 0)), 4383#(and (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~i~0) 4) (and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 2))))] [2018-02-02 10:19:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 10:19:35,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:19:35,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:19:35,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:19:35,766 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 15 states. [2018-02-02 10:19:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:36,127 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-02 10:19:36,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:19:36,128 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 10:19:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:36,128 INFO L225 Difference]: With dead ends: 101 [2018-02-02 10:19:36,128 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 10:19:36,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:19:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 10:19:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-02-02 10:19:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:19:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-02-02 10:19:36,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 62 [2018-02-02 10:19:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:36,132 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-02-02 10:19:36,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:19:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-02-02 10:19:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:19:36,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:36,132 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:36,132 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081744, now seen corresponding path program 1 times [2018-02-02 10:19:36,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:36,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:36,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:36,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:19:36,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:36,800 INFO L182 omatonBuilderFactory]: Interpolants [4608#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4609#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))) 1)), 4610#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4611#(= |#valid| |old(#valid)|), 4612#(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|)), 4613#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (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|))))), 4614#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4615#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~i~0) 4) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0) entry_point_~p~0.base))) (<= (* 4 entry_point_~i~0) 0))), 4616#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (* 4 entry_point_~i~0))))) (<= (* 4 entry_point_~i~0) 0))), 4617#(and (or (<= (* 4 entry_point_~i~0) 4) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 4618#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0)), 4619#(and (or (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4620#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4621#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 4622#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 4598#true, 4599#false, 4600#(= 0 |ldv_malloc_#t~malloc1.offset|), 4601#(= 0 |ldv_malloc_#res.offset|), 4602#(= 0 |entry_point_#t~ret2.offset|), 4603#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4604#(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))))), 4605#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4606#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4607#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| |entry_point_#t~ret4.base|) 1))] [2018-02-02 10:19:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:19:36,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:19:36,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:19:36,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:19:36,801 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 25 states. [2018-02-02 10:19:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:37,430 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-02 10:19:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:19:37,430 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-02 10:19:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:37,431 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:19:37,431 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:19:37,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:19:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:19:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-02-02 10:19:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:19:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-02 10:19:37,433 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 62 [2018-02-02 10:19:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:37,434 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-02 10:19:37,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:19:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-02 10:19:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:19:37,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:37,434 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:37,435 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2094664908, now seen corresponding path program 2 times [2018-02-02 10:19:37,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:37,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:19:37,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:37,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:19:37,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:37,829 INFO L182 omatonBuilderFactory]: Interpolants [4837#true, 4838#false, 4839#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4840#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4841#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 4842#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4843#(= |#valid| |old(#valid)|), 4844#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 4845#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 4846#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 4847#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 4848#(and (or (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))))) (= entry_point_~array~0.offset 0) (or (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 4849#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 4850#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))))) (= entry_point_~array~0.offset 0)), 4851#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0)), 4852#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 4853#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 4854#(and (= entry_point_~array~0.offset 0) (or (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))))), 4855#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|))) (<= 1 entry_point_~j~0)), 4856#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 4857#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0)), 4858#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:19:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:19:37,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:19:37,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:19:37,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:19:37,830 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 22 states. [2018-02-02 10:19:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:38,774 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-02-02 10:19:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:19:38,774 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-02 10:19:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:38,775 INFO L225 Difference]: With dead ends: 109 [2018-02-02 10:19:38,775 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 10:19:38,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1619, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:19:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 10:19:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-02-02 10:19:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:19:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-02-02 10:19:38,778 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 67 [2018-02-02 10:19:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:38,778 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-02-02 10:19:38,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:19:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-02-02 10:19:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:19:38,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:38,779 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:38,779 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2094664859, now seen corresponding path program 3 times [2018-02-02 10:19:38,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:38,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:19:38,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:38,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:19:38,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:19:38,826 INFO L182 omatonBuilderFactory]: Interpolants [5120#false, 5121#(= entry_point_~i~0 0), 5122#(<= entry_point_~i~0 1), 5123#(<= entry_point_~i~0 2), 5124#(<= entry_point_~j~0 1), 5125#(<= entry_point_~j~0 0), 5126#(<= (+ entry_point_~j~0 1) 0), 5119#true] [2018-02-02 10:19:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:19:38,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:19:38,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:19:38,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:38,826 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 8 states. [2018-02-02 10:19:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:38,901 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-02-02 10:19:38,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:38,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-02-02 10:19:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:38,902 INFO L225 Difference]: With dead ends: 104 [2018-02-02 10:19:38,902 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 10:19:38,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:19:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 10:19:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-02-02 10:19:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:19:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-02 10:19:38,906 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 67 [2018-02-02 10:19:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:38,906 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-02 10:19:38,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:19:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-02 10:19:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:19:38,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:38,907 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:38,907 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash -582418738, now seen corresponding path program 2 times [2018-02-02 10:19:38,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:38,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:41,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:41,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:19:41,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:41,514 INFO L182 omatonBuilderFactory]: Interpolants [5336#true, 5337#false, 5338#(= |#valid| |old(#valid)|), 5339#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5340#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5341#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 5342#(and (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 5343#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 5344#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 5345#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))), 5346#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))), 5347#(and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 5348#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (= (select |#valid| entry_point_~array~0.base) 1) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0) (or (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 5349#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= 0 (div (+ (* (- 4) entry_point_~i~0) (+ (- entry_point_~array~0.offset) 3)) 4294967296)) (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |#valid| entry_point_~array~0.base) 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))))), 5350#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (= |#valid| |old(#valid)|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))))), 5351#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 5352#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (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|)))), 5353#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))))), 5354#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= 0 entry_point_~p~0.base)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0)))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 5355#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 5356#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (<= entry_point_~i~0 1) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5357#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~j~0 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 5358#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~j~0 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (not (= entry_point_~array~0.base 0)) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 5359#(and (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5360#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 5361#(and (or (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5362#(and (= entry_point_~array~0.offset 0) (or (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))))), 5363#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 3)))), 5364#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0))] [2018-02-02 10:19:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:41,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:19:41,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:19:41,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:19:41,514 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 29 states. [2018-02-02 10:19:41,931 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-02-02 10:19:43,077 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 94 DAG size of output 94 [2018-02-02 10:19:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:44,000 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-02 10:19:44,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:19:44,000 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2018-02-02 10:19:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:44,001 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:19:44,001 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:19:44,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:19:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:19:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 10:19:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:19:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-02 10:19:44,006 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 70 [2018-02-02 10:19:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:44,006 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-02 10:19:44,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:19:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-02 10:19:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:19:44,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:44,007 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:44,007 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash 984429971, now seen corresponding path program 4 times [2018-02-02 10:19:44,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:44,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 10:19:44,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:44,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:19:44,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 10:19:44,066 INFO L182 omatonBuilderFactory]: Interpolants [5586#true, 5587#false, 5588#(<= 10 entry_point_~len~0), 5589#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 5590#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 5591#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 5592#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 5593#(<= (+ entry_point_~i~0 6) entry_point_~len~0)] [2018-02-02 10:19:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 10:19:44,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:19:44,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:19:44,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:44,066 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 8 states. [2018-02-02 10:19:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:44,130 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-02 10:19:44,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:19:44,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-02-02 10:19:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:44,131 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:19:44,131 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:19:44,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:19:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 89. [2018-02-02 10:19:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:19:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-02-02 10:19:44,134 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 73 [2018-02-02 10:19:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:44,135 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-02-02 10:19:44,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:19:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-02-02 10:19:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:19:44,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:44,136 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:44,136 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:44,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1615277924, now seen corresponding path program 2 times [2018-02-02 10:19:44,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:44,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-02 10:19:44,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:44,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:19:44,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 10:19:44,503 INFO L182 omatonBuilderFactory]: Interpolants [5856#(= entry_point_~array~0.offset 0), 5857#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 5858#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 5859#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 5860#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 5861#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 5862#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 5863#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 5864#(= |entry_point_#t~mem7.offset| 0), 5849#true, 5850#false, 5851#(= 0 |ldv_malloc_#t~malloc1.offset|), 5852#(= 0 |ldv_malloc_#res.offset|), 5853#(= 0 |entry_point_#t~ret2.offset|), 5854#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 5855#(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)))))] [2018-02-02 10:19:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-02 10:19:44,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:19:44,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:19:44,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:44,504 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 16 states. [2018-02-02 10:19:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:44,813 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-02-02 10:19:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:19:44,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-02-02 10:19:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:44,814 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:19:44,814 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:19:44,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:19:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:19:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-02-02 10:19:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:19:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-02-02 10:19:44,817 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 75 [2018-02-02 10:19:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:44,817 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-02-02 10:19:44,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:19:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-02-02 10:19:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:19:44,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:44,818 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:44,818 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1615277923, now seen corresponding path program 2 times [2018-02-02 10:19:44,819 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:44,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:45,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:45,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:19:45,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:45,491 INFO L182 omatonBuilderFactory]: Interpolants [6080#(= 0 |ldv_malloc_#t~malloc1.offset|), 6081#(= 0 |ldv_malloc_#res.offset|), 6082#(= 0 |entry_point_#t~ret2.offset|), 6083#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6084#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6085#(= entry_point_~array~0.offset 0), 6086#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 6087#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 6088#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0)), 6089#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 6090#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~array~0.offset 0)), 6091#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6092#(= |#valid| |old(#valid)|), 6093#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 6094#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (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|))))), 6095#(and (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 |entry_point_#t~ret4.base|))), 6096#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6097#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6098#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 6099#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 6100#(and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 6101#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 6102#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0)), 6103#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 6078#true, 6079#false] [2018-02-02 10:19:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:45,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:19:45,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:19:45,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:19:45,491 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 26 states. [2018-02-02 10:19:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:46,205 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-02-02 10:19:46,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:19:46,205 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-02-02 10:19:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:46,206 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:19:46,206 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:19:46,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:19:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:19:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-02-02 10:19:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:19:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-02 10:19:46,208 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 75 [2018-02-02 10:19:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:46,208 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-02 10:19:46,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:19:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-02 10:19:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:19:46,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:46,209 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:46,209 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:46,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1868460952, now seen corresponding path program 4 times [2018-02-02 10:19:46,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:46,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 10:19:46,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:46,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:19:46,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:19:46,647 INFO L182 omatonBuilderFactory]: Interpolants [6336#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6337#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 6338#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 6339#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 6340#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= entry_point_~i~0 1)) (= entry_point_~array~0.offset 0)), 6341#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (<= entry_point_~i~0 2)) (= entry_point_~array~0.offset 0)), 6342#(and (or (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0)), 6343#(and (or (<= entry_point_~j~0 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))) (= entry_point_~array~0.offset 0)), 6344#(or (<= entry_point_~j~0 0) (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))), 6345#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6346#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6347#(= (select |#valid| entry_point_~array~0.base) 1), 6325#true, 6326#false, 6327#(= 0 |ldv_malloc_#t~malloc1.offset|), 6328#(= 0 |ldv_malloc_#res.offset|), 6329#(= 0 |entry_point_#t~ret2.offset|), 6330#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6331#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6332#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6333#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6334#(= |#valid| |old(#valid)|), 6335#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))] [2018-02-02 10:19:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 10:19:46,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:19:46,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:19:46,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:19:46,647 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 23 states. [2018-02-02 10:19:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:47,264 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-02-02 10:19:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:19:47,265 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-02-02 10:19:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:47,265 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:19:47,265 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:19:47,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:19:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:19:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2018-02-02 10:19:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 10:19:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-02-02 10:19:47,268 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 80 [2018-02-02 10:19:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:47,269 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-02-02 10:19:47,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:19:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-02-02 10:19:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:19:47,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:47,270 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:47,270 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:47,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1868460953, now seen corresponding path program 2 times [2018-02-02 10:19:47,271 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:47,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 10:19:47,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:47,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:19:47,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 10:19:47,347 INFO L182 omatonBuilderFactory]: Interpolants [6624#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6625#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6626#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6627#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6628#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 6629#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 6620#true, 6621#false, 6622#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6623#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))] [2018-02-02 10:19:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 10:19:47,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:19:47,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:19:47,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:47,348 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 10 states. [2018-02-02 10:19:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:47,458 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-02 10:19:47,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:19:47,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-02-02 10:19:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:47,459 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:19:47,459 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:19:47,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:19:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:19:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-02-02 10:19:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:19:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-02-02 10:19:47,462 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 80 [2018-02-02 10:19:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:47,462 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-02-02 10:19:47,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:19:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-02-02 10:19:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:19:47,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:47,463 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:47,463 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2087714694, now seen corresponding path program 3 times [2018-02-02 10:19:47,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:47,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:19:47,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:47,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:19:47,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 10:19:47,831 INFO L182 omatonBuilderFactory]: Interpolants [6862#true, 6863#false, 6864#(= 0 |ldv_malloc_#t~malloc1.offset|), 6865#(= 0 |ldv_malloc_#res.offset|), 6866#(= 0 |entry_point_#t~ret2.offset|), 6867#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6868#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 6869#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 6870#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 6871#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 6872#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))), 6873#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.offset) 0))), 6874#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 6875#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 6876#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 6877#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 6878#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 6879#(= |entry_point_#t~mem7.offset| 0)] [2018-02-02 10:19:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:19:47,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:19:47,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:19:47,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:19:47,832 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 18 states. [2018-02-02 10:19:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:48,090 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-02-02 10:19:48,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:19:48,090 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-02-02 10:19:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:48,091 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:19:48,091 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:19:48,091 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:19:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:19:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-02-02 10:19:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:19:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-02 10:19:48,094 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 81 [2018-02-02 10:19:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:48,094 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-02 10:19:48,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:19:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-02 10:19:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:19:48,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:48,095 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:48,095 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2087714695, now seen corresponding path program 3 times [2018-02-02 10:19:48,096 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:48,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:19:49,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:49,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:19:49,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:19:49,432 INFO L182 omatonBuilderFactory]: Interpolants [7132#true, 7133#false, 7134#(= 0 |ldv_malloc_#t~malloc1.offset|), 7135#(= 0 |ldv_malloc_#res.offset|), 7136#(= 0 |entry_point_#t~ret2.offset|), 7137#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7138#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 7139#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 7140#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7141#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7142#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7143#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7144#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 7145#(= |#valid| |old(#valid)|), 7146#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 7147#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 7148#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 7149#(and (<= (* 4 entry_point_~i~0) 4) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0) entry_point_~p~0.base))), 7150#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (<= entry_point_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 7151#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 8)))), 7152#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (not (= 0 |entry_point_#t~ret4.base|))), 7153#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base)) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 7154#(and (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 7155#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 3) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 11)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))), 7156#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7))), 7157#(and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (and (or (and (<= entry_point_~j~0 2) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0))) (not (= 0 |entry_point_#t~mem7.base|))), 7158#(and (or (and (<= entry_point_~j~0 2) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 7159#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 7160#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)))) (= entry_point_~array~0.offset 0)), 7161#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 7162#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 7163#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 10:19:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:19:49,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:19:49,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:19:49,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:19:49,433 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 32 states. [2018-02-02 10:19:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:50,615 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-02 10:19:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:19:50,615 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-02-02 10:19:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:50,616 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:19:50,616 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:19:50,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=240, Invalid=2412, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:19:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:19:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-02-02 10:19:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:19:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-02 10:19:50,618 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 81 [2018-02-02 10:19:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:50,618 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-02 10:19:50,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:19:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-02 10:19:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:19:50,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:50,619 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:50,619 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 542617019, now seen corresponding path program 3 times [2018-02-02 10:19:50,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:50,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 10:19:50,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:50,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:19:50,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 10:19:50,675 INFO L182 omatonBuilderFactory]: Interpolants [7440#false, 7441#(= entry_point_~i~0 0), 7442#(<= 1 entry_point_~i~0), 7443#(<= 2 entry_point_~i~0), 7444#(<= 3 entry_point_~i~0), 7445#(<= 2 entry_point_~j~0), 7446#(<= 1 entry_point_~j~0), 7447#(<= 0 entry_point_~j~0), 7439#true] [2018-02-02 10:19:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 10:19:50,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:19:50,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:19:50,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:50,676 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 9 states. [2018-02-02 10:19:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:50,751 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-02-02 10:19:50,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:50,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-02-02 10:19:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:50,751 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:19:50,751 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:19:50,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:19:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 10:19:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:19:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-02-02 10:19:50,754 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 83 [2018-02-02 10:19:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:50,754 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-02-02 10:19:50,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:19:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-02-02 10:19:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:19:50,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:50,755 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:50,755 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1000111226, now seen corresponding path program 5 times [2018-02-02 10:19:50,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:50,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-02 10:19:50,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:50,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:19:50,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-02 10:19:50,823 INFO L182 omatonBuilderFactory]: Interpolants [7680#true, 7681#false, 7682#(<= 10 entry_point_~len~0), 7683#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 7684#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 7685#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 7686#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 7687#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 7688#(<= (+ entry_point_~i~0 5) entry_point_~len~0)] [2018-02-02 10:19:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-02 10:19:50,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:19:50,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:19:50,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:50,824 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 9 states. [2018-02-02 10:19:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:50,905 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-02-02 10:19:50,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:50,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-02-02 10:19:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:50,906 INFO L225 Difference]: With dead ends: 195 [2018-02-02 10:19:50,906 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:19:50,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:19:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:19:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 120. [2018-02-02 10:19:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:19:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2018-02-02 10:19:50,909 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 86 [2018-02-02 10:19:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:50,910 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2018-02-02 10:19:50,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:19:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2018-02-02 10:19:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:19:50,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:50,911 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:50,911 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:50,911 INFO L82 PathProgramCache]: Analyzing trace with hash -79558979, now seen corresponding path program 3 times [2018-02-02 10:19:50,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:50,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 10:19:51,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:51,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:19:51,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:51,395 INFO L182 omatonBuilderFactory]: Interpolants [8032#(and (<= entry_point_~j~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8033#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 8034#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 8035#(= 1 (select |#valid| entry_point_~array~0.base)), 8014#true, 8015#false, 8016#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 8017#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 8018#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 8019#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8020#(= |#valid| |old(#valid)|), 8021#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8022#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8023#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8024#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 8025#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 8026#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8027#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8028#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))), 8029#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8030#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8031#(and (<= entry_point_~j~0 2) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))] [2018-02-02 10:19:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 10:19:51,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:19:51,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:19:51,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:19:51,396 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand 22 states. [2018-02-02 10:19:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:51,873 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-02 10:19:51,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:19:51,874 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-02-02 10:19:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:51,874 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:19:51,874 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:19:51,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:19:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:19:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2018-02-02 10:19:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:19:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-02-02 10:19:51,876 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 86 [2018-02-02 10:19:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:51,877 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-02-02 10:19:51,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:19:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-02-02 10:19:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:19:51,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:51,877 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:51,877 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash -79558929, now seen corresponding path program 3 times [2018-02-02 10:19:51,878 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:51,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 10:19:51,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:51,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:19:51,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 10:19:51,938 INFO L182 omatonBuilderFactory]: Interpolants [8309#true, 8310#false, 8311#(= entry_point_~i~0 0), 8312#(<= entry_point_~i~0 1), 8313#(<= entry_point_~i~0 2), 8314#(<= entry_point_~i~0 3), 8315#(<= entry_point_~j~0 2), 8316#(<= entry_point_~j~0 1), 8317#(<= entry_point_~j~0 0), 8318#(<= (+ entry_point_~j~0 1) 0)] [2018-02-02 10:19:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 10:19:51,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:19:51,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:19:51,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:51,939 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 10 states. [2018-02-02 10:19:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:52,011 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-02-02 10:19:52,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:19:52,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-02-02 10:19:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:52,012 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:19:52,012 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:19:52,012 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:19:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:19:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-02-02 10:19:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:19:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-02-02 10:19:52,014 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 86 [2018-02-02 10:19:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:52,014 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-02-02 10:19:52,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:19:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-02-02 10:19:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:19:52,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:52,015 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:52,015 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash 680415909, now seen corresponding path program 4 times [2018-02-02 10:19:52,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:52,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:58,378 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 129 DAG size of output 47 [2018-02-02 10:19:58,628 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 137 DAG size of output 53 [2018-02-02 10:19:59,061 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 142 DAG size of output 55 [2018-02-02 10:19:59,355 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 133 DAG size of output 54 [2018-02-02 10:19:59,926 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 107 DAG size of output 64 [2018-02-02 10:20:00,110 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 101 DAG size of output 62 [2018-02-02 10:20:00,273 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 102 DAG size of output 63 [2018-02-02 10:20:00,460 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 110 DAG size of output 71 [2018-02-02 10:20:00,650 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-02-02 10:20:00,852 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 125 DAG size of output 66 [2018-02-02 10:20:01,362 WARN L146 SmtUtils]: Spent 304ms on a formula simplification. DAG size of input: 172 DAG size of output 60 [2018-02-02 10:20:01,951 WARN L146 SmtUtils]: Spent 367ms on a formula simplification. DAG size of input: 177 DAG size of output 54 [2018-02-02 10:20:02,610 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 124 DAG size of output 54 [2018-02-02 10:20:03,061 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 137 DAG size of output 42 [2018-02-02 10:20:03,632 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 163 DAG size of output 42 [2018-02-02 10:20:04,246 WARN L146 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 163 DAG size of output 42 [2018-02-02 10:20:04,573 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 109 DAG size of output 29 [2018-02-02 10:20:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 10:20:05,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:05,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:20:05,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 10:20:05,042 INFO L182 omatonBuilderFactory]: Interpolants [8576#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|)), 8577#(and (or (= |#valid| |old(#valid)|) (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 8578#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (<= |ldv_malloc_#in~size| ldv_malloc_~size) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|)))))), 8579#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8580#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8581#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 8582#(and (= 1 (select |#valid| entry_point_~p~0.base)) (or (and (or (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|)) (= entry_point_~p~0.base (@diff |#valid| |old(#valid)|))) (= (store (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (select |old(#valid)| (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (or (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= entry_point_~p~0.base (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)) (= entry_point_~array~0.base (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8583#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))))), 8584#(and (<= (* 4 entry_point_~i~0) 4) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 8585#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8586#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.base| (@diff |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8587#(and (or (and (<= entry_point_~i~0 1) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| |entry_point_#t~ret4.base| 0) entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 0)) (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 8588#(and (= 1 (select |#valid| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 1) (or (= (select (store |#valid| entry_point_~p~0.base 0) entry_point_~array~0.base) 0) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (or (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0)) (and (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))))) (<= (* 4 entry_point_~i~0) 0))), 8589#(and (= entry_point_~array~0.offset 0) (or (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) 0) entry_point_~array~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~0 1) (= (select |#valid| entry_point_~array~0.base) 1)) (<= (* 4 entry_point_~i~0) 3))), 8590#(and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select |#valid| entry_point_~array~0.base) 1) (or (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))))) (<= (* 4 entry_point_~i~0) 7))), 8591#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8592#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 8593#(and (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (or (and (= (select (store (store |#valid| |entry_point_#t~ret4.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~0 2) (not (= 0 |entry_point_#t~ret4.base|)))) (= entry_point_~array~0.offset 0)), 8594#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (or (and (or (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)) (and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base) (= (select (store (store |#valid| entry_point_~p~0.base 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= (* 4 entry_point_~i~0) 8) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))))), 8595#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (or (and (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (<= (* 4 entry_point_~i~0) 8)))), 8596#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 11) (and (<= entry_point_~i~0 3) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) 0) entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))))), 8597#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (and (<= (* 4 entry_point_~j~0) 8) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))))), 8598#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (store (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7))), 8599#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (and (<= entry_point_~j~0 2) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))))) (= entry_point_~array~0.offset 0)), 8600#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) 0) entry_point_~array~0.base) 0))))), 8601#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|))))), 8602#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base 0)) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)))))) (= entry_point_~array~0.offset 0)), 8603#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 1) 0) (and (not (= entry_point_~array~0.base 0)) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 0) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))))))) (= entry_point_~array~0.offset 0)), 8604#(and (or (= (select |#valid| entry_point_~array~0.base) 0) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 0) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 8605#(and (or (= (select |#valid| |entry_point_#t~mem7.base|) 0) (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|)) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 8606#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))))), 8571#true, 8572#false, 8573#(= |#valid| |old(#valid)|), 8574#(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|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 8575#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (@diff |#valid| |old(#valid)|) |ldv_malloc_#res.base|)))] [2018-02-02 10:20:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 10:20:05,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:20:05,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:20:05,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:20:05,042 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 36 states. [2018-02-02 10:20:05,846 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 98 DAG size of output 96 [2018-02-02 10:20:07,026 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-02 10:20:07,211 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-02 10:20:07,411 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 101 DAG size of output 88 [2018-02-02 10:20:07,617 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 110 DAG size of output 77 [2018-02-02 10:20:07,914 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 105 DAG size of output 73 [2018-02-02 10:20:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:08,254 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-02-02 10:20:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:20:08,255 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-02-02 10:20:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:08,255 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:20:08,255 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 10:20:08,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=379, Invalid=2701, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:20:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 10:20:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-02 10:20:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 10:20:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-02 10:20:08,258 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 89 [2018-02-02 10:20:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:08,258 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-02 10:20:08,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:20:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-02 10:20:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:20:08,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:08,258 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:08,259 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:20:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash 35987013, now seen corresponding path program 5 times [2018-02-02 10:20:08,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:08,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 55 proven. 41 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 10:20:08,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:08,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:08,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 10:20:08,468 INFO L182 omatonBuilderFactory]: Interpolants [8866#true, 8867#false, 8868#(= (select |#valid| entry_point_~array~0.base) 1), 8869#(= |#valid| |old(#valid)|), 8870#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 8871#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 8872#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 8873#(and (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 8874#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 8875#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))), 8876#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2)))))))), 8877#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))), 8878#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 8879#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|)))] [2018-02-02 10:20:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 55 proven. 41 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 10:20:08,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:08,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:08,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:08,468 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 14 states. [2018-02-02 10:20:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:08,912 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-02-02 10:20:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:20:08,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-02-02 10:20:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:08,913 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:20:08,913 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:20:08,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:20:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:20:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-02 10:20:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 10:20:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-02 10:20:08,916 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 93 [2018-02-02 10:20:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:08,916 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-02 10:20:08,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-02 10:20:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:20:08,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:08,917 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:08,917 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:20:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1115597433, now seen corresponding path program 4 times [2018-02-02 10:20:08,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:08,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 14 proven. 93 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-02 10:20:09,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:09,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:20:09,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 10:20:09,380 INFO L182 omatonBuilderFactory]: Interpolants [9120#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 9121#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 9122#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9123#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12)))) (= entry_point_~array~0.offset 0)), 9124#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9125#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 9126#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 9127#(= |entry_point_#t~mem7.offset| 0), 9110#true, 9111#false, 9112#(= 0 |ldv_malloc_#t~malloc1.offset|), 9113#(= 0 |ldv_malloc_#res.offset|), 9114#(= 0 |entry_point_#t~ret2.offset|), 9115#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 9116#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 9117#(= entry_point_~array~0.offset 0), 9118#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 9119#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset))] [2018-02-02 10:20:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 14 proven. 93 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-02 10:20:09,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:20:09,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:20:09,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:09,381 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 18 states. [2018-02-02 10:20:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:09,914 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-02-02 10:20:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:20:09,915 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-02-02 10:20:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:09,915 INFO L225 Difference]: With dead ends: 100 [2018-02-02 10:20:09,915 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 10:20:09,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:20:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 10:20:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-02-02 10:20:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:20:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-02-02 10:20:09,917 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 94 [2018-02-02 10:20:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:09,917 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-02-02 10:20:09,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:20:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-02-02 10:20:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:20:09,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:09,918 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:09,918 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:20:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1115597434, now seen corresponding path program 4 times [2018-02-02 10:20:09,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:09,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 42 proven. 102 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:20:11,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:11,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 10:20:11,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:20:11,197 INFO L182 omatonBuilderFactory]: Interpolants [9369#true, 9370#false, 9371#(= 0 (select |#valid| 0)), 9372#(= (select |old(#valid)| 0) (select |#valid| 0)), 9373#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 9374#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 9375#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |#valid| 0))), 9376#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9377#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= (select |old(#valid)| 0) (select |#valid| 0)))) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 9378#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 9379#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9380#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 9381#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 9382#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9383#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9384#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0)), 9385#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9386#(= |#valid| |old(#valid)|), 9387#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 9388#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (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|))))), 9389#(and (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 |entry_point_#t~ret4.base|))), 9390#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9391#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9392#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9393#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 9394#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9395#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) |entry_point_#t~ret4.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 |entry_point_#t~ret4.base|))), 9396#(and (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8))) entry_point_~p~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9397#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9398#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (= entry_point_~array~0.offset 0)), 9399#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 9400#(and (= entry_point_~array~0.offset 0) (or (and (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))) (and (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (not (= |entry_point_#t~mem7.base| 0))))), 9401#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))), 9402#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9403#(and (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|)) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9404#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9405#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0)), 9406#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 10:20:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 42 proven. 102 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:20:11,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 10:20:11,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 10:20:11,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:20:11,198 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 38 states. [2018-02-02 10:20:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,286 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-02-02 10:20:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:20:13,287 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-02-02 10:20:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,287 INFO L225 Difference]: With dead ends: 100 [2018-02-02 10:20:13,287 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 10:20:13,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=618, Invalid=4784, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 10:20:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 10:20:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-02-02 10:20:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:20:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-02-02 10:20:13,291 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 94 [2018-02-02 10:20:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,291 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-02-02 10:20:13,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 10:20:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-02-02 10:20:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:20:13,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,292 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:13,292 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:20:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1301854323, now seen corresponding path program 6 times [2018-02-02 10:20:13,293 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-02 10:20:13,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:20:13,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-02 10:20:13,394 INFO L182 omatonBuilderFactory]: Interpolants [9680#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 9681#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 9682#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 9683#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 9684#(<= (+ entry_point_~i~0 5) entry_point_~len~0), 9685#(<= (+ entry_point_~i~0 4) entry_point_~len~0), 9676#true, 9677#false, 9678#(<= 10 entry_point_~len~0), 9679#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-02 10:20:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-02 10:20:13,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:20:13,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:20:13,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:13,395 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 10 states. [2018-02-02 10:20:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,484 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2018-02-02 10:20:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:20:13,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-02-02 10:20:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,485 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:20:13,486 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:20:13,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:20:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:20:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 104. [2018-02-02 10:20:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 10:20:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-02-02 10:20:13,487 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 99 [2018-02-02 10:20:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,488 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-02-02 10:20:13,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:20:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-02-02 10:20:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:20:13,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,488 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:13,488 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:20:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2072560726, now seen corresponding path program 4 times [2018-02-02 10:20:13,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 10:20:13,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:13,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:20:13,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 10:20:13,587 INFO L182 omatonBuilderFactory]: Interpolants [10016#(<= 4 entry_point_~i~0), 10017#(<= 3 entry_point_~j~0), 10018#(<= 2 entry_point_~j~0), 10019#(<= 1 entry_point_~j~0), 10020#(<= 0 entry_point_~j~0), 10010#true, 10011#false, 10012#(= entry_point_~i~0 0), 10013#(<= 1 entry_point_~i~0), 10014#(<= 2 entry_point_~i~0), 10015#(<= 3 entry_point_~i~0)] [2018-02-02 10:20:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 10:20:13,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:20:13,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:20:13,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:20:13,588 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 11 states. [2018-02-02 10:20:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:13,677 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-02-02 10:20:13,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:20:13,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-02-02 10:20:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:13,678 INFO L225 Difference]: With dead ends: 108 [2018-02-02 10:20:13,678 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 10:20:13,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:20:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 10:20:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-02 10:20:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:20:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-02-02 10:20:13,680 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 99 [2018-02-02 10:20:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:13,680 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-02-02 10:20:13,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:20:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-02-02 10:20:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:20:13,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:13,681 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:13,681 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:20:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2072560677, now seen corresponding path program 6 times [2018-02-02 10:20:13,681 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:13,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 10:20:13,760 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,760 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,760 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,761 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,761 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,761 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,761 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,761 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,762 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,762 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,762 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,762 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,762 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,763 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,763 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,763 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,763 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,763 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,763 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,763 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,763 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,764 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,764 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,764 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,764 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,764 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,764 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,765 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,765 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,765 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,765 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,765 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,765 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,765 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,766 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,766 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,766 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,766 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,766 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,766 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,766 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,767 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,767 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,767 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,767 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,767 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,768 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,768 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,768 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,768 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,768 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,768 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,768 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,769 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,769 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,769 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,769 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,769 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,769 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,770 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,770 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,770 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,770 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,770 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,770 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,770 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,771 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,771 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,771 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,771 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,771 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,771 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,771 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,772 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,772 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,772 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,772 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,772 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,772 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,773 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,773 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,773 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,773 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,773 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,773 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,774 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,774 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,774 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,774 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,774 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,774 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,775 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,775 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,775 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,775 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,775 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,775 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,775 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,775 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:20:13,777 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:20:13,780 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:20:13,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:20:13 BoogieIcfgContainer [2018-02-02 10:20:13,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:20:13,781 INFO L168 Benchmark]: Toolchain (without parser) took 48300.58 ms. Allocated memory was 402.1 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 358.8 MB in the beginning and 447.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-02-02 10:20:13,782 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:20:13,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.08 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:13,782 INFO L168 Benchmark]: Boogie Preprocessor took 25.27 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:13,782 INFO L168 Benchmark]: RCFGBuilder took 206.47 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 325.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:13,783 INFO L168 Benchmark]: TraceAbstraction took 47894.69 ms. Allocated memory was 402.1 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 323.1 MB in the beginning and 447.0 MB in the end (delta: -123.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-02-02 10:20:13,784 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.08 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.27 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 206.47 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 325.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47894.69 ms. Allocated memory was 402.1 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 323.1 MB in the beginning and 447.0 MB in the end (delta: -123.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 98 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 47.8s OverallTime, 49 OverallIterations, 7 TraceHistogramMax, 20.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1851 SDtfs, 3537 SDslu, 11205 SDs, 0 SdLazy, 14916 SolverSat, 982 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 187 SyntacticMatches, 67 SemanticMatches, 960 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1495/3002 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, 48 MinimizatonAttempts, 622 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 2830 NumberOfCodeBlocks, 2830 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2782 ConstructedInterpolants, 0 QuantifiedInterpolants, 2522422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 7 PerfectInterpolantSequences, 1495/3002 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-20-13-789.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-20-13-789.csv Completed graceful shutdown