java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:21:30,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:21:30,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:21:30,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:21:30,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:21:30,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:21:30,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:21:30,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:21:30,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:21:30,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:21:30,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:21:30,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:21:30,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:21:30,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:21:30,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:21:30,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:21:30,708 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:21:30,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:21:30,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:21:30,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:21:30,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:21:30,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:21:30,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:21:30,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:21:30,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:21:30,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:21:30,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:21:30,716 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:21:30,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:21:30,717 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:21:30,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:21:30,717 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:21:30,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:21:30,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:21:30,728 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:21:30,728 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:21:30,728 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:21:30,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:21:30,728 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:21:30,728 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:21:30,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:21:30,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:21:30,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:21:30,729 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:21:30,729 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:21:30,729 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:21:30,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:21:30,729 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:21:30,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:21:30,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:21:30,730 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:21:30,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:21:30,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:21:30,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:21:30,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:21:30,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:21:30,771 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:21:30,774 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:21:30,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:21:30,775 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:21:30,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 03:21:30,932 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:21:30,933 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:21:30,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:21:30,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:21:30,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:21:30,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:21:30" (1/1) ... [2018-02-04 03:21:30,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286f8729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:30, skipping insertion in model container [2018-02-04 03:21:30,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:21:30" (1/1) ... [2018-02-04 03:21:30,955 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:21:30,991 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:21:31,073 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:21:31,086 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:21:31,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31 WrapperNode [2018-02-04 03:21:31,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:21:31,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:21:31,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:21:31,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:21:31,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (1/1) ... [2018-02-04 03:21:31,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (1/1) ... [2018-02-04 03:21:31,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (1/1) ... [2018-02-04 03:21:31,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (1/1) ... [2018-02-04 03:21:31,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (1/1) ... [2018-02-04 03:21:31,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (1/1) ... [2018-02-04 03:21:31,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (1/1) ... [2018-02-04 03:21:31,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:21:31,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:21:31,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:21:31,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:21:31,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:21:31,148 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:21:31,148 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:21:31,148 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:21:31,148 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:21:31,148 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:21:31,148 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:21:31,149 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:21:31,264 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:21:31,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:21:31 BoogieIcfgContainer [2018-02-04 03:21:31,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:21:31,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:21:31,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:21:31,267 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:21:31,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:21:30" (1/3) ... [2018-02-04 03:21:31,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc55e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:21:31, skipping insertion in model container [2018-02-04 03:21:31,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:21:31" (2/3) ... [2018-02-04 03:21:31,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc55e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:21:31, skipping insertion in model container [2018-02-04 03:21:31,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:21:31" (3/3) ... [2018-02-04 03:21:31,270 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 03:21:31,275 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:21:31,281 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 03:21:31,315 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:21:31,316 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:21:31,316 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:21:31,316 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:21:31,316 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:21:31,316 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:21:31,316 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:21:31,316 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:21:31,317 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:21:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 03:21:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:21:31,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:31,340 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:31,340 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-02-04 03:21:31,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:31,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:31,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:21:31,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,509 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= |#valid| |old(#valid)|)] [2018-02-04 03:21:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:21:31,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:21:31,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:21:31,519 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 03:21:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:31,661 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 03:21:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:21:31,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 03:21:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:31,669 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:21:31,669 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 03:21:31,670 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-04 03:21:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 03:21:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-02-04 03:21:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 03:21:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-02-04 03:21:31,697 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-02-04 03:21:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:31,698 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-02-04 03:21:31,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:21:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-02-04 03:21:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:21:31,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:31,699 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-04 03:21:31,699 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-02-04 03:21:31,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:31,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:31,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:21:31,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,766 INFO L182 omatonBuilderFactory]: Interpolants [176#(not (= 0 |ldv_malloc_#res.base|)), 177#(not (= 0 |entry_point_#t~ret2.base|)), 178#(not (= 0 entry_point_~array~0.base)), 173#true, 174#false, 175#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-04 03:21:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:21:31,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:21:31,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:21:31,768 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-02-04 03:21:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:31,845 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-02-04 03:21:31,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:21:31,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:21:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:31,847 INFO L225 Difference]: With dead ends: 71 [2018-02-04 03:21:31,847 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 03:21:31,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:21:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 03:21:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-02-04 03:21:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 03:21:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 03:21:31,853 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-02-04 03:21:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:31,853 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 03:21:31,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:21:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 03:21:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:21:31,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:31,855 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] [2018-02-04 03:21:31,855 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:31,855 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-02-04 03:21:31,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:31,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:31,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:21:31,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,912 INFO L182 omatonBuilderFactory]: Interpolants [295#true, 296#false, 297#(= 0 |ldv_malloc_#res.offset|), 298#(= 0 |entry_point_#t~ret2.offset|), 299#(= 0 entry_point_~array~0.offset)] [2018-02-04 03:21:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:21:31,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:21:31,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:31,913 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-04 03:21:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:31,943 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-04 03:21:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:21:31,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 03:21:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:31,944 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:21:31,944 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:21:31,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:31,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:21:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-02-04 03:21:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 03:21:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-02-04 03:21:31,949 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-02-04 03:21:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:31,950 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-02-04 03:21:31,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:21:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-02-04 03:21:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:21:31,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:31,950 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] [2018-02-04 03:21:31,950 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-02-04 03:21:31,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:31,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:31,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:21:31,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,991 INFO L182 omatonBuilderFactory]: Interpolants [432#false, 433#(= 0 |ldv_malloc_#res.base|), 434#(= 0 |entry_point_#t~ret2.base|), 435#(= entry_point_~array~0.base 0), 431#true] [2018-02-04 03:21:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:31,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:21:31,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:21:31,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:31,991 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-02-04 03:21:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:32,046 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-04 03:21:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:21:32,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 03:21:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:32,048 INFO L225 Difference]: With dead ends: 70 [2018-02-04 03:21:32,048 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:21:32,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:21:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-04 03:21:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 03:21:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-02-04 03:21:32,051 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-02-04 03:21:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:32,051 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-02-04 03:21:32,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:21:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-02-04 03:21:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:21:32,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:32,052 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] [2018-02-04 03:21:32,052 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:32,052 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-02-04 03:21:32,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:32,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:32,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:21:32,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,093 INFO L182 omatonBuilderFactory]: Interpolants [568#true, 569#false, 570#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 571#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 572#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-04 03:21:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:21:32,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:21:32,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:32,093 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-02-04 03:21:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:32,120 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-04 03:21:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:21:32,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 03:21:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:32,121 INFO L225 Difference]: With dead ends: 47 [2018-02-04 03:21:32,121 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 03:21:32,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 03:21:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 03:21:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 03:21:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-04 03:21:32,125 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-02-04 03:21:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:32,125 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-04 03:21:32,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:21:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-04 03:21:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:21:32,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:32,126 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:32,127 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:32,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-02-04 03:21:32,128 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:32,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:32,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:21:32,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,175 INFO L182 omatonBuilderFactory]: Interpolants [665#true, 666#false, 667#(= 0 |ldv_malloc_#t~malloc1.offset|), 668#(= 0 |ldv_malloc_#res.offset|), 669#(= 0 |entry_point_#t~ret2.offset|), 670#(= 0 entry_point_~array~0.offset)] [2018-02-04 03:21:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:21:32,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:21:32,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:21:32,176 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-04 03:21:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:32,204 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 03:21:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:21:32,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 03:21:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:32,205 INFO L225 Difference]: With dead ends: 44 [2018-02-04 03:21:32,205 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 03:21:32,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:21:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 03:21:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 03:21:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 03:21:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-04 03:21:32,209 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-02-04 03:21:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:32,209 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-04 03:21:32,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:21:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-04 03:21:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:21:32,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:32,210 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:32,210 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:32,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-02-04 03:21:32,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:32,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:32,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:21:32,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,267 INFO L182 omatonBuilderFactory]: Interpolants [761#true, 762#false, 763#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 764#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 765#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 766#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:21:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:21:32,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:21:32,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:21:32,268 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-04 03:21:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:32,324 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 03:21:32,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:21:32,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 03:21:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:32,325 INFO L225 Difference]: With dead ends: 50 [2018-02-04 03:21:32,325 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 03:21:32,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:21:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 03:21:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-04 03:21:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 03:21:32,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 03:21:32,328 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-04 03:21:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:32,329 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 03:21:32,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:21:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 03:21:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:21:32,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:32,330 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:32,330 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-02-04 03:21:32,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:32,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:32,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:21:32,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,364 INFO L182 omatonBuilderFactory]: Interpolants [868#true, 869#false, 870#(<= 10 entry_point_~len~0), 871#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-04 03:21:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:21:32,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:21:32,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:21:32,364 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-02-04 03:21:32,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:32,381 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-02-04 03:21:32,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:21:32,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 03:21:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:32,383 INFO L225 Difference]: With dead ends: 73 [2018-02-04 03:21:32,383 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 03:21:32,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:21:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 03:21:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-02-04 03:21:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 03:21:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 03:21:32,390 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-02-04 03:21:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:32,390 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 03:21:32,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:21:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 03:21:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:21:32,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:32,391 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-04 03:21:32,391 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-02-04 03:21:32,392 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:32,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:32,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:32,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:21:32,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:32,446 INFO L182 omatonBuilderFactory]: Interpolants [996#true, 997#false, 998#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 999#(and (= 0 |entry_point_#t~ret4.base|) (= 0 |entry_point_#t~ret4.offset|)), 1000#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-04 03:21:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:32,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:21:32,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:21:32,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:32,447 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-04 03:21:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:32,458 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 03:21:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:21:32,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 03:21:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:32,459 INFO L225 Difference]: With dead ends: 67 [2018-02-04 03:21:32,459 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 03:21:32,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 03:21:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-02-04 03:21:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 03:21:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 03:21:32,463 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-02-04 03:21:32,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:32,463 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 03:21:32,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:21:32,463 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 03:21:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:21:32,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:32,464 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-04 03:21:32,464 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:32,464 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-02-04 03:21:32,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:32,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:32,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:21:32,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,553 INFO L182 omatonBuilderFactory]: Interpolants [1121#true, 1122#false, 1123#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1124#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1125#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 1126#(= 1 (select |#valid| entry_point_~array~0.base)), 1127#(= |#valid| |old(#valid)|), 1128#(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|)), 1129#(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-04 03:21:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:21:32,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:21:32,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:21:32,554 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 9 states. [2018-02-04 03:21:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:32,708 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-04 03:21:32,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:21:32,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 03:21:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:32,710 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:21:32,710 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:21:32,710 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-04 03:21:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:21:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-02-04 03:21:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 03:21:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 03:21:32,714 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2018-02-04 03:21:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:32,714 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 03:21:32,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:21:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 03:21:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:21:32,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:32,716 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-04 03:21:32,716 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-02-04 03:21:32,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:32,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:32,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:21:32,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,963 INFO L182 omatonBuilderFactory]: Interpolants [1256#true, 1257#false, 1258#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 1259#(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))), 1260#(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|))))), 1261#(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|)), 1262#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 1263#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 1264#(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)), 1265#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1266#(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|))), 1267#(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|))))), 1268#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0))] [2018-02-04 03:21:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:32,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:21:32,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:21:32,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:21:32,964 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 13 states. [2018-02-04 03:21:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:33,378 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-02-04 03:21:33,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:21:33,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 03:21:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:33,380 INFO L225 Difference]: With dead ends: 113 [2018-02-04 03:21:33,380 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 03:21:33,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:21:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 03:21:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 55. [2018-02-04 03:21:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 03:21:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-02-04 03:21:33,385 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 28 [2018-02-04 03:21:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:33,385 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-02-04 03:21:33,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:21:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-02-04 03:21:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:21:33,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:33,386 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-04 03:21:33,386 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1623272965, now seen corresponding path program 1 times [2018-02-04 03:21:33,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:33,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:21:33,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:33,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:21:33,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:33,421 INFO L182 omatonBuilderFactory]: Interpolants [1459#true, 1460#false, 1461#(= entry_point_~i~0 0), 1462#(<= (+ entry_point_~j~0 1) 0)] [2018-02-04 03:21:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:21:33,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:21:33,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:21:33,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:21:33,421 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-02-04 03:21:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:33,443 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-02-04 03:21:33,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:21:33,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 03:21:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:33,444 INFO L225 Difference]: With dead ends: 64 [2018-02-04 03:21:33,444 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 03:21:33,444 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-04 03:21:33,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 03:21:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-04 03:21:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 03:21:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 03:21:33,447 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2018-02-04 03:21:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:33,447 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 03:21:33,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:21:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 03:21:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:21:33,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:33,448 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-04 03:21:33,449 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1889590311, now seen corresponding path program 1 times [2018-02-04 03:21:33,450 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:33,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:33,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:33,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:21:33,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:33,535 INFO L182 omatonBuilderFactory]: Interpolants [1589#true, 1590#false, 1591#(= |#valid| |old(#valid)|), 1592#(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)), 1593#(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|))), 1594#(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)), 1595#(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-04 03:21:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:33,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:21:33,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:21:33,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:21:33,536 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 7 states. [2018-02-04 03:21:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:33,665 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-02-04 03:21:33,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:21:33,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 03:21:33,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:33,666 INFO L225 Difference]: With dead ends: 67 [2018-02-04 03:21:33,666 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 03:21:33,666 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-04 03:21:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 03:21:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 03:21:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 03:21:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 03:21:33,670 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 32 [2018-02-04 03:21:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:33,670 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 03:21:33,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:21:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 03:21:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:21:33,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:33,671 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:33,671 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:33,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1399829189, now seen corresponding path program 1 times [2018-02-04 03:21:33,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:33,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:21:33,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:33,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:21:33,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:21:33,704 INFO L182 omatonBuilderFactory]: Interpolants [1728#(not (= 0 |ldv_malloc_#res.base|)), 1729#(not (= 0 |entry_point_#t~ret4.base|)), 1730#(not (= 0 entry_point_~p~0.base)), 1725#true, 1726#false, 1727#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-04 03:21:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:21:33,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:21:33,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:21:33,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:21:33,705 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-02-04 03:21:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:33,736 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-02-04 03:21:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:21:33,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 03:21:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:33,737 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:21:33,737 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 03:21:33,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:21:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 03:21:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2018-02-04 03:21:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 03:21:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-04 03:21:33,740 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2018-02-04 03:21:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:33,740 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-04 03:21:33,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:21:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-04 03:21:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:21:33,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:33,740 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, 1] [2018-02-04 03:21:33,740 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash -172063678, now seen corresponding path program 1 times [2018-02-04 03:21:33,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:33,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:33,778 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-04 03:21:33,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:33,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:21:33,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:21:33,779 INFO L182 omatonBuilderFactory]: Interpolants [1864#true, 1865#false, 1866#(<= 10 entry_point_~len~0), 1867#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1868#(<= (+ entry_point_~i~0 9) entry_point_~len~0)] [2018-02-04 03:21:33,779 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-04 03:21:33,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:21:33,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:21:33,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:33,779 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-02-04 03:21:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:33,813 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-04 03:21:33,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:21:33,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 03:21:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:33,814 INFO L225 Difference]: With dead ends: 85 [2018-02-04 03:21:33,814 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 03:21:33,814 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-04 03:21:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 03:21:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2018-02-04 03:21:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 03:21:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-04 03:21:33,817 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35 [2018-02-04 03:21:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:33,817 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-04 03:21:33,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:21:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-04 03:21:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:21:33,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:33,818 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-04 03:21:33,818 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:33,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1801461727, now seen corresponding path program 1 times [2018-02-04 03:21:33,819 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:33,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:34,090 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-04 03:21:34,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:34,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:21:34,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:34,091 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-04 03:21:34,091 INFO L182 omatonBuilderFactory]: Interpolants [2016#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 2017#(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))), 2018#(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|))), 2019#(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)), 2020#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 2021#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 2022#(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)), 2023#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2024#(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|))), 2025#(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|))))), 2026#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2027#(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))), 2028#(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))), 2014#true, 2015#false] [2018-02-04 03:21:34,091 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-04 03:21:34,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:21:34,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:21:34,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:21:34,091 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 15 states. [2018-02-04 03:21:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:34,475 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-02-04 03:21:34,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:21:34,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-04 03:21:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:34,476 INFO L225 Difference]: With dead ends: 99 [2018-02-04 03:21:34,477 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 03:21:34,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:21:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 03:21:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2018-02-04 03:21:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 03:21:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-04 03:21:34,480 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 41 [2018-02-04 03:21:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:34,480 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-04 03:21:34,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:21:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-04 03:21:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:21:34,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:34,481 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-04 03:21:34,481 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash -867371792, now seen corresponding path program 1 times [2018-02-04 03:21:34,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:34,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:34,556 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-04 03:21:34,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:21:34,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:21:34,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:34,557 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-04 03:21:34,557 INFO L182 omatonBuilderFactory]: Interpolants [2214#true, 2215#false, 2216#(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))), 2217#(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))), 2218#(= |old(#length)| |#length|), 2219#(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)))] [2018-02-04 03:21:34,557 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-04 03:21:34,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:21:34,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:21:34,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:21:34,558 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2018-02-04 03:21:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:34,616 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-04 03:21:34,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:21:34,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 03:21:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:34,616 INFO L225 Difference]: With dead ends: 64 [2018-02-04 03:21:34,616 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 03:21:34,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:21:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 03:21:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-04 03:21:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 03:21:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-02-04 03:21:34,619 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 42 [2018-02-04 03:21:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:34,619 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-02-04 03:21:34,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:21:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-02-04 03:21:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:21:34,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:34,620 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-04 03:21:34,620 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721778, now seen corresponding path program 1 times [2018-02-04 03:21:34,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:34,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:34,804 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-04 03:21:34,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:34,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:21:34,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:34,805 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-04 03:21:34,805 INFO L182 omatonBuilderFactory]: Interpolants [2348#true, 2349#false, 2350#(= 0 |ldv_malloc_#t~malloc1.offset|), 2351#(= 0 |ldv_malloc_#res.offset|), 2352#(= 0 |entry_point_#t~ret2.offset|), 2353#(= entry_point_~array~0.offset 0), 2354#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2355#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 2356#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 2357#(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))))), 2358#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 2359#(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))))), 2360#(= |entry_point_#t~mem7.offset| 0)] [2018-02-04 03:21:34,805 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-04 03:21:34,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:21:34,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:21:34,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:21:34,806 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 13 states. [2018-02-04 03:21:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:34,922 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-04 03:21:34,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:21:34,922 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 03:21:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:34,923 INFO L225 Difference]: With dead ends: 82 [2018-02-04 03:21:34,923 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 03:21:34,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:21:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 03:21:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2018-02-04 03:21:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 03:21:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-02-04 03:21:34,926 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 43 [2018-02-04 03:21:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:34,926 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2018-02-04 03:21:34,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:21:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2018-02-04 03:21:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:21:34,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:34,927 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-04 03:21:34,927 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:34,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721777, now seen corresponding path program 1 times [2018-02-04 03:21:34,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:34,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:35,146 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-04 03:21:35,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:35,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:21:35,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:35,147 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-04 03:21:35,147 INFO L182 omatonBuilderFactory]: Interpolants [2528#true, 2529#false, 2530#(= 0 |ldv_malloc_#t~malloc1.offset|), 2531#(= 0 |ldv_malloc_#res.offset|), 2532#(= 0 |entry_point_#t~ret2.offset|), 2533#(= entry_point_~array~0.offset 0), 2534#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2535#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2536#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 2537#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2538#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2539#(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)), 2540#(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)))), 2541#(= |#valid| |old(#valid)|), 2542#(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)))))), 2543#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:21:35,147 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-04 03:21:35,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:21:35,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:21:35,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:21:35,148 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 16 states. [2018-02-04 03:21:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:35,355 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-02-04 03:21:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:21:35,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-04 03:21:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:35,356 INFO L225 Difference]: With dead ends: 76 [2018-02-04 03:21:35,356 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 03:21:35,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:21:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 03:21:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-02-04 03:21:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 03:21:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-02-04 03:21:35,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 43 [2018-02-04 03:21:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:35,358 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-02-04 03:21:35,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:21:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-02-04 03:21:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:21:35,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:35,358 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-04 03:21:35,358 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1351278396, now seen corresponding path program 1 times [2018-02-04 03:21:35,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:35,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:35,386 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-04 03:21:35,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:35,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:21:35,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:35,387 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-04 03:21:35,387 INFO L182 omatonBuilderFactory]: Interpolants [2707#true, 2708#false, 2709#(= entry_point_~i~0 0), 2710#(<= 1 entry_point_~i~0), 2711#(<= 0 entry_point_~j~0)] [2018-02-04 03:21:35,387 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-04 03:21:35,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:21:35,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:21:35,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:21:35,388 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 5 states. [2018-02-04 03:21:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:35,417 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-02-04 03:21:35,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:21:35,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-04 03:21:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:35,417 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:21:35,417 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 03:21:35,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:21:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 03:21:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 03:21:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 03:21:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-02-04 03:21:35,420 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 45 [2018-02-04 03:21:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:35,420 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-02-04 03:21:35,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:21:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-02-04 03:21:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:21:35,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:35,421 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-04 03:21:35,421 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811508, now seen corresponding path program 1 times [2018-02-04 03:21:35,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:35,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:35,687 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-04 03:21:35,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:35,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:21:35,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:35,688 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-04 03:21:35,688 INFO L182 omatonBuilderFactory]: Interpolants [2880#(= 1 (select |#valid| entry_point_~array~0.base)), 2862#true, 2863#false, 2864#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 2865#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 2866#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 2867#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 2868#(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)), 2869#(= |#valid| |old(#valid)|), 2870#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 2871#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 2872#(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)), 2873#(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)))), 2874#(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))), 2875#(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)), 2876#(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))))), 2877#(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))), 2878#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 2879#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0))] [2018-02-04 03:21:35,688 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-04 03:21:35,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:21:35,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:21:35,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:21:35,688 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 19 states. [2018-02-04 03:21:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:36,179 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2018-02-04 03:21:36,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:21:36,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-04 03:21:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:36,180 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:21:36,180 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:21:36,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:21:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:21:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2018-02-04 03:21:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 03:21:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2018-02-04 03:21:36,183 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 48 [2018-02-04 03:21:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:36,183 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2018-02-04 03:21:36,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:21:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2018-02-04 03:21:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:21:36,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:36,184 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-04 03:21:36,184 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811557, now seen corresponding path program 1 times [2018-02-04 03:21:36,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:36,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:36,208 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-04 03:21:36,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:36,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:21:36,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:36,209 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-04 03:21:36,209 INFO L182 omatonBuilderFactory]: Interpolants [3109#true, 3110#false, 3111#(= entry_point_~i~0 0), 3112#(<= entry_point_~i~0 1), 3113#(<= entry_point_~j~0 0), 3114#(<= (+ entry_point_~j~0 1) 0)] [2018-02-04 03:21:36,209 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-04 03:21:36,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:21:36,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:21:36,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:21:36,210 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand 6 states. [2018-02-04 03:21:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:36,238 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-04 03:21:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:21:36,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-02-04 03:21:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:36,241 INFO L225 Difference]: With dead ends: 82 [2018-02-04 03:21:36,241 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 03:21:36,241 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-04 03:21:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 03:21:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-04 03:21:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 03:21:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-02-04 03:21:36,243 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 48 [2018-02-04 03:21:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:36,243 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-02-04 03:21:36,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:21:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-02-04 03:21:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 03:21:36,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:36,244 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, 1, 1] [2018-02-04 03:21:36,244 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:36,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1145466009, now seen corresponding path program 1 times [2018-02-04 03:21:36,245 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:36,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:36,293 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-04 03:21:36,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:36,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:21:36,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:36,294 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-04 03:21:36,294 INFO L182 omatonBuilderFactory]: Interpolants [3280#false, 3281#(<= 10 entry_point_~len~0), 3282#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 3283#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 3284#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 3279#true] [2018-02-04 03:21:36,294 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-04 03:21:36,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:21:36,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:21:36,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:21:36,295 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 6 states. [2018-02-04 03:21:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:36,330 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2018-02-04 03:21:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:21:36,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-04 03:21:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:36,331 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:21:36,331 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:21:36,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:21:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:21:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2018-02-04 03:21:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 03:21:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-02-04 03:21:36,333 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 49 [2018-02-04 03:21:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:36,333 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-02-04 03:21:36,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:21:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-02-04 03:21:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:21:36,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:36,334 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-04 03:21:36,334 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1267150670, now seen corresponding path program 1 times [2018-02-04 03:21:36,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:36,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:37,084 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-04 03:21:37,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:37,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:21:37,085 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:37,085 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-04 03:21:37,085 INFO L182 omatonBuilderFactory]: Interpolants [3488#(= |#valid| |old(#valid)|), 3489#(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|)), 3490#(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)), 3491#(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)), 3492#(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))), 3493#(and (or (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= entry_point_~array~0.base 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)))) (= entry_point_~array~0.offset 0)), 3494#(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|))), 3495#(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|))), 3496#(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))))), 3497#(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))))), 3498#(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)))), 3499#(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)), 3500#(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)))), 3501#(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)), 3502#(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)), 3503#(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)))), 3504#(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)), 3486#true, 3487#false] [2018-02-04 03:21:37,085 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-04 03:21:37,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:21:37,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:21:37,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:21:37,086 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 19 states. [2018-02-04 03:21:38,390 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 107 DAG size of output 90 [2018-02-04 03:21:38,675 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 109 DAG size of output 92 [2018-02-04 03:21:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:38,720 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-02-04 03:21:38,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:21:38,720 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-04 03:21:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:38,721 INFO L225 Difference]: With dead ends: 99 [2018-02-04 03:21:38,721 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 03:21:38,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:21:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 03:21:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2018-02-04 03:21:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 03:21:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-02-04 03:21:38,724 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 51 [2018-02-04 03:21:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:38,724 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-02-04 03:21:38,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:21:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-02-04 03:21:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 03:21:38,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:38,725 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-04 03:21:38,725 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash 498105172, now seen corresponding path program 2 times [2018-02-04 03:21:38,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:38,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:39,043 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-04 03:21:39,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:39,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:21:39,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:39,044 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-04 03:21:39,045 INFO L182 omatonBuilderFactory]: Interpolants [3712#(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)), 3713#(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)), 3714#(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))), 3699#true, 3700#false, 3701#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 3702#(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))), 3703#(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|))))), 3704#(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|)), 3705#(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)), 3706#(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)), 3707#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3708#(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|))), 3709#(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|))))), 3710#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 3711#(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))] [2018-02-04 03:21:39,045 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-04 03:21:39,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:21:39,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:21:39,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:21:39,046 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 16 states. [2018-02-04 03:21:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:39,467 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-04 03:21:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:21:39,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-02-04 03:21:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:39,468 INFO L225 Difference]: With dead ends: 93 [2018-02-04 03:21:39,468 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 03:21:39,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:21:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 03:21:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2018-02-04 03:21:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:21:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-04 03:21:39,470 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 54 [2018-02-04 03:21:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:39,470 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-04 03:21:39,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:21:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-04 03:21:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:21:39,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:39,470 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-04 03:21:39,471 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:39,471 INFO L82 PathProgramCache]: Analyzing trace with hash 486079299, now seen corresponding path program 2 times [2018-02-04 03:21:39,472 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:39,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:39,710 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-04 03:21:39,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:39,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:21:39,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:39,710 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-04 03:21:39,711 INFO L182 omatonBuilderFactory]: Interpolants [3904#(= 0 |ldv_malloc_#t~malloc1.offset|), 3905#(= 0 |ldv_malloc_#res.offset|), 3906#(= 0 |entry_point_#t~ret2.offset|), 3907#(= entry_point_~array~0.offset 0), 3908#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 3909#(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))))), 3910#(= 0 |entry_point_#t~ret4.offset|), 3911#(= 0 entry_point_~p~0.offset), 3912#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3913#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))), 3914#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))), 3915#(= |entry_point_#t~mem7.offset| 0), 3902#true, 3903#false] [2018-02-04 03:21:39,711 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-04 03:21:39,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:21:39,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:21:39,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:21:39,712 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 14 states. [2018-02-04 03:21:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:39,967 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-02-04 03:21:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:21:39,968 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-04 03:21:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:39,968 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:21:39,968 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:21:39,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:21:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:21:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-02-04 03:21:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:21:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-04 03:21:39,971 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 56 [2018-02-04 03:21:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:39,971 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-04 03:21:39,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:21:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-04 03:21:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:21:39,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:39,972 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-04 03:21:39,972 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:39,972 INFO L82 PathProgramCache]: Analyzing trace with hash 486079300, now seen corresponding path program 2 times [2018-02-04 03:21:39,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:39,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:40,174 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-04 03:21:40,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:40,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:21:40,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:40,174 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-04 03:21:40,174 INFO L182 omatonBuilderFactory]: Interpolants [4078#true, 4079#false, 4080#(= 0 |ldv_malloc_#t~malloc1.offset|), 4081#(= 0 |ldv_malloc_#res.offset|), 4082#(= 0 |entry_point_#t~ret2.offset|), 4083#(= entry_point_~array~0.offset 0), 4084#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4085#(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))))), 4086#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4087#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4088#(= 1 (select |#valid| |entry_point_#t~ret4.base|)), 4089#(= 1 (select |#valid| entry_point_~p~0.base)), 4090#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 4091#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4)))))), 4092#(= |#valid| |old(#valid)|), 4093#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 4094#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:21:40,175 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-04 03:21:40,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:21:40,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:21:40,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:21:40,175 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 17 states. [2018-02-04 03:21:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:40,527 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-02-04 03:21:40,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:21:40,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-04 03:21:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:40,528 INFO L225 Difference]: With dead ends: 73 [2018-02-04 03:21:40,528 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 03:21:40,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:21:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 03:21:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-04 03:21:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:21:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-02-04 03:21:40,530 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 56 [2018-02-04 03:21:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:40,530 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-02-04 03:21:40,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:21:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-02-04 03:21:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:21:40,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:40,531 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-04 03:21:40,531 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash 43207056, now seen corresponding path program 2 times [2018-02-04 03:21:40,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:40,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:40,790 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-04 03:21:40,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:40,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:21:40,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:40,791 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-04 03:21:40,791 INFO L182 omatonBuilderFactory]: Interpolants [4288#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 4270#true, 4271#false, 4272#(= 0 |ldv_malloc_#t~malloc1.offset|), 4273#(= 0 |ldv_malloc_#res.offset|), 4274#(= 0 |entry_point_#t~ret2.offset|), 4275#(= entry_point_~array~0.offset 0), 4276#(= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0), 4277#(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))))), 4278#(and (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4279#(= (select |#valid| entry_point_~array~0.base) 1), 4280#(= |#valid| |old(#valid)|), 4281#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 4282#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 4283#(not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)), 4284#(not (= entry_point_~array~0.base entry_point_~p~0.base)), 4285#(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))))), 4286#(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))))))), 4287#(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))))))] [2018-02-04 03:21:40,791 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-04 03:21:40,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:21:40,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:21:40,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:21:40,792 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 19 states. [2018-02-04 03:21:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:41,218 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-04 03:21:41,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:21:41,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-02-04 03:21:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:41,218 INFO L225 Difference]: With dead ends: 101 [2018-02-04 03:21:41,218 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 03:21:41,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:21:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 03:21:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2018-02-04 03:21:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 03:21:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 03:21:41,221 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 61 [2018-02-04 03:21:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:41,221 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 03:21:41,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:21:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 03:21:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:21:41,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:41,222 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-04 03:21:41,222 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:41,222 INFO L82 PathProgramCache]: Analyzing trace with hash 43207057, now seen corresponding path program 1 times [2018-02-04 03:21:41,223 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:41,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:41,285 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-04 03:21:41,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:41,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:21:41,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:41,286 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-04 03:21:41,286 INFO L182 omatonBuilderFactory]: Interpolants [4504#true, 4505#false, 4506#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4507#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4508#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4509#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 4510#(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))), 4511#(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)))] [2018-02-04 03:21:41,286 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-04 03:21:41,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:21:41,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:21:41,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:21:41,286 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 8 states. [2018-02-04 03:21:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:41,329 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-04 03:21:41,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:21:41,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-04 03:21:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:41,330 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:21:41,330 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 03:21:41,330 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-04 03:21:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 03:21:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-02-04 03:21:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 03:21:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 03:21:41,332 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 61 [2018-02-04 03:21:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:41,332 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 03:21:41,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:21:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 03:21:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:21:41,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:41,333 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-04 03:21:41,333 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1339418765, now seen corresponding path program 1 times [2018-02-04 03:21:41,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:41,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:41,577 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-04 03:21:41,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:41,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:21:41,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:41,578 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-04 03:21:41,578 INFO L182 omatonBuilderFactory]: Interpolants [4672#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4673#(and (or (<= (* 4 entry_point_~i~0) 4) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 4674#(and (<= entry_point_~j~0 1) (or (= 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)), 4675#(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)))))), 4676#(= |entry_point_#t~mem7.offset| 0), 4661#true, 4662#false, 4663#(= 0 |ldv_malloc_#t~malloc1.offset|), 4664#(= 0 |ldv_malloc_#res.offset|), 4665#(= 0 |entry_point_#t~ret2.offset|), 4666#(= entry_point_~array~0.offset 0), 4667#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4668#(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))), 4669#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 4670#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 4671#(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)))))] [2018-02-04 03:21:41,578 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-04 03:21:41,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:21:41,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:21:41,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:21:41,578 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 16 states. [2018-02-04 03:21:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:41,822 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-04 03:21:41,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:21:41,822 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2018-02-04 03:21:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:41,823 INFO L225 Difference]: With dead ends: 99 [2018-02-04 03:21:41,823 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 03:21:41,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:21:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 03:21:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-02-04 03:21:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:21:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-02-04 03:21:41,824 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 62 [2018-02-04 03:21:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:41,825 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-02-04 03:21:41,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:21:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-02-04 03:21:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:21:41,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:41,825 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-04 03:21:41,825 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:41,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1339418766, now seen corresponding path program 1 times [2018-02-04 03:21:41,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:41,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:42,491 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-04 03:21:42,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:42,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:21:42,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:42,492 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-04 03:21:42,492 INFO L182 omatonBuilderFactory]: Interpolants [4884#true, 4885#false, 4886#(= 0 |ldv_malloc_#t~malloc1.offset|), 4887#(= 0 |ldv_malloc_#res.offset|), 4888#(= 0 |entry_point_#t~ret2.offset|), 4889#(= entry_point_~array~0.offset 0), 4890#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4891#(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))))), 4892#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4893#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4894#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| |entry_point_#t~ret4.base|) 1)), 4895#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4896#(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)), 4897#(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)), 4898#(= |#valid| |old(#valid)|), 4899#(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|)), 4900#(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|))))), 4901#(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)), 4902#(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))), 4903#(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))), 4904#(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)), 4905#(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)), 4906#(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)), 4907#(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)), 4908#(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)))))), 4909#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:21:42,492 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-04 03:21:42,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:21:42,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:21:42,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:21:42,493 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 26 states. [2018-02-04 03:21:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:43,044 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-02-04 03:21:43,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:21:43,044 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-04 03:21:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:43,045 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:21:43,045 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:21:43,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:21:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:21:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-02-04 03:21:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:21:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-02-04 03:21:43,047 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 62 [2018-02-04 03:21:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:43,047 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-02-04 03:21:43,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:21:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-02-04 03:21:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 03:21:43,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:43,048 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-04 03:21:43,048 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash 604576341, now seen corresponding path program 2 times [2018-02-04 03:21:43,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:43,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:43,560 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-04 03:21:43,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:43,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:21:43,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:43,561 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-04 03:21:43,561 INFO L182 omatonBuilderFactory]: Interpolants [5120#(= |#valid| |old(#valid)|), 5121#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 5122#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 5123#(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|))), 5124#(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))), 5125#(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)))), 5126#(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)))))), 5127#(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)), 5128#(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)), 5129#(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)), 5130#(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)), 5131#(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)))))))), 5132#(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)), 5133#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 5134#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0)), 5135#(= 1 (select |#valid| entry_point_~array~0.base)), 5114#true, 5115#false, 5116#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5117#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5118#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 5119#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-04 03:21:43,561 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-04 03:21:43,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:21:43,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:21:43,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:21:43,562 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 22 states. [2018-02-04 03:21:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:45,368 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-02-04 03:21:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 03:21:45,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-04 03:21:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:45,369 INFO L225 Difference]: With dead ends: 133 [2018-02-04 03:21:45,369 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 03:21:45,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=671, Invalid=2521, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 03:21:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 03:21:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99. [2018-02-04 03:21:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 03:21:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-02-04 03:21:45,372 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 67 [2018-02-04 03:21:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:45,373 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-02-04 03:21:45,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:21:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-02-04 03:21:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 03:21:45,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:45,373 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-04 03:21:45,374 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:45,374 INFO L82 PathProgramCache]: Analyzing trace with hash 604576390, now seen corresponding path program 3 times [2018-02-04 03:21:45,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:45,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:45,425 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-04 03:21:45,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:45,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:21:45,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:45,426 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-04 03:21:45,426 INFO L182 omatonBuilderFactory]: Interpolants [5440#(= entry_point_~i~0 0), 5441#(<= entry_point_~i~0 1), 5442#(<= entry_point_~i~0 2), 5443#(<= entry_point_~j~0 1), 5444#(<= entry_point_~j~0 0), 5445#(<= (+ entry_point_~j~0 1) 0), 5438#true, 5439#false] [2018-02-04 03:21:45,426 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-04 03:21:45,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:21:45,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:21:45,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:21:45,427 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 8 states. [2018-02-04 03:21:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:45,486 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-02-04 03:21:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:21:45,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-02-04 03:21:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:45,487 INFO L225 Difference]: With dead ends: 100 [2018-02-04 03:21:45,487 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 03:21:45,488 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-04 03:21:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 03:21:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-04 03:21:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 03:21:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-02-04 03:21:45,490 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 67 [2018-02-04 03:21:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:45,491 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-02-04 03:21:45,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:21:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-02-04 03:21:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 03:21:45,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:45,491 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2018-02-04 03:21:45,492 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2021752934, now seen corresponding path program 1 times [2018-02-04 03:21:45,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:45,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-04 03:21:45,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:45,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:21:45,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:45,542 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-04 03:21:45,542 INFO L182 omatonBuilderFactory]: Interpolants [5648#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 5649#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 5650#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 5651#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 5645#true, 5646#false, 5647#(<= 10 entry_point_~len~0)] [2018-02-04 03:21:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-04 03:21:45,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:21:45,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:21:45,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:21:45,543 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 7 states. [2018-02-04 03:21:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:45,594 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2018-02-04 03:21:45,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:21:45,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-02-04 03:21:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:45,596 INFO L225 Difference]: With dead ends: 139 [2018-02-04 03:21:45,596 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 03:21:45,596 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-04 03:21:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 03:21:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-02-04 03:21:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 03:21:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-04 03:21:45,599 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 68 [2018-02-04 03:21:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:45,599 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-04 03:21:45,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:21:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-04 03:21:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 03:21:45,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:45,600 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-04 03:21:45,600 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:45,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2135916493, now seen corresponding path program 2 times [2018-02-04 03:21:45,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:45,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:48,244 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-04 03:21:48,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:48,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:21:48,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:48,245 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-04 03:21:48,245 INFO L182 omatonBuilderFactory]: Interpolants [5896#true, 5897#false, 5898#(= |#valid| |old(#valid)|), 5899#(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|)), 5900#(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)), 5901#(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)), 5902#(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))), 5903#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 5904#(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|))), 5905#(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|))), 5906#(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|))), 5907#(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))), 5908#(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)))), 5909#(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))))))), 5910#(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))))), 5911#(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|)), 5912#(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|)))), 5913#(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|))))), 5914#(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))), 5915#(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))), 5916#(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)), 5917#(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)))), 5918#(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)))), 5919#(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)), 5920#(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)), 5921#(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)), 5922#(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)|)))))), 5923#(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)))), 5924#(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-04 03:21:48,245 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-04 03:21:48,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:21:48,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:21:48,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:21:48,246 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 29 states. [2018-02-04 03:21:48,554 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-02-04 03:21:49,509 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 94 DAG size of output 94 [2018-02-04 03:21:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:50,416 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-04 03:21:50,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:21:50,416 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2018-02-04 03:21:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:50,416 INFO L225 Difference]: With dead ends: 103 [2018-02-04 03:21:50,416 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 03:21:50,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:21:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 03:21:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 03:21:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 03:21:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 03:21:50,419 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 70 [2018-02-04 03:21:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:50,419 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 03:21:50,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:21:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 03:21:50,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 03:21:50,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:50,420 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-04 03:21:50,420 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:50,420 INFO L82 PathProgramCache]: Analyzing trace with hash 872069176, now seen corresponding path program 2 times [2018-02-04 03:21:50,420 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:50,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:50,783 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-04 03:21:50,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:50,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:21:50,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:50,784 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-04 03:21:50,784 INFO L182 omatonBuilderFactory]: Interpolants [6146#true, 6147#false, 6148#(= 0 |ldv_malloc_#t~malloc1.offset|), 6149#(= 0 |ldv_malloc_#res.offset|), 6150#(= 0 |entry_point_#t~ret2.offset|), 6151#(= entry_point_~array~0.offset 0), 6152#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6153#(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))))), 6154#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 6155#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 6156#(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))))), 6157#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 6158#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 6159#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 6160#(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))))), 6161#(= |entry_point_#t~mem7.offset| 0)] [2018-02-04 03:21:50,784 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-04 03:21:50,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:21:50,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:21:50,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:21:50,785 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 16 states. [2018-02-04 03:21:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:51,120 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-04 03:21:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:21:51,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-02-04 03:21:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:51,121 INFO L225 Difference]: With dead ends: 83 [2018-02-04 03:21:51,121 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 03:21:51,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:21:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 03:21:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-02-04 03:21:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 03:21:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-04 03:21:51,123 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 75 [2018-02-04 03:21:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:51,123 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-04 03:21:51,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:21:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-04 03:21:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 03:21:51,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:51,124 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-04 03:21:51,124 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash 872069177, now seen corresponding path program 2 times [2018-02-04 03:21:51,125 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:51,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:51,802 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-04 03:21:51,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:51,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:21:51,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:51,802 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-04 03:21:51,802 INFO L182 omatonBuilderFactory]: Interpolants [6361#true, 6362#false, 6363#(= 0 |ldv_malloc_#t~malloc1.offset|), 6364#(= 0 |ldv_malloc_#res.offset|), 6365#(= 0 |entry_point_#t~ret2.offset|), 6366#(= entry_point_~array~0.offset 0), 6367#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6368#(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))), 6369#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 6370#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 6371#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0)), 6372#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 6373#(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)), 6374#(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)))))), 6375#(= |#valid| |old(#valid)|), 6376#(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)), 6377#(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|))))), 6378#(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|))), 6379#(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)))))), 6380#(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)))))), 6381#(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)))))), 6382#(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)))))), 6383#(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|))), 6384#(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)))))), 6385#(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)), 6386#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:21:51,803 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-04 03:21:51,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:21:51,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:21:51,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:21:51,803 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 26 states. [2018-02-04 03:21:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:52,678 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-02-04 03:21:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:21:52,678 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-02-04 03:21:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:52,679 INFO L225 Difference]: With dead ends: 87 [2018-02-04 03:21:52,679 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 03:21:52,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=256, Invalid=2000, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:21:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 03:21:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-02-04 03:21:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 03:21:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-04 03:21:52,681 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 75 [2018-02-04 03:21:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:52,681 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-04 03:21:52,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:21:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-04 03:21:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 03:21:52,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:52,681 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-04 03:21:52,681 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1789239877, now seen corresponding path program 4 times [2018-02-04 03:21:52,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:52,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:53,136 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-04 03:21:53,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:53,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:21:53,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:53,137 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-04 03:21:53,137 INFO L182 omatonBuilderFactory]: Interpolants [6624#(= (select |#valid| entry_point_~array~0.base) 1), 6601#true, 6602#false, 6603#(= 0 |ldv_malloc_#t~malloc1.offset|), 6604#(= 0 |ldv_malloc_#res.offset|), 6605#(= 0 |entry_point_#t~ret2.offset|), 6606#(= entry_point_~array~0.offset 0), 6607#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6608#(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))), 6609#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6610#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6611#(= |#valid| |old(#valid)|), 6612#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6613#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6614#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 6615#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 6616#(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)))))), 6617#(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)), 6618#(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)), 6619#(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)), 6620#(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)), 6621#(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|)))), 6622#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6623#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-04 03:21:53,137 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-04 03:21:53,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:21:53,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:21:53,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:21:53,138 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 24 states. [2018-02-04 03:21:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:53,802 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-02-04 03:21:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:21:53,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80 [2018-02-04 03:21:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:53,803 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:21:53,803 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 03:21:53,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=1785, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:21:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 03:21:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-02-04 03:21:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 03:21:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-02-04 03:21:53,805 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 80 [2018-02-04 03:21:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:53,806 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2018-02-04 03:21:53,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:21:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2018-02-04 03:21:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 03:21:53,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:53,807 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-04 03:21:53,807 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1789239876, now seen corresponding path program 2 times [2018-02-04 03:21:53,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:53,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:53,907 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-04 03:21:53,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:53,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:21:53,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:53,908 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-04 03:21:53,908 INFO L182 omatonBuilderFactory]: Interpolants [6896#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6897#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6898#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6899#(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))), 6900#(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))), 6891#true, 6892#false, 6893#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6894#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6895#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))] [2018-02-04 03:21:53,908 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-04 03:21:53,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:21:53,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:21:53,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:21:53,909 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 10 states. [2018-02-04 03:21:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:54,009 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-02-04 03:21:54,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:21:54,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-02-04 03:21:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:54,010 INFO L225 Difference]: With dead ends: 110 [2018-02-04 03:21:54,010 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 03:21:54,010 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-04 03:21:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 03:21:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2018-02-04 03:21:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 03:21:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-02-04 03:21:54,013 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 80 [2018-02-04 03:21:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:54,013 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-02-04 03:21:54,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:21:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-02-04 03:21:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:21:54,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:54,014 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-04 03:21:54,014 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 368138690, now seen corresponding path program 3 times [2018-02-04 03:21:54,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:54,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:54,457 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-04 03:21:54,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:54,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:21:54,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:54,458 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-04 03:21:54,458 INFO L182 omatonBuilderFactory]: Interpolants [7136#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 7137#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 7138#(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)))))), 7139#(= |entry_point_#t~mem7.offset| 0), 7121#true, 7122#false, 7123#(= 0 |ldv_malloc_#t~malloc1.offset|), 7124#(= 0 |ldv_malloc_#res.offset|), 7125#(= 0 |entry_point_#t~ret2.offset|), 7126#(= entry_point_~array~0.offset 0), 7127#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7128#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 7129#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 7130#(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))))), 7131#(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)), 7132#(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))), 7133#(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))), 7134#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 7135#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0))] [2018-02-04 03:21:54,458 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-04 03:21:54,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:21:54,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:21:54,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:21:54,459 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 19 states. [2018-02-04 03:21:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:54,692 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-02-04 03:21:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:21:54,692 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-02-04 03:21:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:54,693 INFO L225 Difference]: With dead ends: 119 [2018-02-04 03:21:54,693 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:21:54,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:21:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:21:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2018-02-04 03:21:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:21:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-02-04 03:21:54,695 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 81 [2018-02-04 03:21:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:54,695 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-02-04 03:21:54,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:21:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-02-04 03:21:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:21:54,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:54,695 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-04 03:21:54,695 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash 368138691, now seen corresponding path program 3 times [2018-02-04 03:21:54,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:54,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:55,857 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-04 03:21:55,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:55,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:21:55,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:55,858 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-04 03:21:55,858 INFO L182 omatonBuilderFactory]: Interpolants [7385#true, 7386#false, 7387#(= 0 |ldv_malloc_#t~malloc1.offset|), 7388#(= 0 |ldv_malloc_#res.offset|), 7389#(= 0 |entry_point_#t~ret2.offset|), 7390#(= entry_point_~array~0.offset 0), 7391#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7392#(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))), 7393#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 7394#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7395#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7396#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7397#(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)), 7398#(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)))), 7399#(= |#valid| |old(#valid)|), 7400#(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)), 7401#(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|))))), 7402#(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|))), 7403#(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))), 7404#(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))), 7405#(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)))), 7406#(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|))), 7407#(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)), 7408#(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)), 7409#(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))))), 7410#(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))), 7411#(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|))), 7412#(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)), 7413#(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)))))), 7414#(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)), 7415#(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)), 7416#(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)))))), 7417#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:21:55,858 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-04 03:21:55,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:21:55,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:21:55,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:21:55,859 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 33 states. [2018-02-04 03:21:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:56,939 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2018-02-04 03:21:56,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:21:56,939 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 81 [2018-02-04 03:21:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:56,940 INFO L225 Difference]: With dead ends: 114 [2018-02-04 03:21:56,940 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 03:21:56,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=283, Invalid=2579, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 03:21:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 03:21:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2018-02-04 03:21:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:21:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-02-04 03:21:56,943 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 81 [2018-02-04 03:21:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:56,943 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-02-04 03:21:56,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:21:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-02-04 03:21:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 03:21:56,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:56,944 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-04 03:21:56,944 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1592489080, now seen corresponding path program 3 times [2018-02-04 03:21:56,945 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:56,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:57,004 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-04 03:21:57,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:57,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:21:57,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:57,005 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-04 03:21:57,005 INFO L182 omatonBuilderFactory]: Interpolants [7682#true, 7683#false, 7684#(= entry_point_~i~0 0), 7685#(<= 1 entry_point_~i~0), 7686#(<= 2 entry_point_~i~0), 7687#(<= 3 entry_point_~i~0), 7688#(<= 2 entry_point_~j~0), 7689#(<= 1 entry_point_~j~0), 7690#(<= 0 entry_point_~j~0)] [2018-02-04 03:21:57,005 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-04 03:21:57,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:21:57,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:21:57,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:21:57,006 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 9 states. [2018-02-04 03:21:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:57,081 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-04 03:21:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:21:57,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-02-04 03:21:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:57,082 INFO L225 Difference]: With dead ends: 107 [2018-02-04 03:21:57,082 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 03:21:57,082 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-04 03:21:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 03:21:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 03:21:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 03:21:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-02-04 03:21:57,084 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 83 [2018-02-04 03:21:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:57,085 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-02-04 03:21:57,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:21:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-02-04 03:21:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:21:57,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:57,085 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:57,085 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1913440706, now seen corresponding path program 1 times [2018-02-04 03:21:57,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:57,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 03:21:57,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:57,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:21:57,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:57,141 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-04 03:21:57,141 INFO L182 omatonBuilderFactory]: Interpolants [7911#true, 7912#false, 7913#(<= 10 entry_point_~len~0), 7914#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 7915#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 7916#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 7917#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 7918#(<= (+ entry_point_~i~0 6) entry_point_~len~0)] [2018-02-04 03:21:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 03:21:57,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:21:57,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:21:57,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:21:57,142 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 8 states. [2018-02-04 03:21:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:57,211 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2018-02-04 03:21:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:21:57,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2018-02-04 03:21:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:57,212 INFO L225 Difference]: With dead ends: 156 [2018-02-04 03:21:57,213 INFO L226 Difference]: Without dead ends: 156 [2018-02-04 03:21:57,213 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-04 03:21:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-04 03:21:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2018-02-04 03:21:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 03:21:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-02-04 03:21:57,215 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 86 [2018-02-04 03:21:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:57,216 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-02-04 03:21:57,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:21:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-02-04 03:21:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:21:57,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:57,216 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-04 03:21:57,217 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 618472000, now seen corresponding path program 3 times [2018-02-04 03:21:57,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:57,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:57,782 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-04 03:21:57,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:57,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:21:57,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:57,783 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-04 03:21:57,783 INFO L182 omatonBuilderFactory]: Interpolants [8196#true, 8197#false, 8198#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 8199#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 8200#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 8201#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 8202#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8203#(= |#valid| |old(#valid)|), 8204#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8205#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8206#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8207#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 8208#(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)))))), 8209#(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)))), 8210#(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)))), 8211#(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)))), 8212#(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)))), 8213#(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)))), 8214#(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)))), 8215#(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)))), 8216#(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)), 8217#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 8218#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:21:57,783 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-04 03:21:57,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:21:57,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:21:57,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:21:57,784 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 23 states. [2018-02-04 03:21:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:58,299 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-04 03:21:58,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:21:58,300 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-02-04 03:21:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:58,300 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:21:58,301 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:21:58,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:21:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:21:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2018-02-04 03:21:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 03:21:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-02-04 03:21:58,303 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 86 [2018-02-04 03:21:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:58,303 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-02-04 03:21:58,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:21:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-02-04 03:21:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:21:58,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:58,304 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-04 03:21:58,304 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash 618472050, now seen corresponding path program 3 times [2018-02-04 03:21:58,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:58,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:58,349 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-04 03:21:58,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:58,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:21:58,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:58,349 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-04 03:21:58,349 INFO L182 omatonBuilderFactory]: Interpolants [8484#true, 8485#false, 8486#(= entry_point_~i~0 0), 8487#(<= entry_point_~i~0 1), 8488#(<= entry_point_~i~0 2), 8489#(<= entry_point_~i~0 3), 8490#(<= entry_point_~j~0 2), 8491#(<= entry_point_~j~0 1), 8492#(<= entry_point_~j~0 0), 8493#(<= (+ entry_point_~j~0 1) 0)] [2018-02-04 03:21:58,349 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-04 03:21:58,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:21:58,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:21:58,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:21:58,350 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 10 states. [2018-02-04 03:21:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:58,409 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-02-04 03:21:58,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:21:58,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-02-04 03:21:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:58,410 INFO L225 Difference]: With dead ends: 115 [2018-02-04 03:21:58,410 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 03:21:58,410 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-04 03:21:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 03:21:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-02-04 03:21:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 03:21:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-02-04 03:21:58,412 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 86 [2018-02-04 03:21:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:58,412 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-02-04 03:21:58,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:21:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-02-04 03:21:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:21:58,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:58,413 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-04 03:21:58,413 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash -510333950, now seen corresponding path program 4 times [2018-02-04 03:21:58,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:58,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:04,415 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 129 DAG size of output 47 [2018-02-04 03:22:04,637 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 137 DAG size of output 53 [2018-02-04 03:22:05,026 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 142 DAG size of output 55 [2018-02-04 03:22:05,286 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 133 DAG size of output 54 [2018-02-04 03:22:05,805 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 107 DAG size of output 61 [2018-02-04 03:22:05,990 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 101 DAG size of output 64 [2018-02-04 03:22:06,149 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 102 DAG size of output 63 [2018-02-04 03:22:06,313 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 110 DAG size of output 70 [2018-02-04 03:22:06,525 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-02-04 03:22:06,724 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 125 DAG size of output 65 [2018-02-04 03:22:07,276 WARN L146 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 173 DAG size of output 60 [2018-02-04 03:22:07,897 WARN L146 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 178 DAG size of output 54 [2018-02-04 03:22:08,722 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 125 DAG size of output 54 [2018-02-04 03:22:09,090 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 138 DAG size of output 42 [2018-02-04 03:22:09,510 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 164 DAG size of output 42 [2018-02-04 03:22:10,038 WARN L146 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 164 DAG size of output 42 [2018-02-04 03:22:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:22:10,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:10,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 03:22:10,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:10,734 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-04 03:22:10,735 INFO L182 omatonBuilderFactory]: Interpolants [8730#true, 8731#false, 8732#(= |#valid| |old(#valid)|), 8733#(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|)), 8734#(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|))), 8735#(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)|)), 8736#(and (or (= |#valid| |old(#valid)|) (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|))) (= 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))), 8737#(and (not (= entry_point_~array~0.base 0)) (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))), 8738#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 8739#(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|)), 8740#(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|)), 8741#(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|))), 8742#(and (= 1 (select |#valid| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (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 (= 0 entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8743#(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))))), 8744#(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)), 8745#(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)), 8746#(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|))))), 8747#(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|))), 8748#(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))), 8749#(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))), 8750#(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))), 8751#(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)), 8752#(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|))), 8753#(and (or (<= (* 4 entry_point_~i~0) 7) (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)) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (or (= (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) (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 (= 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) (- 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_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|))) (= 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))))) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (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))))))) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (not (= 0 |entry_point_#t~ret4.base|))), 8754#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (or (and (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))))) (= (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)) (and (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))))) (or (= (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) (and (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))) (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)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| 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) (+ (* 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))) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base))) (= 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 (= 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)), 8755#(and (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)) (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) (+ (* 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))) (= (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) (- 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))) (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)| (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)))) (<= (* 4 entry_point_~i~0) 7)) (= 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)))) (<= (* 4 entry_point_~i~0) 8)), 8756#(and (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 11) (and (<= (* 4 entry_point_~i~0) 12) (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))))) (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))))) (or (= (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) (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) 0))) (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 (- 1))) entry_point_~array~0.offset))) (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) (- 8))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (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) (- 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))) (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))))) |old(#valid)|) (= 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.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))))), 8757#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (and (<= entry_point_~j~0 2) (or (= (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) (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))))) (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))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (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))) (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 (= 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)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 8758#(and (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|)) (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 (= 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 (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))))))), 8759#(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)), 8760#(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))))), 8761#(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|))))), 8762#(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)), 8763#(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)), 8764#(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)), 8765#(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|))), 8766#(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)|))))))] [2018-02-04 03:22:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:22:10,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 03:22:10,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 03:22:10,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:22:10,736 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 37 states. [2018-02-04 03:22:11,682 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 164 DAG size of output 88 [2018-02-04 03:22:12,262 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 143 DAG size of output 101 [2018-02-04 03:22:12,808 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 130 DAG size of output 112 [2018-02-04 03:22:13,464 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 84 DAG size of output 73 [2018-02-04 03:22:13,771 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-04 03:22:13,979 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-04 03:22:14,214 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 143 DAG size of output 86 [2018-02-04 03:22:14,452 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 152 DAG size of output 75 [2018-02-04 03:22:14,762 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 105 DAG size of output 73 [2018-02-04 03:22:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:15,066 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-02-04 03:22:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 03:22:15,067 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-02-04 03:22:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:15,067 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:22:15,067 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 03:22:15,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=336, Invalid=3570, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 03:22:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 03:22:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 03:22:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 03:22:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-04 03:22:15,069 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 89 [2018-02-04 03:22:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:15,070 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-04 03:22:15,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 03:22:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-04 03:22:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 03:22:15,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:15,070 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-04 03:22:15,070 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1582872742, now seen corresponding path program 5 times [2018-02-04 03:22:15,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:15,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:15,285 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-04 03:22:15,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:15,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:22:15,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:15,286 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-04 03:22:15,287 INFO L182 omatonBuilderFactory]: Interpolants [9024#true, 9025#false, 9026#(= (select |#valid| entry_point_~array~0.base) 1), 9027#(= |#valid| |old(#valid)|), 9028#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 9029#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 9030#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 9031#(and (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 9032#(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))))), 9033#(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)))))))), 9034#(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)))))))), 9035#(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)))))))), 9036#(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)))))), 9037#(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-04 03:22:15,287 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-04 03:22:15,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:22:15,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:22:15,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:22:15,287 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 14 states. [2018-02-04 03:22:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:15,938 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-04 03:22:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:22:15,938 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-02-04 03:22:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:15,939 INFO L225 Difference]: With dead ends: 119 [2018-02-04 03:22:15,939 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:22:15,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:22:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:22:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 89. [2018-02-04 03:22:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 03:22:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-02-04 03:22:15,942 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 93 [2018-02-04 03:22:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:15,942 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-02-04 03:22:15,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:22:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-02-04 03:22:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:22:15,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:15,943 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-04 03:22:15,943 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:15,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1824414775, now seen corresponding path program 4 times [2018-02-04 03:22:15,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:15,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:16,465 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-04 03:22:16,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:16,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:22:16,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:16,466 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-04 03:22:16,466 INFO L182 omatonBuilderFactory]: Interpolants [9293#true, 9294#false, 9295#(= 0 |ldv_malloc_#t~malloc1.offset|), 9296#(= 0 |ldv_malloc_#res.offset|), 9297#(= 0 |entry_point_#t~ret2.offset|), 9298#(= entry_point_~array~0.offset 0), 9299#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 9300#(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))), 9301#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 9302#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 9303#(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))))), 9304#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 9305#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9306#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12)))) (= entry_point_~array~0.offset 0)), 9307#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9308#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 9309#(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))))), 9310#(= |entry_point_#t~mem7.offset| 0)] [2018-02-04 03:22:16,466 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-04 03:22:16,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:22:16,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:22:16,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:22:16,467 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 18 states. [2018-02-04 03:22:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:16,979 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-02-04 03:22:16,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:22:16,980 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-02-04 03:22:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:16,980 INFO L225 Difference]: With dead ends: 93 [2018-02-04 03:22:16,980 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 03:22:16,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:22:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 03:22:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-02-04 03:22:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:22:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2018-02-04 03:22:16,983 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 94 [2018-02-04 03:22:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:16,983 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2018-02-04 03:22:16,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:22:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-02-04 03:22:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:22:16,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:16,984 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-04 03:22:16,984 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1824414776, now seen corresponding path program 4 times [2018-02-04 03:22:16,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:17,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:18,448 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-04 03:22:18,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:18,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 03:22:18,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:18,449 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-04 03:22:18,449 INFO L182 omatonBuilderFactory]: Interpolants [9538#true, 9539#false, 9540#(= 0 (select |#valid| 0)), 9541#(= (select |old(#valid)| 0) (select |#valid| 0)), 9542#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 9543#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 9544#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |#valid| 0))), 9545#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9546#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9547#(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)))), 9548#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 9549#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 9550#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 9551#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9552#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9553#(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)), 9554#(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)))))), 9555#(= |#valid| |old(#valid)|), 9556#(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)), 9557#(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|))))), 9558#(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|))), 9559#(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)))))), 9560#(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)))))), 9561#(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)))))), 9562#(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)), 9563#(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|))))), 9564#(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|))), 9565#(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)))))), 9566#(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)))))), 9567#(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)), 9568#(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)))))), 9569#(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))))), 9570#(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)))))), 9571#(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)))))), 9572#(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)))))), 9573#(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)))))), 9574#(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)), 9575#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:22:18,449 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-04 03:22:18,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 03:22:18,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 03:22:18,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:22:18,450 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 38 states. [2018-02-04 03:22:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:20,670 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-02-04 03:22:20,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 03:22:20,671 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-02-04 03:22:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:20,671 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:22:20,671 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:22:20,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=682, Invalid=5018, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 03:22:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:22:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-02-04 03:22:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:22:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-02-04 03:22:20,673 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 94 [2018-02-04 03:22:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:20,673 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-02-04 03:22:20,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 03:22:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-02-04 03:22:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:22:20,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:20,674 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-04 03:22:20,674 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:20,674 INFO L82 PathProgramCache]: Analyzing trace with hash 931684587, now seen corresponding path program 4 times [2018-02-04 03:22:20,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:20,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:20,750 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-04 03:22:20,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:20,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:22:20,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:20,751 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-04 03:22:20,751 INFO L182 omatonBuilderFactory]: Interpolants [9840#(= entry_point_~i~0 0), 9841#(<= 1 entry_point_~i~0), 9842#(<= 2 entry_point_~i~0), 9843#(<= 3 entry_point_~i~0), 9844#(<= 4 entry_point_~i~0), 9845#(<= 3 entry_point_~j~0), 9846#(<= 2 entry_point_~j~0), 9847#(<= 1 entry_point_~j~0), 9848#(<= 0 entry_point_~j~0), 9838#true, 9839#false] [2018-02-04 03:22:20,751 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-04 03:22:20,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:22:20,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:22:20,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:22:20,752 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 11 states. [2018-02-04 03:22:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:20,848 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-04 03:22:20,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:22:20,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-02-04 03:22:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:20,848 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:22:20,848 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:22:20,849 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-04 03:22:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:22:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-04 03:22:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:22:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-02-04 03:22:20,850 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 99 [2018-02-04 03:22:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:20,850 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-02-04 03:22:20,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:22:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-02-04 03:22:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:22:20,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:20,851 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-04 03:22:20,851 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 931684636, now seen corresponding path program 6 times [2018-02-04 03:22:20,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:20,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 03:22:21,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:21,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:22:21,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 03:22:21,415 INFO L182 omatonBuilderFactory]: Interpolants [10048#(= 0 |ldv_malloc_#res.offset|), 10049#(= 0 |entry_point_#t~ret2.offset|), 10050#(= entry_point_~array~0.offset 0), 10051#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10052#(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))), 10053#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10054#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10055#(= |#valid| |old(#valid)|), 10056#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10057#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10058#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 10059#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 10060#(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)))))), 10061#(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)), 10062#(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)), 10063#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~i~0 3) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))))), 10064#(and (or (<= entry_point_~j~0 2) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))) (= entry_point_~array~0.offset 0)), 10065#(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)), 10066#(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)), 10067#(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|)))), 10068#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10069#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10070#(= (select |#valid| entry_point_~array~0.base) 1), 10045#true, 10046#false, 10047#(= 0 |ldv_malloc_#t~malloc1.offset|)] [2018-02-04 03:22:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 03:22:21,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:22:21,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:22:21,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:22:21,416 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 26 states. [2018-02-04 03:22:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:22,175 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-02-04 03:22:22,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:22:22,175 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-04 03:22:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:22,176 INFO L225 Difference]: With dead ends: 138 [2018-02-04 03:22:22,176 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 03:22:22,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=2299, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 03:22:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 03:22:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2018-02-04 03:22:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 03:22:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2018-02-04 03:22:22,178 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 99 [2018-02-04 03:22:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:22,178 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2018-02-04 03:22:22,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:22:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2018-02-04 03:22:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:22:22,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:22,178 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-04 03:22:22,179 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:22,179 INFO L82 PathProgramCache]: Analyzing trace with hash 931684637, now seen corresponding path program 4 times [2018-02-04 03:22:22,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:22,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:22:22,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:22,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:22:22,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:22,268 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-04 03:22:22,269 INFO L182 omatonBuilderFactory]: Interpolants [10384#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10385#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10386#(<= 16 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10387#(<= 12 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 10388#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 10389#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 10390#(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))), 10391#(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))), 10380#true, 10381#false, 10382#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10383#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))] [2018-02-04 03:22:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:22:22,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:22:22,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:22:22,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:22:22,269 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 12 states. [2018-02-04 03:22:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:22,391 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-04 03:22:22,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:22:22,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-02-04 03:22:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:22,392 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:22:22,392 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:22:22,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:22:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:22:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2018-02-04 03:22:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 03:22:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2018-02-04 03:22:22,395 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 99 [2018-02-04 03:22:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:22,395 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2018-02-04 03:22:22,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:22:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-02-04 03:22:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:22:22,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:22,396 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:22,396 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1182547327, now seen corresponding path program 5 times [2018-02-04 03:22:22,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:22,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 03:22:22,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:22,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:22:22,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-04 03:22:22,867 INFO L182 omatonBuilderFactory]: Interpolants [10656#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 10657#(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))))), 10658#(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)), 10659#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~0) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 10660#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))), 10661#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (= 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))), 10662#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10663#(and (<= entry_point_~i~0 4) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10664#(and (<= entry_point_~j~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10665#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10666#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10667#(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)))))), 10668#(= |entry_point_#t~mem7.offset| 0), 10648#true, 10649#false, 10650#(= 0 |ldv_malloc_#t~malloc1.offset|), 10651#(= 0 |ldv_malloc_#res.offset|), 10652#(= 0 |entry_point_#t~ret2.offset|), 10653#(= entry_point_~array~0.offset 0), 10654#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10655#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|))] [2018-02-04 03:22:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 03:22:22,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:22:22,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:22:22,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:22:22,868 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 21 states. [2018-02-04 03:22:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:23,243 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-02-04 03:22:23,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:22:23,243 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-02-04 03:22:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:23,244 INFO L225 Difference]: With dead ends: 136 [2018-02-04 03:22:23,244 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 03:22:23,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:22:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 03:22:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-02-04 03:22:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:22:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-02-04 03:22:23,246 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 100 [2018-02-04 03:22:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:23,246 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-02-04 03:22:23,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:22:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-02-04 03:22:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:22:23,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:23,248 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:23,248 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:23,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1182547326, now seen corresponding path program 5 times [2018-02-04 03:22:23,248 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:23,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 35 proven. 116 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 03:22:24,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:24,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 03:22:24,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 03:22:24,870 INFO L182 omatonBuilderFactory]: Interpolants [10953#true, 10954#false, 10955#(= 0 |ldv_malloc_#t~malloc1.offset|), 10956#(= 0 |ldv_malloc_#res.offset|), 10957#(= 0 |entry_point_#t~ret2.offset|), 10958#(= entry_point_~array~0.offset 0), 10959#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10960#(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))))), 10961#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 10962#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 10963#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10964#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10965#(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)), 10966#(and (<= (* 4 entry_point_~i~0) 4) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 10967#(= |#valid| |old(#valid)|), 10968#(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)), 10969#(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|))))), 10970#(and (<= (* 4 entry_point_~i~0) 4) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~ret4.base|))), 10971#(and (<= (* 4 entry_point_~i~0) 4) (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))) (= 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)), 10972#(and (= entry_point_~array~0.offset 0) (or (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))) (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)))) (<= (* 4 entry_point_~i~0) 3))), 10973#(and (or (and (not (= 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) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 10974#(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|))))), 10975#(and (= entry_point_~array~0.offset 0) (or (and (not (= 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|)) (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))) (not (= 0 |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 10976#(and (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 (= (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 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)))))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 10977#(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) entry_point_~array~0.offset)))) (= 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_~i~0) entry_point_~array~0.offset)))) (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)))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 10978#(and (<= (* 4 entry_point_~i~0) 12) (= 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 (- 1))))))) (not (= 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) (+ entry_point_~array~0.offset (* 4 (+ 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) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 11))), 10979#(and (or (and (<= entry_point_~i~0 3) (not (= 0 (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) (+ (* 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) (+ entry_point_~array~0.offset (* 4 (+ 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) |entry_point_#t~ret4.base|)) (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))) (not (= 0 |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 11)) (= entry_point_~array~0.offset 0)), 10980#(and (= entry_point_~array~0.offset 0) (or (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) (- 8))))) (= 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)) (<= entry_point_~i~0 3) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (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))) (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 entry_point_~p~0.base)) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))) (<= (* 4 entry_point_~i~0) 11))), 10981#(and (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) entry_point_~array~0.offset)))) (not (= 0 (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) (+ (* 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (= 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_~i~0) 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)))) (<= (* 4 entry_point_~i~0) 11)) (= entry_point_~array~0.offset 0)), 10982#(and (or (and (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 (- 2))))))) (<= entry_point_~i~0 4) (not (= 0 (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))))))) (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 (- 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) (+ (* 4 entry_point_~i~0) (- 12))) (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_~i~0 (- 2)))))))) (<= (* 4 entry_point_~i~0) 15)) (= entry_point_~array~0.offset 0)), 10983#(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))))) (<= entry_point_~j~0 3) (not (= 0 (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) 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (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) 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) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (<= (* 4 entry_point_~j~0) 11)) (= entry_point_~array~0.offset 0)), 10984#(and (<= (* 4 entry_point_~j~0) 12) (or (<= (* 4 entry_point_~j~0) 11) (and (or (= 0 (select |#valid| |entry_point_#t~mem7.base|)) (and (not (= 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (and (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 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_~j~0) (- 8))) (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_~j~0 (- 1))))))))))) (not (= 0 |entry_point_#t~mem7.base|)))) (= entry_point_~array~0.offset 0)), 10985#(and (or (<= (* 4 entry_point_~j~0) 11) (and (<= entry_point_~j~0 3) (not (= 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (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) 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) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))))) (= entry_point_~array~0.offset 0)), 10986#(and (or (and (<= entry_point_~j~0 2) (not (= 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) (+ (* 4 entry_point_~j~0) (- 4))) (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_~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)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 10987#(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 (= (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))) (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)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 10988#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (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))) (= 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)))))) (<= (* 4 entry_point_~j~0) 7))), 10989#(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) (= 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) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 10990#(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)), 10991#(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)), 10992#(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)))))), 10993#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:22:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 35 proven. 116 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 03:22:24,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 03:22:24,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 03:22:24,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:22:24,871 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 41 states. [2018-02-04 03:22:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:26,102 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-02-04 03:22:26,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:22:26,103 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 100 [2018-02-04 03:22:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:26,103 INFO L225 Difference]: With dead ends: 132 [2018-02-04 03:22:26,103 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 03:22:26,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=484, Invalid=2822, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:22:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 03:22:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2018-02-04 03:22:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:22:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2018-02-04 03:22:26,106 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 100 [2018-02-04 03:22:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:26,107 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2018-02-04 03:22:26,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 03:22:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2018-02-04 03:22:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 03:22:26,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:26,108 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:26,108 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 99123107, now seen corresponding path program 2 times [2018-02-04 03:22:26,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:26,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-04 03:22:26,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:26,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:22:26,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:26,203 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-04 03:22:26,204 INFO L182 omatonBuilderFactory]: Interpolants [11286#true, 11287#false, 11288#(<= 10 entry_point_~len~0), 11289#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 11290#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 11291#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 11292#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 11293#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 11294#(<= (+ entry_point_~i~0 5) entry_point_~len~0)] [2018-02-04 03:22:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-04 03:22:26,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:22:26,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:22:26,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:22:26,204 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand 9 states. [2018-02-04 03:22:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:26,270 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2018-02-04 03:22:26,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:22:26,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-02-04 03:22:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:26,272 INFO L225 Difference]: With dead ends: 181 [2018-02-04 03:22:26,272 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 03:22:26,272 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-04 03:22:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 03:22:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 132. [2018-02-04 03:22:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 03:22:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2018-02-04 03:22:26,275 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 105 [2018-02-04 03:22:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:26,275 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2018-02-04 03:22:26,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:22:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2018-02-04 03:22:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 03:22:26,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:26,276 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:26,276 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:26,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1434887967, now seen corresponding path program 5 times [2018-02-04 03:22:26,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:26,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 124 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:22:26,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:26,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:22:26,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-02-04 03:22:26,736 INFO L182 omatonBuilderFactory]: Interpolants [11618#true, 11619#false, 11620#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 11621#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11622#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 11623#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 11624#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 11625#(= |#valid| |old(#valid)|), 11626#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 11627#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 11628#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 11629#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 11630#(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)))))), 11631#(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)))), 11632#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~0) (= 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)))), 11633#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 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)))), 11634#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (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)))), 11635#(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)))), 11636#(and (<= entry_point_~i~0 4) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11637#(and (<= entry_point_~j~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)))), 11638#(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)))), 11639#(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)))), 11640#(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)), 11641#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 11642#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:22:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 124 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:22:26,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:22:26,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:22:26,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:22:26,736 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand 25 states. [2018-02-04 03:22:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:27,368 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2018-02-04 03:22:27,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:22:27,368 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2018-02-04 03:22:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:27,369 INFO L225 Difference]: With dead ends: 144 [2018-02-04 03:22:27,369 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 03:22:27,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:22:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 03:22:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 133. [2018-02-04 03:22:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 03:22:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2018-02-04 03:22:27,371 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 105 [2018-02-04 03:22:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:27,372 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2018-02-04 03:22:27,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:22:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-02-04 03:22:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 03:22:27,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:27,373 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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-04 03:22:27,373 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:27,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1434887917, now seen corresponding path program 5 times [2018-02-04 03:22:27,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:27,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 48 proven. 62 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:22:27,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:27,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:22:27,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:27,433 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-04 03:22:27,433 INFO L182 omatonBuilderFactory]: Interpolants [11952#true, 11953#false, 11954#(= entry_point_~i~0 0), 11955#(<= entry_point_~i~0 1), 11956#(<= entry_point_~i~0 2), 11957#(<= entry_point_~i~0 3), 11958#(<= entry_point_~i~0 4), 11959#(<= entry_point_~j~0 3), 11960#(<= entry_point_~j~0 2), 11961#(<= entry_point_~j~0 1), 11962#(<= entry_point_~j~0 0), 11963#(<= (+ entry_point_~j~0 1) 0)] [2018-02-04 03:22:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 48 proven. 62 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:22:27,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:22:27,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:22:27,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:22:27,433 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 12 states. [2018-02-04 03:22:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:27,497 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-02-04 03:22:27,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:22:27,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-02-04 03:22:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:27,498 INFO L225 Difference]: With dead ends: 134 [2018-02-04 03:22:27,498 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 03:22:27,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:22:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 03:22:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-02-04 03:22:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 03:22:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-02-04 03:22:27,501 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 105 [2018-02-04 03:22:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:27,501 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-02-04 03:22:27,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:22:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-02-04 03:22:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 03:22:27,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:27,502 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:27,503 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1062086081, now seen corresponding path program 5 times [2018-02-04 03:22:27,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:27,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:23,712 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 108 DAG size of output 45 [2018-02-04 03:23:23,881 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 111 DAG size of output 51 [2018-02-04 03:23:24,138 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 113 DAG size of output 51 [2018-02-04 03:23:24,413 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 118 DAG size of output 68 [2018-02-04 03:23:24,909 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 142 DAG size of output 67 [2018-02-04 03:23:25,294 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 138 DAG size of output 68 [2018-02-04 03:23:25,846 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 139 DAG size of output 67 [2018-02-04 03:23:26,187 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 139 DAG size of output 76 [2018-02-04 03:23:26,830 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 122 DAG size of output 87 [2018-02-04 03:23:27,054 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 117 DAG size of output 88 [2018-02-04 03:23:27,287 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 120 DAG size of output 88 [2018-02-04 03:23:27,531 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 127 DAG size of output 93 [2018-02-04 03:23:27,857 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 123 DAG size of output 91 [2018-02-04 03:23:28,097 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 133 DAG size of output 91 [2018-02-04 03:23:28,558 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 176 DAG size of output 87 [2018-02-04 03:23:28,953 WARN L146 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 165 DAG size of output 79 [2018-02-04 03:23:29,329 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 147 DAG size of output 74 [2018-02-04 03:23:29,789 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 167 DAG size of output 59 [2018-02-04 03:23:30,303 WARN L146 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 174 DAG size of output 60 [2018-02-04 03:23:30,694 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 130 DAG size of output 58 [2018-02-04 03:23:31,200 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 151 DAG size of output 42 [2018-02-04 03:23:31,823 WARN L146 SmtUtils]: Spent 304ms on a formula simplification. DAG size of input: 180 DAG size of output 44 [2018-02-04 03:23:32,641 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 120 DAG size of output 33 [2018-02-04 03:23:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 24 proven. 128 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 03:23:34,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:34,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 03:23:34,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 03:23:34,112 INFO L182 omatonBuilderFactory]: Interpolants [12240#true, 12241#false, 12242#(= 0 (select |#valid| 0)), 12243#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 12244#(= |#valid| |old(#valid)|), 12245#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 12246#(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)), 12247#(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)), 12248#(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))), 12249#(and (not (= entry_point_~array~0.base 0)) (= 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)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 12250#(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)|)))))), 12251#(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)|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 12252#(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|)), 12253#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= (select |old(#valid)| 0) (select |#valid| 0)) (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)|) (= entry_point_~i~0 0) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 12254#(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)) (= (select |old(#valid)| 0) (select |#valid| 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= 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))), 12255#(and (= (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)|) (= 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 |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= 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)))))), 12256#(and (<= (* 4 entry_point_~i~0) 4) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |old(#valid)| 0) (select |#valid| 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))))) (<= (* 4 entry_point_~i~0) 0)) (= entry_point_~array~0.offset 0)), 12257#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 12258#(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|))), 12259#(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_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 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 (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~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (<= entry_point_~i~0 1) (= 0 (select |old(#valid)| |entry_point_#t~ret4.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))) (<= (* 4 entry_point_~i~0) 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 12260#(and (or (<= (* 4 entry_point_~i~0) 0) (and (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| 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) (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))) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (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))) (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~0 1) (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))) (= 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))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 12261#(and (or (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))) (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) (+ 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))))) (= (select |old(#valid)| 0) (select |#valid| 0)) (<= entry_point_~i~0 1) (= (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 (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))) (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))))) (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 entry_point_~i~0) 3)) (= entry_point_~array~0.offset 0)), 12262#(and (= entry_point_~array~0.offset 0) (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))) (= 0 (select |old(#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 (= entry_point_~array~0.base (@diff (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)|)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (@diff (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)|)) (= (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)|) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (@diff (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)|))) (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 (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (@diff |#valid| |old(#valid)|)) (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (@diff |#valid| |old(#valid)|))) (= (store (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)|))) (@diff (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)|) (select |old(#valid)| (@diff (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)|))) |old(#valid)|) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 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)) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (@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)|)))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 12263#(and (or (and (or (and (= (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) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |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))))) |old(#valid)|) (= 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 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= 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))))) (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))) (and (= (select |old(#valid)| 0) (select |#valid| 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) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (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))) (not (= 0 |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 12264#(and (or (and (or (and (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) (+ (* 4 entry_point_~i~0) (- 4))))) (= 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)) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (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))) (= 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))) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| 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) (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))) 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))))) |old(#valid)|)) (and (= (select |old(#valid)| 0) (select |#valid| 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))) (= 1 (select |#valid| entry_point_~p~0.base)) (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 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) 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))))) (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)))))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 12265#(and (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~i~0) 7) (and (not (= 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_~i~0) (- 4))))) (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))))) (= 1 (select |#valid| (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)))) (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))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 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) 0) (select |old(#valid)| (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)) (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))))) |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)))) (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)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 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))) (and (= (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))) (= (select |old(#valid)| 0) (select |#valid| 0)))))) (<= (* 4 entry_point_~i~0) 8)), 12266#(and (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) (+ 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))))))) (or (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_~i~0 (- 1))))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (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 (= 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) 0) (select |old(#valid)| (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 (- 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))))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (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))) (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_~i~0 (- 1)))))) (= (select |old(#valid)| 0) (select |#valid| 0)))) (not (= 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) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))) (<= (* 4 entry_point_~i~0) 11)) (<= (* 4 entry_point_~i~0) 12) (= entry_point_~array~0.offset 0)), 12267#(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)), 12268#(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|))), 12269#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 3) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |old(#valid)| 0) (select |#valid| 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_~i~0 (- 1)))))) (and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (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 (= 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)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (= |old(#valid)| (store (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) 0) (select |old(#valid)| (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 (- 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))))) |entry_point_#t~ret4.base| (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) (- 8))))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) |entry_point_#t~ret4.base|) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= 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) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (= (select |old(#valid)| 0) (select |#valid| 0)) (= entry_point_~array~0.base |entry_point_#t~ret4.base|))) (not (= |entry_point_#t~ret4.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))))))) (not (= 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 11))), 12270#(and (= entry_point_~array~0.offset 0) (or (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) (- 8))))) (<= entry_point_~i~0 3) (or (and (or (= (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))) (and (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) (+ (* 4 entry_point_~i~0) (- 8))))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (or (and (= |old(#valid)| (store (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| 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) (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))) (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) entry_point_~array~0.offset (- 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) entry_point_~array~0.offset (- 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) (+ (* 4 entry_point_~i~0) (- 8))) (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) (- 8))))) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= 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))) (= 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) (- 8))))) (= 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))) (= (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 (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)) (not (= entry_point_~array~0.base 0)) (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))))) (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))) (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)))) (= entry_point_~array~0.base 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))) (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))))) (= (select |old(#valid)| 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 entry_point_~p~0.base))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 11))), 12271#(and (or (and (<= entry_point_~i~0 3) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |old(#valid)| 0) (select |#valid| 0)) (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))) (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_~i~0 (- 1)))))) (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 (= 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_~i~0 (- 1))))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 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)| entry_point_~array~0.base)) (= (store (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) 0) (select |old(#valid)| (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 (- 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) (+ (* 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)|)) (= (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 (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (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 (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))) (and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (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) entry_point_~array~0.offset)))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))) (<= (* 4 entry_point_~i~0) 11)) (= entry_point_~array~0.offset 0)), 12272#(and (or (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (<= entry_point_~i~0 4) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (= (select |old(#valid)| 0) (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))) (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))))))) (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_~i~0 (- 2)))))) (and (not (= 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)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (= (store (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) 0) (select |old(#valid)| (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 (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 8))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))) (select |old(#valid)| (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) (+ (* 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))))) |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 (- 2))))))) (= 0 (select |old(#valid)| 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))) (= (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 (= 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 (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (not (= 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) (- 12))) (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) (+ 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 (- 2)))))))) (<= (* 4 entry_point_~i~0) 15)) (= entry_point_~array~0.offset 0)), 12273#(and (<= (* 4 entry_point_~j~0) 12) (= entry_point_~array~0.offset 0) (or (and (or (and (= (select |old(#valid)| 0) (select |#valid| 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 (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (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) 0) (select |old(#valid)| (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) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select |old(#valid)| (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) (+ (* 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) (+ (* 4 entry_point_~j~0) (- 8))))) (= 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)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (= (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)))) (= (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))))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (= (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 |old(#valid)| 0) (select |#valid| 0)) (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) 0))))) (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) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (<= (* 4 entry_point_~j~0) 11))), 12274#(and (<= (* 4 entry_point_~j~0) 12) (or (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))) (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) (- 8))))) (not (= |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 (- 1))))))) (= (select |old(#valid)| 0) (select |#valid| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (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 (- 1)))))) (and (or (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_~j~0) (- 8))))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= (store (store (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))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (= (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)))) (= |entry_point_#t~mem7.base| (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 entry_point_~j~0) (- 8))))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))))) (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) 0))) (= |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))))) (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|))) (<= (* 4 entry_point_~j~0) 11)) (= entry_point_~array~0.offset 0)), 12275#(and (= entry_point_~array~0.offset 0) (or (and (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_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (or (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)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 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_~j~0) (- 8))))) (= 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) 0) (select |old(#valid)| (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) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))) (= 0 (select |old(#valid)| (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) (+ (* 4 entry_point_~j~0) (- 8)))) 0))) (= (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| entry_point_~array~0.base) 0)) (<= entry_point_~j~0 3) (not (= 0 (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (or (= (select |#valid| 0) 0) (= (select |#valid| 0) (select |old(#valid)| 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (<= (* 4 entry_point_~j~0) 11))), 12276#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (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| 0) 0) (= (select |#valid| 0) (select |old(#valid)| 0))) (or (= (select |#valid| entry_point_~array~0.base) 0) (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_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (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_~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) (+ (* 4 entry_point_~j~0) (- 4))))) (or (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)) (= (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) 0) (select |old(#valid)| (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) 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))))) |old(#valid)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= 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) (+ 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) (- 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)))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7))), 12277#(and (or (and (<= entry_point_~j~0 2) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~mem7.base| (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) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select |#valid| 0) 0) (= (select |#valid| 0) (select |old(#valid)| 0))) (not (= 0 |entry_point_#t~mem7.base|)) (or (and (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|)) (= |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) 0) (select |old(#valid)| (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))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (= 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))) (= (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)))) 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_~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) (- 4))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (= |entry_point_#t~mem7.base| (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)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 12278#(and (or (and (<= entry_point_~j~0 2) (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_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) 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_~j~0) (- 4))))) (= 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) 0) (select |old(#valid)| (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))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) |old(#valid)|))) (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) (- 4))))) (not (= 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))) (= (select |old(#valid)| 0) 1)) (not (= 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)), 12279#(and (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))))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (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_~j~0))))) (or (and (= |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))) (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))))) (= 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))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 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)))) (= (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 |old(#valid)| 0) 1)) (<= entry_point_~j~0 1))) (= entry_point_~array~0.offset 0)), 12280#(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 (= (select |#valid| |entry_point_#t~mem7.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|)) (= |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)) (= 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))) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (= (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 |old(#valid)| 0) 1)) (not (= 0 |entry_point_#t~mem7.base|))))), 12281#(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))) (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)) (= |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))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0))) (= (select |old(#valid)| 0) 1))))), 12282#(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_~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) (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_~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))))) (= (select |old(#valid)| 0) 1) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 12283#(and (or (and (not (= 0 |entry_point_#t~mem7.base|)) (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|)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (= 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 |old(#valid)| 0) 1)) (= entry_point_~array~0.offset 0)), 12284#(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)|)))) (= (select |old(#valid)| 0) 1))), 12285#(or (= (select |old(#valid)| 0) 1) (= (select |old(#valid)| (@diff |#valid| |old(#valid)|)) (select |#valid| (@diff |#valid| |old(#valid)|))))] [2018-02-04 03:23:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 24 proven. 128 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 03:23:34,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 03:23:34,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 03:23:34,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1831, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:23:34,113 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 46 states. [2018-02-04 03:23:35,625 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 104 DAG size of output 93 [2018-02-04 03:23:36,238 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 139 DAG size of output 130 [2018-02-04 03:23:36,561 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 150 [2018-02-04 03:23:36,974 WARN L146 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 175 DAG size of output 162 [2018-02-04 03:23:37,285 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 135 DAG size of output 117 [2018-02-04 03:23:37,515 WARN L146 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 110 DAG size of output 105 [2018-02-04 03:23:37,897 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 103 DAG size of output 98 [2018-02-04 03:23:38,159 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 114 DAG size of output 108 [2018-02-04 03:23:38,323 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 90 DAG size of output 86 [2018-02-04 03:23:38,608 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 83 DAG size of output 83 [2018-02-04 03:23:39,096 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 100 DAG size of output 87 [2018-02-04 03:23:39,363 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 108 DAG size of output 94 [2018-02-04 03:23:39,577 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 117 DAG size of output 72 [2018-02-04 03:23:39,920 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 109 DAG size of output 68 [2018-02-04 03:23:40,152 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 114 DAG size of output 68 [2018-02-04 03:23:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:40,427 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-02-04 03:23:40,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 03:23:40,427 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 108 [2018-02-04 03:23:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:40,428 INFO L225 Difference]: With dead ends: 135 [2018-02-04 03:23:40,428 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 03:23:40,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=861, Invalid=6449, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 03:23:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 03:23:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-02-04 03:23:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 03:23:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-02-04 03:23:40,431 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 108 [2018-02-04 03:23:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:40,431 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-02-04 03:23:40,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 03:23:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-02-04 03:23:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 03:23:40,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:40,432 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:40,432 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:40,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1464364975, now seen corresponding path program 7 times [2018-02-04 03:23:40,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:40,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 68 proven. 82 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 03:23:40,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:40,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:23:40,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 03:23:40,682 INFO L182 omatonBuilderFactory]: Interpolants [12608#(= (select |old(#valid)| |ldv_malloc_#res.base|) 0), 12609#(not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)), 12610#(not (= entry_point_~array~0.base entry_point_~p~0.base)), 12611#(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)))), 12612#(not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))), 12613#(not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))), 12614#(not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 3))) entry_point_~array~0.offset)))), 12615#(not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 2))) entry_point_~array~0.offset)))), 12616#(not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))), 12617#(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)))), 12618#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 12603#true, 12604#false, 12605#(= 1 (select |#valid| entry_point_~array~0.base)), 12606#(= |#valid| |old(#valid)|), 12607#(= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)] [2018-02-04 03:23:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 68 proven. 82 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 03:23:40,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:23:40,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:23:40,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:23:40,682 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 16 states. [2018-02-04 03:23:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:41,290 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-02-04 03:23:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:23:41,291 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2018-02-04 03:23:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:41,291 INFO L225 Difference]: With dead ends: 138 [2018-02-04 03:23:41,291 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 03:23:41,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=1657, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:23:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 03:23:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2018-02-04 03:23:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 03:23:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-02-04 03:23:41,293 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 112 [2018-02-04 03:23:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:41,293 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-02-04 03:23:41,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:23:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-02-04 03:23:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 03:23:41,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:41,294 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:41,294 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:41,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1849326060, now seen corresponding path program 6 times [2018-02-04 03:23:41,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:41,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 17 proven. 147 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-02-04 03:23:41,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:41,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:23:41,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-02-04 03:23:41,863 INFO L182 omatonBuilderFactory]: Interpolants [12928#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 12929#(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))))), 12930#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 12931#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 12932#(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))))), 12933#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 12934#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 12935#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12)))) (= entry_point_~array~0.offset 0)), 12936#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 16))))), 12937#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12)))) (= entry_point_~array~0.offset 0)), 12938#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))) (= entry_point_~array~0.offset 0)), 12939#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 12940#(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))))), 12941#(= |entry_point_#t~mem7.offset| 0), 12922#true, 12923#false, 12924#(= 0 |ldv_malloc_#t~malloc1.offset|), 12925#(= 0 |ldv_malloc_#res.offset|), 12926#(= 0 |entry_point_#t~ret2.offset|), 12927#(= entry_point_~array~0.offset 0)] [2018-02-04 03:23:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 17 proven. 147 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-02-04 03:23:41,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:23:41,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:23:41,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:23:41,864 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 20 states. [2018-02-04 03:23:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:42,505 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-02-04 03:23:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:23:42,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-02-04 03:23:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:42,505 INFO L225 Difference]: With dead ends: 106 [2018-02-04 03:23:42,506 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 03:23:42,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1798, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:23:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 03:23:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-02-04 03:23:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 03:23:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-02-04 03:23:42,507 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 113 [2018-02-04 03:23:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:42,507 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-02-04 03:23:42,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:23:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-02-04 03:23:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 03:23:42,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:42,508 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:42,508 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1849326061, now seen corresponding path program 6 times [2018-02-04 03:23:42,508 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:42,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 46 proven. 164 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 03:23:44,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:44,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 03:23:44,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 38 proven. 35 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 03:23:44,300 INFO L182 omatonBuilderFactory]: Interpolants [13205#true, 13206#false, 13207#(= 0 (select |#valid| 0)), 13208#(= (select |old(#valid)| 0) (select |#valid| 0)), 13209#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 13210#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 13211#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |#valid| 0))), 13212#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 13213#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 13214#(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)))), 13215#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 13216#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 13217#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 13218#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 13219#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 13220#(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)), 13221#(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)))))), 13222#(= |#valid| |old(#valid)|), 13223#(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)), 13224#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |old(#valid)| 0) (select |#valid| 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|))))), 13225#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) |entry_point_#t~ret4.base|)) (= 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|))), 13226#(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 (= (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))) entry_point_~p~0.base))), 13227#(and (= 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))))) (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) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 13228#(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 (- 1))) entry_point_~array~0.offset)))) (= 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 (- 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)))))), 13229#(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 (- 1))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) |entry_point_#t~ret4.base|)) (= 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))))) (not (= 0 |entry_point_#t~ret4.base|))), 13230#(and (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)) (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))) (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 (= 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)))) (= 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)), 13231#(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) (- 8))) (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.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)))))), 13232#(and (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))))) (= entry_point_~array~0.offset 0) (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) (+ (* 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 (- 1))) entry_point_~array~0.offset)))) (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) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset))))), 13233#(and (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 (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))) |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (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) (+ (* 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 (- 1))) entry_point_~array~0.offset)))) (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) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (not (= 0 |entry_point_#t~ret4.base|))), 13234#(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) (- 12))))) (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) (- 12))) entry_point_~p~0.base)) (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) (- 12))) (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) (- 12))) (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 (- 2))) entry_point_~array~0.offset)))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 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) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset))))), 13235#(and (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))))) (= 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 (= (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) (+ (* 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 (- 1))) entry_point_~array~0.offset)))) (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) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (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) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 13236#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 3))) entry_point_~array~0.offset)))) (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) (- 16))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 16))) (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))))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 16))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 16))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 3))) entry_point_~array~0.offset))))), 13237#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 2))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))) (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) (- 12))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 2))) entry_point_~array~0.offset))))), 13238#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 2))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 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) (- 12))))) (= entry_point_~array~0.offset 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 (- 2))) entry_point_~array~0.offset))))), 13239#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 2))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))) (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) (- 12))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 2))) entry_point_~array~0.offset))))), 13240#(and (not (= 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) (+ (* 4 entry_point_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (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) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 13241#(and (or (and (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) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 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 (= 1 (select |#valid| |entry_point_#t~mem7.base|)))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 13242#(and (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) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (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)), 13243#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (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) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 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)))))), 13244#(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)))))), 13245#(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)))))), 13246#(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)), 13247#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:23:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 46 proven. 164 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 03:23:44,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 03:23:44,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 03:23:44,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:23:44,301 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 43 states. [2018-02-04 03:23:46,687 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 137 DAG size of output 111 [2018-02-04 03:23:47,545 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 144 DAG size of output 118 [2018-02-04 03:23:47,739 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 159 DAG size of output 123 [2018-02-04 03:23:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:47,753 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2018-02-04 03:23:47,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 03:23:47,753 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-02-04 03:23:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:47,754 INFO L225 Difference]: With dead ends: 109 [2018-02-04 03:23:47,754 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 03:23:47,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=903, Invalid=6929, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 03:23:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 03:23:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2018-02-04 03:23:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 03:23:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-02-04 03:23:47,756 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 113 [2018-02-04 03:23:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:47,756 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-02-04 03:23:47,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 03:23:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-02-04 03:23:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:23:47,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:47,757 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:47,757 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1962118230, now seen corresponding path program 6 times [2018-02-04 03:23:47,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:47,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 95 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-02-04 03:23:47,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:47,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:23:47,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-02-04 03:23:47,890 INFO L182 omatonBuilderFactory]: Interpolants [13568#(<= 1 entry_point_~j~0), 13569#(<= 0 entry_point_~j~0), 13552#true, 13553#false, 13554#(= 0 |ldv_malloc_#t~malloc1.offset|), 13555#(= 0 |ldv_malloc_#res.offset|), 13556#(= 0 |entry_point_#t~ret2.offset|), 13557#(= entry_point_~array~0.offset 0), 13558#(and (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 13559#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 13560#(and (<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 13561#(and (<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 13562#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 13563#(and (= entry_point_~array~0.offset 0) (<= 20 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 13564#(and (<= 16 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 13565#(and (<= 12 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 13566#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 13567#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))] [2018-02-04 03:23:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 95 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-02-04 03:23:47,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:23:47,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:23:47,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:23:47,891 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 18 states. [2018-02-04 03:23:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:47,998 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-04 03:23:47,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:23:47,998 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2018-02-04 03:23:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:47,999 INFO L225 Difference]: With dead ends: 107 [2018-02-04 03:23:47,999 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 03:23:47,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:23:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 03:23:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 03:23:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 03:23:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2018-02-04 03:23:48,000 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 118 [2018-02-04 03:23:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:48,000 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2018-02-04 03:23:48,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:23:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2018-02-04 03:23:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:23:48,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:48,001 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:48,001 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:48,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1962118279, now seen corresponding path program 8 times [2018-02-04 03:23:48,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:48,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 9 proven. 191 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:23:48,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:48,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:23:48,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 03:23:48,670 INFO L182 omatonBuilderFactory]: Interpolants [13824#(= (select |#valid| entry_point_~array~0.base) 1), 13796#true, 13797#false, 13798#(= 0 |ldv_malloc_#t~malloc1.offset|), 13799#(= 0 |ldv_malloc_#res.offset|), 13800#(= 0 |entry_point_#t~ret2.offset|), 13801#(= entry_point_~array~0.offset 0), 13802#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 13803#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 13804#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 13805#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 13806#(= |#valid| |old(#valid)|), 13807#(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))))), 13808#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 13809#(or (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|)), 13810#(and (or (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 0)) (= entry_point_~array~0.offset 0)), 13811#(and (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base entry_point_~p~0.base)) (<= entry_point_~i~0 0))), 13812#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~i~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_~i~0))))))), 13813#(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)), 13814#(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)), 13815#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~i~0 3) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))))), 13816#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~i~0 4) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 16))))))), 13817#(and (= 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) (- 12))))) (<= entry_point_~j~0 3))), 13818#(and (or (<= entry_point_~j~0 2) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))) (= entry_point_~array~0.offset 0)), 13819#(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)), 13820#(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)), 13821#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= entry_point_~j~0 0) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))), 13822#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 13823#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-04 03:23:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 9 proven. 191 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:23:48,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:23:48,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:23:48,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:23:48,671 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 29 states. [2018-02-04 03:23:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:49,722 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2018-02-04 03:23:49,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:23:49,722 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-02-04 03:23:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:49,722 INFO L225 Difference]: With dead ends: 109 [2018-02-04 03:23:49,722 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 03:23:49,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=551, Invalid=2641, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 03:23:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 03:23:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-02-04 03:23:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:23:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-02-04 03:23:49,724 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 118 [2018-02-04 03:23:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:49,724 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-02-04 03:23:49,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:23:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-02-04 03:23:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:23:49,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:49,725 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:49,725 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1962118280, now seen corresponding path program 6 times [2018-02-04 03:23:49,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:49,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 95 proven. 48 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-02-04 03:23:49,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:49,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:23:49,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-04 03:23:49,802 INFO L182 omatonBuilderFactory]: Interpolants [14098#true, 14099#false, 14100#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14101#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14102#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14103#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14104#(<= 16 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14105#(<= 20 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14106#(<= 16 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 14107#(<= 12 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 14108#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 14109#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 14110#(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))), 14111#(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)))] [2018-02-04 03:23:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 95 proven. 48 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-02-04 03:23:49,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:23:49,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:23:49,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:23:49,802 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 14 states. [2018-02-04 03:23:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:49,930 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-02-04 03:23:49,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:23:49,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 118 [2018-02-04 03:23:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:49,931 INFO L225 Difference]: With dead ends: 113 [2018-02-04 03:23:49,931 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 03:23:49,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:23:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 03:23:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-02-04 03:23:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:23:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-02-04 03:23:49,933 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 118 [2018-02-04 03:23:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:49,934 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-02-04 03:23:49,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:23:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-02-04 03:23:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 03:23:49,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:49,934 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:49,935 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash 696124534, now seen corresponding path program 7 times [2018-02-04 03:23:49,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:49,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 36 proven. 139 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 03:23:50,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:50,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:23:50,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-02-04 03:23:50,354 INFO L182 omatonBuilderFactory]: Interpolants [14345#true, 14346#false, 14347#(= 0 |ldv_malloc_#t~malloc1.offset|), 14348#(= 0 |ldv_malloc_#res.offset|), 14349#(= 0 |entry_point_#t~ret2.offset|), 14350#(= entry_point_~array~0.offset 0), 14351#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 14352#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 14353#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 14354#(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))))), 14355#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 14356#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~0) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 14357#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~0)), 14358#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 4) (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))), 14359#(and (<= entry_point_~i~0 4) (= entry_point_~array~0.offset 0) (= 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))), 14360#(and (<= entry_point_~i~0 4) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 14361#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 5)), 14362#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~j~0 4)), 14363#(and (<= entry_point_~j~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 14364#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 14365#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 14366#(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))))), 14367#(= |entry_point_#t~mem7.offset| 0)] [2018-02-04 03:23:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 36 proven. 139 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-02-04 03:23:50,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:23:50,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:23:50,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:23:50,354 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 23 states. [2018-02-04 03:23:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:50,663 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-02-04 03:23:50,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:23:50,663 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2018-02-04 03:23:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:50,663 INFO L225 Difference]: With dead ends: 155 [2018-02-04 03:23:50,664 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 03:23:50,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:23:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 03:23:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2018-02-04 03:23:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 03:23:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2018-02-04 03:23:50,665 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 119 [2018-02-04 03:23:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:50,665 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2018-02-04 03:23:50,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:23:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2018-02-04 03:23:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 03:23:50,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:50,666 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:50,666 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 696124535, now seen corresponding path program 7 times [2018-02-04 03:23:50,667 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:50,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 70 proven. 159 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:23:53,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:53,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 03:23:53,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 34 proven. 36 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:23:53,758 INFO L182 omatonBuilderFactory]: Interpolants [14720#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 14721#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (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|))))), 14722#(and (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))) (not (= (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 (- 1))) entry_point_~array~0.offset)))) (= (select |#valid| |entry_point_#t~ret4.base|) 1) (not (= 0 |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 11)) (= entry_point_~array~0.offset 0)), 14723#(and (or (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) (- 8))))) (= 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)) (<= entry_point_~i~0 3) (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) 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) (- 8))))) (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 (- 1))) entry_point_~array~0.offset)))) (= (select |#valid| entry_point_~p~0.base) 1) (not (= 0 entry_point_~p~0.base))) (<= (* 4 entry_point_~i~0) 11)) (= entry_point_~array~0.offset 0)), 14724#(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) 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 (- 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))) (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)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) 1)) (<= (* 4 entry_point_~i~0) 11))), 14725#(and (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~i~0) 15) (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) (- 12))))) (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 (- 2))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (<= entry_point_~i~0 4) (not (= 0 (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))))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))) 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_~i~0 (- 1))))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 14726#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 15) (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) (- 12))))) (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 (- 2))) entry_point_~array~0.offset)))) (<= entry_point_~i~0 4) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (not (= 0 (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))))))) (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 (- 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) |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))))), 14727#(and (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)) (<= entry_point_~i~0 4) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (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) (- 12))))) (not (= 0 entry_point_~p~0.base)) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (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 (- 2))) 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) 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 (- 2))) entry_point_~array~0.offset)))) (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) (- 12)))))) (<= (* 4 entry_point_~i~0) 15)) (= entry_point_~array~0.offset 0)), 14728#(and (or (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) (- 12))))) (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 (- 2))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (<= entry_point_~i~0 4) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (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 (= 0 (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) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (= 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_~i~0) entry_point_~array~0.offset))))) (<= (* 4 entry_point_~i~0) 15)) (= entry_point_~array~0.offset 0)), 14729#(and (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 19) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 3))) 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (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) (- 16))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= entry_point_~i~0 5) (not (= 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) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 16))))) (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 (- 3))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))))) (= entry_point_~array~0.offset 0)), 14730#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~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_~j~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (<= entry_point_~j~0 4) (= 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 (- 2))) 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_~j~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_~j~0 (- 2))) 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (<= (* 4 entry_point_~j~0) 15)) (= entry_point_~array~0.offset 0)), 14731#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))))) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (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_~j~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (<= entry_point_~j~0 4) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 2))) entry_point_~array~0.offset)))) (not (= 0 |entry_point_#t~mem7.base|)) (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 (- 2))) 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 15))), 14732#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12))))) (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) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (<= entry_point_~j~0 4) (= 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 (- 2))) 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_~j~0 (- 2))) 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 15))), 14733#(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))))) (<= entry_point_~j~0 3) (not (= 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 (= (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) (- 8))))) (= 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_~j~0 (- 1))) entry_point_~array~0.offset)))) (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)))) (<= (* 4 entry_point_~j~0) 11)) (= entry_point_~array~0.offset 0)), 14734#(and (or (and (not (= 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)))) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (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_~j~0) (- 8))))) (not (= 0 |entry_point_#t~mem7.base|)) (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 (- 1))) entry_point_~array~0.offset))))) (<= (* 4 entry_point_~j~0) 11)) (<= (* 4 entry_point_~j~0) 12) (= entry_point_~array~0.offset 0)), 14735#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 11) (and (<= entry_point_~j~0 3) (not (= 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 (= (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) (- 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_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 14736#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 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_~j~0) entry_point_~array~0.offset)))) (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))), 14737#(and (= entry_point_~array~0.offset 0) (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 |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) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7))), 14738#(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)), 14739#(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)))))), 14740#(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)), 14741#(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)), 14742#(and (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)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 14743#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 14694#true, 14695#false, 14696#(= 0 |ldv_malloc_#t~malloc1.offset|), 14697#(= 0 |ldv_malloc_#res.offset|), 14698#(= 0 |entry_point_#t~ret2.offset|), 14699#(= entry_point_~array~0.offset 0), 14700#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 14701#(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))))), 14702#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 14703#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 14704#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| |entry_point_#t~ret4.base|) 1)), 14705#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 14706#(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)), 14707#(and (<= (* 4 entry_point_~i~0) 4) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 14708#(= |#valid| |old(#valid)|), 14709#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 14710#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |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|))))), 14711#(and (<= (* 4 entry_point_~i~0) 4) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (= 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|))), 14712#(and (<= (* 4 entry_point_~i~0) 4) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (= 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 (= 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))), 14713#(and (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) 3)) (= entry_point_~array~0.offset 0)), 14714#(and (= entry_point_~array~0.offset 0) (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)))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 14715#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 14716#(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|)) (not (= 0 |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 14717#(and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (or (<= (* 4 entry_point_~i~0) 7) (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 entry_point_~p~0.base)) (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))))) (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)))))))), 14718#(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) 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))) (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)) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0)), 14719#(and (or (<= (* 4 entry_point_~i~0) 11) (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))) (not (= 0 (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.offset 0))] [2018-02-04 03:23:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 70 proven. 159 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:23:53,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 03:23:53,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 03:23:53,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=2072, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 03:23:53,759 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 50 states. [2018-02-04 03:23:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:55,577 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-02-04 03:23:55,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 03:23:55,577 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 119 [2018-02-04 03:23:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:55,578 INFO L225 Difference]: With dead ends: 151 [2018-02-04 03:23:55,578 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 03:23:55,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=732, Invalid=4098, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 03:23:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 03:23:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2018-02-04 03:23:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 03:23:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-02-04 03:23:55,581 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 119 [2018-02-04 03:23:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:55,582 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-02-04 03:23:55,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 03:23:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-02-04 03:23:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 03:23:55,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:55,583 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:55,583 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:55,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1278015476, now seen corresponding path program 7 times [2018-02-04 03:23:55,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:55,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 39 proven. 174 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-04 03:23:56,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:56,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:23:56,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-04 03:23:56,161 INFO L182 omatonBuilderFactory]: Interpolants [15104#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= 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))))), 15105#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 15106#(= 1 (select |#valid| entry_point_~array~0.base)), 15080#true, 15081#false, 15082#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 15083#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 15084#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 15085#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 15086#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 15087#(= |#valid| |old(#valid)|), 15088#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 15089#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 15090#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 15091#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 15092#(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)))))), 15093#(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) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 15094#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~0) (= 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)))), 15095#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 15096#(and (<= entry_point_~i~0 4) (= entry_point_~array~0.offset 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)))), 15097#(and (<= entry_point_~i~0 4) (= entry_point_~array~0.offset 0) (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)))), 15098#(and (<= entry_point_~i~0 4) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 15099#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 5) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 15100#(and (= entry_point_~array~0.offset 0) (<= entry_point_~j~0 4) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 15101#(and (<= entry_point_~j~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)))), 15102#(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)))), 15103#(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))))] [2018-02-04 03:23:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 39 proven. 174 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-04 03:23:56,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:23:56,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:23:56,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:23:56,161 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 27 states. [2018-02-04 03:23:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:56,861 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2018-02-04 03:23:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:23:56,861 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 124 [2018-02-04 03:23:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:56,861 INFO L225 Difference]: With dead ends: 163 [2018-02-04 03:23:56,861 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 03:23:56,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1789, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:23:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 03:23:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2018-02-04 03:23:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 03:23:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-02-04 03:23:56,864 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 124 [2018-02-04 03:23:56,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:56,864 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-02-04 03:23:56,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:23:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-02-04 03:23:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 03:23:56,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:56,865 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 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-04 03:23:56,865 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1278015426, now seen corresponding path program 7 times [2018-02-04 03:23:56,866 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:56,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 75 proven. 95 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-02-04 03:23:56,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:56,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:23:56,971 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-02-04 03:23:56,971 INFO L182 omatonBuilderFactory]: Interpolants [15456#(= entry_point_~i~0 0), 15457#(<= entry_point_~i~0 1), 15458#(<= entry_point_~i~0 2), 15459#(<= entry_point_~i~0 3), 15460#(<= entry_point_~i~0 4), 15461#(<= entry_point_~i~0 5), 15462#(<= entry_point_~j~0 4), 15463#(<= entry_point_~j~0 3), 15464#(<= entry_point_~j~0 2), 15465#(<= entry_point_~j~0 1), 15466#(<= entry_point_~j~0 0), 15467#(<= (+ entry_point_~j~0 1) 0), 15454#true, 15455#false] [2018-02-04 03:23:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 75 proven. 95 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-02-04 03:23:56,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:23:56,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:23:56,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:23:56,972 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 14 states. [2018-02-04 03:23:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:57,100 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-02-04 03:23:57,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:23:57,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-02-04 03:23:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:57,102 INFO L225 Difference]: With dead ends: 151 [2018-02-04 03:23:57,102 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 03:23:57,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:23:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 03:23:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2018-02-04 03:23:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 03:23:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-02-04 03:23:57,105 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 124 [2018-02-04 03:23:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:57,105 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-02-04 03:23:57,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:23:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-02-04 03:23:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 03:23:57,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:57,106 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:57,106 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:57,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1015905329, now seen corresponding path program 2 times [2018-02-04 03:23:57,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:57,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-02-04 03:23:57,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:57,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:23:57,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:57,180 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-04 03:23:57,180 INFO L182 omatonBuilderFactory]: Interpolants [15776#true, 15777#false, 15778#(<= 10 entry_point_~len~0), 15779#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 15780#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 15781#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 15782#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 15783#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 15784#(<= (+ entry_point_~i~0 5) entry_point_~len~0), 15785#(<= (+ entry_point_~i~0 4) entry_point_~len~0)] [2018-02-04 03:23:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-02-04 03:23:57,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:23:57,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:23:57,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:23:57,181 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 10 states. [2018-02-04 03:23:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:57,254 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2018-02-04 03:23:57,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:23:57,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2018-02-04 03:23:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:57,255 INFO L225 Difference]: With dead ends: 202 [2018-02-04 03:23:57,255 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 03:23:57,255 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-04 03:23:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 03:23:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 151. [2018-02-04 03:23:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 03:23:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-02-04 03:23:57,257 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 125 [2018-02-04 03:23:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:57,258 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-02-04 03:23:57,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:23:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-02-04 03:23:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 03:23:57,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:57,259 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:57,259 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:23:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1526047414, now seen corresponding path program 6 times [2018-02-04 03:23:57,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:57,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:00,260 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 126 DAG size of output 70 [2018-02-04 03:24:00,458 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 123 DAG size of output 71 [2018-02-04 03:24:00,696 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 124 DAG size of output 71 [2018-02-04 03:24:00,928 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 115 DAG size of output 77 [2018-02-04 03:24:01,304 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-02-04 03:24:01,494 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 101 DAG size of output 80 [2018-02-04 03:24:01,733 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 100 DAG size of output 79 [2018-02-04 03:24:02,216 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 114 DAG size of output 82 [2018-02-04 03:24:02,595 WARN L146 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 144 DAG size of output 74 [2018-02-04 03:24:02,921 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 125 DAG size of output 70 [2018-02-04 03:24:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 57 proven. 180 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-02-04 03:24:05,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:05,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 03:24:05,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-02-04 03:24:05,650 INFO L182 omatonBuilderFactory]: Interpolants [16151#true, 16152#false, 16153#(= |#valid| |old(#valid)|), 16154#(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|)), 16155#(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)), 16156#(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)), 16157#(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))), 16158#(and (or (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= entry_point_~array~0.base 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)))) (= entry_point_~array~0.offset 0)), 16159#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 16160#(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|))), 16161#(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|))), 16162#(and (or (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|)) (= 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)))) (= entry_point_~array~0.offset 0)), 16163#(and (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)|) (= 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)) (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)|))) (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)))) (= entry_point_~array~0.offset 0)), 16164#(and (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 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)) (= (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)))), 16165#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (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))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (not (= entry_point_~array~0.base 0)) (= 1 (select |#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) 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.offset 0)), 16166#(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))))), 16167#(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|)), 16168#(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|)))), 16169#(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_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base |entry_point_#t~ret4.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) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.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 (= 0 |entry_point_#t~ret4.base|)))) (= entry_point_~array~0.offset 0)), 16170#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| 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) (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))) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (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))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~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))))) (= entry_point_~array~0.offset 0)), 16171#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (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))) (not (= 0 (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_~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)) (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) 0) (select |old(#valid)| (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)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 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) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (= entry_point_~array~0.offset 0)), 16172#(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))) (= (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))) (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))) |old(#valid)|) (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))) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~0) (= entry_point_~array~0.offset 0)), 16173#(and (or (<= 9 (+ (* 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))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (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))) (= |old(#valid)| (store (store (store (store |#valid| |entry_point_#t~ret4.base| 0) 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))) (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)))) (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)))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 16174#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (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))) (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))) (= 1 (select |#valid| entry_point_~p~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~0) (not (= entry_point_~array~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))) (= (store (store (store (store |#valid| entry_point_~p~0.base 0) entry_point_~array~0.base (select |old(#valid)| 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) (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))) (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) (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))) |old(#valid)|) (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) 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) 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 (= 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))) (= 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)))) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 16175#(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))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 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) entry_point_~array~0.offset)))) (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)) (= (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) 0) 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))) (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))) |old(#valid)|)) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= 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))))), 16176#(and (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) (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 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 3) entry_point_~i~0) (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))) (= (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) 0) 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))) (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))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= 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)))) (<= 13 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 16177#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 16178#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (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) (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_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 3) entry_point_~i~0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base 0)) (= |old(#valid)| (store (store (store (store (store |#valid| |entry_point_#t~ret4.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) 0) 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))) (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)))) (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))) (<= 13 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (not (= 0 |entry_point_#t~ret4.base|))), 16179#(and (= 1 (select |#valid| 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 entry_point_~p~0.base)) (or (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))) (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))) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 3) entry_point_~i~0) (not (= entry_point_~array~0.base 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (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))) (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) 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) 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))) (= (store (store (store (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) entry_point_~array~0.offset (- 4))) 0) entry_point_~array~0.base (select |old(#valid)| 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) (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))) (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) (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))) |old(#valid)|) (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))) (= 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)))) (<= 13 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16180#(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 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 3) entry_point_~i~0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base 0)) (= (store (store (store (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) entry_point_~array~0.offset (- 4))) 0) 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))) (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))) |old(#valid)|) (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))) (= 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))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))) (<= 13 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 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))))), 16181#(and (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 15) (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))) (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 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (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))) (= 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))) (= (store (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 8))) 0) 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))) (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))) |old(#valid)|)) (<= 17 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (= 1 (select |#valid| (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 (- 1))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2)))))))), 16182#(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)), 16183#(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|))), 16184#(and (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 15) (<= 17 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))) |entry_point_#t~ret4.base|) (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))) (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 (store (store (store |#valid| |entry_point_#t~ret4.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 8))) 0) 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))) (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)))))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))))) (not (= |entry_point_#t~ret4.base| (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.offset 0) (not (= (+ (* 4 entry_point_~i~0) 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)))) (not (= 0 |entry_point_#t~ret4.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2)))))))), 16185#(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 (= 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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (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 (- 1))) entry_point_~array~0.offset)))) (or (= (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))) entry_point_~p~0.base) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 15) (<= 17 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (= (store (store (store (store (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) entry_point_~array~0.offset (- 4))) 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) entry_point_~array~0.offset (- 8))) 0) entry_point_~array~0.base (select |old(#valid)| 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) (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))) (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) (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))) |old(#valid)|) (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))) (= 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))) (not (= entry_point_~array~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))) (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) (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 (= 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) 4))) (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))) (= 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)))))), 16186#(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 (- 1))) entry_point_~array~0.offset)))) (= 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)))) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 15) (<= 17 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (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)) (= |old(#valid)| (store (store (store (store (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) entry_point_~array~0.offset (- 4))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 8))) 0) 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))) (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)))) (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))) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))) (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) (+ 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)))))))), 16187#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 3))))))) (or (and (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 3))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))) (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))) (= (store (store (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 8))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 12))) 0) 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))) (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))) |old(#valid)|) (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)))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 3)))))))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 19) (<= 21 (+ (* 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 (- 2))) entry_point_~array~0.offset)))) (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) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset))))), 16188#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 2))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (or (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 (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)) (= (store (store (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 8))) 0) 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))) (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))) |old(#valid)|)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 2))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 2)))))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 15) (<= 17 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (not (= (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 (- 1))) entry_point_~array~0.offset))))), 16189#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 2))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (or (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 (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)) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (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))) (= (store (store (store (store (store (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 8))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))) 0) 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))) (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))) |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) 0)))) (= |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 (- 2))))))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 2)))))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 15) (<= 17 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 16190#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 2))))))) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 15) (and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 2)))))) 0) (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))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base 0)) (= (store (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 8))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))) 0) 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))) (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))) |old(#valid)|) (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))) (= 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))))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 2)))))))) (<= 17 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 16191#(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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (= entry_point_~array~0.offset 0) (or (and (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))) 0) (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))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= (store (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) 0) 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))) (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))) |old(#valid)|) (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)))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 11) (<= 13 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 16192#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 11) (<= 13 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (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)) (= (store (store (store (store (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))) 0) 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))) (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))) |old(#valid)|) (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))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))) 0)) (not (= |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 (- 1))))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 16193#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 11) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))) 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 (= 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)) (= (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 4))) 0) 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))) (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))) |old(#valid)|) (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))) (<= 13 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (= entry_point_~array~0.offset 0)), 16194#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) 0) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (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))) (= (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) 0) 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))) (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))) |old(#valid)|) (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))) (= 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)))) (<= 9 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16195#(and (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|)) (or (= (select |#valid| |entry_point_#t~mem7.base|) 0) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (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))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base 0)) (= (store (store (store (store |#valid| |entry_point_#t~mem7.base| 0) 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))) (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))) |old(#valid)|) (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))) (<= 9 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 16196#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (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))) (= (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))) (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))) |old(#valid)|) (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))) (<= 9 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16197#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (= |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))) (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))))) (= 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 (= 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)))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16198#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (<= 5 (+ (* 4 entry_point_~j~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))) (= (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 (= |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)) (= (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)|)))), 16199#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (<= 5 (+ (* 4 entry_point_~j~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)) (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)))))) (= entry_point_~array~0.offset 0)), 16200#(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 (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 16201#(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))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (or (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16202#(and (or (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (< 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 (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 16203#(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)))), 16204#(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-04 03:24:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 57 proven. 180 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-02-04 03:24:05,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 03:24:05,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 03:24:05,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2642, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 03:24:05,651 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 54 states. [2018-02-04 03:24:07,331 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 103 DAG size of output 89 [2018-02-04 03:24:07,601 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 128 DAG size of output 116 [2018-02-04 03:24:07,958 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 137 DAG size of output 96 [2018-02-04 03:24:08,173 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 98 DAG size of output 94 [2018-02-04 03:24:08,838 WARN L146 SmtUtils]: Spent 510ms on a formula simplification. DAG size of input: 154 DAG size of output 138 [2018-02-04 03:24:09,142 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 160 DAG size of output 128 [2018-02-04 03:24:09,452 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 124 DAG size of output 104 [2018-02-04 03:24:10,946 WARN L146 SmtUtils]: Spent 1298ms on a formula simplification. DAG size of input: 259 DAG size of output 209 [2018-02-04 03:24:13,586 WARN L146 SmtUtils]: Spent 2294ms on a formula simplification. DAG size of input: 294 DAG size of output 224 [2018-02-04 03:24:15,673 WARN L146 SmtUtils]: Spent 1899ms on a formula simplification. DAG size of input: 241 DAG size of output 189 [2018-02-04 03:24:16,630 WARN L146 SmtUtils]: Spent 826ms on a formula simplification. DAG size of input: 187 DAG size of output 158 [2018-02-04 03:24:17,008 WARN L146 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 132 DAG size of output 130 [2018-02-04 03:24:17,566 WARN L146 SmtUtils]: Spent 439ms on a formula simplification. DAG size of input: 163 DAG size of output 160 [2018-02-04 03:24:19,329 WARN L146 SmtUtils]: Spent 1534ms on a formula simplification. DAG size of input: 241 DAG size of output 201 [2018-02-04 03:24:20,398 WARN L146 SmtUtils]: Spent 850ms on a formula simplification. DAG size of input: 201 DAG size of output 164 [2018-02-04 03:24:20,888 WARN L146 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 161 DAG size of output 147 [2018-02-04 03:24:21,499 WARN L146 SmtUtils]: Spent 476ms on a formula simplification. DAG size of input: 179 DAG size of output 159 [2018-02-04 03:24:22,211 WARN L146 SmtUtils]: Spent 540ms on a formula simplification. DAG size of input: 191 DAG size of output 108 [2018-02-04 03:24:22,660 WARN L146 SmtUtils]: Spent 302ms on a formula simplification. DAG size of input: 164 DAG size of output 83 [2018-02-04 03:24:22,914 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 135 DAG size of output 72 [2018-02-04 03:24:23,221 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 145 DAG size of output 82 [2018-02-04 03:24:23,595 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 157 DAG size of output 82 [2018-02-04 03:24:23,868 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 138 DAG size of output 67 [2018-02-04 03:24:25,216 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 167 DAG size of output 90 [2018-02-04 03:24:25,605 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 168 DAG size of output 86 [2018-02-04 03:24:26,363 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 160 DAG size of output 91 [2018-02-04 03:24:28,572 WARN L146 SmtUtils]: Spent 1819ms on a formula simplification. DAG size of input: 295 DAG size of output 232 Received shutdown request... [2018-02-04 03:24:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 03:24:31,667 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 03:24:31,670 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 03:24:31,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:24:31 BoogieIcfgContainer [2018-02-04 03:24:31,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:24:31,671 INFO L168 Benchmark]: Toolchain (without parser) took 180738.62 ms. Allocated memory was 401.1 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 355.1 MB in the beginning and 1.1 GB in the end (delta: -762.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-04 03:24:31,672 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 401.1 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:24:31,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.39 ms. Allocated memory is still 401.1 MB. Free memory was 355.1 MB in the beginning and 341.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:31,672 INFO L168 Benchmark]: Boogie Preprocessor took 21.15 ms. Allocated memory is still 401.1 MB. Free memory was 341.9 MB in the beginning and 340.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:31,672 INFO L168 Benchmark]: RCFGBuilder took 151.26 ms. Allocated memory is still 401.1 MB. Free memory was 340.6 MB in the beginning and 322.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:31,672 INFO L168 Benchmark]: TraceAbstraction took 180405.10 ms. Allocated memory was 401.1 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 320.7 MB in the beginning and 1.1 GB in the end (delta: -797.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-04 03:24:31,673 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.10 ms. Allocated memory is still 401.1 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.39 ms. Allocated memory is still 401.1 MB. Free memory was 355.1 MB in the beginning and 341.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.15 ms. Allocated memory is still 401.1 MB. Free memory was 341.9 MB in the beginning and 340.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 151.26 ms. Allocated memory is still 401.1 MB. Free memory was 340.6 MB in the beginning and 322.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 180405.10 ms. Allocated memory was 401.1 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 320.7 MB in the beginning and 1.1 GB in the end (delta: -797.0 MB). Peak memory consumption was 1.4 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 constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 55 states, 54 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 330. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 180.3s OverallTime, 70 OverallIterations, 7 TraceHistogramMax, 67.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2755 SDtfs, 7384 SDslu, 19666 SDs, 0 SdLazy, 30961 SolverSat, 2461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2280 GetRequests, 277 SyntacticMatches, 131 SemanticMatches, 1871 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17566 ImplicationChecksByTransitivity, 90.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 3554/7182 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, 69 MinimizatonAttempts, 913 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 111.1s InterpolantComputationTime, 5001 NumberOfCodeBlocks, 5001 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 4931 ConstructedInterpolants, 0 QuantifiedInterpolants, 8586416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 12 PerfectInterpolantSequences, 3554/7182 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-24-31-677.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-24-31-677.csv Completed graceful shutdown