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_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:12:18,293 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:12:18,294 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:12:18,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:12:18,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:12:18,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:12:18,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:12:18,311 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:12:18,313 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:12:18,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:12:18,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:12:18,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:12:18,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:12:18,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:12:18,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:12:18,319 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:12:18,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:12:18,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:12:18,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:12:18,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:12:18,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:12:18,326 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:12:18,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:12:18,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:12:18,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:12:18,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:12:18,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:12:18,330 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:12:18,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:12:18,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:12:18,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:12:18,331 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:12:18,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:12:18,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:12:18,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:12:18,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:12:18,342 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:12:18,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:12:18,342 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:12:18,342 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:12:18,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:12:18,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:12:18,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:12:18,343 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:12:18,343 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:12:18,343 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:12:18,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:12:18,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:12:18,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:12:18,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:12:18,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:12:18,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:12:18,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:12:18,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:12:18,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:12:18,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:12:18,385 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:12:18,389 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:12:18,390 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:12:18,390 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:12:18,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-04 03:12:18,556 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:12:18,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:12:18,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:12:18,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:12:18,562 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:12:18,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18, skipping insertion in model container [2018-02-04 03:12:18,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,575 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:12:18,611 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:12:18,698 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:12:18,711 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:12:18,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18 WrapperNode [2018-02-04 03:12:18,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:12:18,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:12:18,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:12:18,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:12:18,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (1/1) ... [2018-02-04 03:12:18,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:12:18,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:12:18,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:12:18,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:12:18,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:12:18,777 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:12:18,777 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:12:18,777 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:12:18,777 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:12:18,777 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:12:18,777 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:12:18,777 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:12:18,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:12:18,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:12:18,929 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:12:18,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:12:18 BoogieIcfgContainer [2018-02-04 03:12:18,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:12:18,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:12:18,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:12:18,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:12:18,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:12:18" (1/3) ... [2018-02-04 03:12:18,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873869f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:12:18, skipping insertion in model container [2018-02-04 03:12:18,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:18" (2/3) ... [2018-02-04 03:12:18,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873869f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:12:18, skipping insertion in model container [2018-02-04 03:12:18,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:12:18" (3/3) ... [2018-02-04 03:12:18,936 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-04 03:12:18,942 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:12:18,948 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 03:12:18,982 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:12:18,982 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:12:18,982 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:12:18,982 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:12:18,982 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:12:18,982 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:12:18,982 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:12:18,983 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:12:18,983 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:12:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 03:12:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:12:19,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:19,002 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:12:19,002 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:12:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-02-04 03:12:19,047 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:19,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:19,146 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:12:19,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:12:19,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:12:19,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:19,150 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:12:19,150 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= |#valid| |old(#valid)|)] [2018-02-04 03:12:19,151 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:12:19,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:12:19,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:12:19,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:12:19,164 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 03:12:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:19,314 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 03:12:19,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:12:19,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 03:12:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:19,326 INFO L225 Difference]: With dead ends: 74 [2018-02-04 03:12:19,326 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 03:12:19,327 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:12:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 03:12:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-02-04 03:12:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 03:12:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 03:12:19,362 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-02-04 03:12:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:19,363 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 03:12:19,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:12:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 03:12:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:12:19,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:19,364 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:12:19,364 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:12:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-02-04 03:12:19,366 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:19,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:12:19,428 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:12:19,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:12:19,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:12:19,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:19,430 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:12:19,430 INFO L182 omatonBuilderFactory]: Interpolants [180#true, 181#false, 182#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 183#(not (= 0 |ldv_malloc_#res.base|)), 184#(not (= 0 |entry_point_#t~ret2.base|)), 185#(not (= 0 entry_point_~array~0.base))] [2018-02-04 03:12:19,430 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:12:19,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:12:19,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:12:19,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:12:19,433 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-04 03:12:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:19,523 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-02-04 03:12:19,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:12:19,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:12:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:19,524 INFO L225 Difference]: With dead ends: 78 [2018-02-04 03:12:19,524 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 03:12:19,525 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:12:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 03:12:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-02-04 03:12:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 03:12:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 03:12:19,529 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-02-04 03:12:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:19,530 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 03:12:19,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:12:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 03:12:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 03:12:19,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:19,531 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:19,531 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:12:19,531 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-02-04 03:12:19,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:19,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:12:19,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:12:19,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:12:19,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:12:19,594 INFO L182 omatonBuilderFactory]: Interpolants [320#true, 321#false, 322#(<= 10 entry_point_~len~0), 323#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-04 03:12:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:12:19,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:12:19,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:12:19,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:12:19,595 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-02-04 03:12:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:19,625 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-02-04 03:12:19,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:12:19,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 03:12:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:19,627 INFO L225 Difference]: With dead ends: 86 [2018-02-04 03:12:19,627 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 03:12:19,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:12:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 03:12:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-02-04 03:12:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 03:12:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-02-04 03:12:19,635 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-02-04 03:12:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:19,635 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-02-04 03:12:19,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:12:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-02-04 03:12:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:12:19,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:19,636 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:19,636 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:12:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-02-04 03:12:19,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:19,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:19,692 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:12:19,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:19,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:12:19,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:19,693 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:12:19,693 INFO L182 omatonBuilderFactory]: Interpolants [466#true, 467#false, 468#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 469#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 470#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-04 03:12:19,693 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:12:19,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:12:19,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:12:19,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:12:19,694 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-02-04 03:12:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:19,711 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 03:12:19,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:12:19,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 03:12:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:19,712 INFO L225 Difference]: With dead ends: 49 [2018-02-04 03:12:19,712 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 03:12:19,713 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:12:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 03:12:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 03:12:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 03:12:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 03:12:19,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-02-04 03:12:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:19,717 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 03:12:19,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:12:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 03:12:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:12:19,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:19,718 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:12:19,718 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:12:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-02-04 03:12:19,719 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:19,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:19,766 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:12:19,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:12:19,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:12:19,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:19,767 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:12:19,767 INFO L182 omatonBuilderFactory]: Interpolants [567#true, 568#false, 569#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 570#(and (= 0 |entry_point_#t~ret4.base|) (= 0 |entry_point_#t~ret4.offset|)), 571#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-04 03:12:19,767 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:12:19,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:12:19,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:12:19,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:12:19,768 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-02-04 03:12:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:19,783 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-02-04 03:12:19,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:12:19,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 03:12:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:19,784 INFO L225 Difference]: With dead ends: 51 [2018-02-04 03:12:19,784 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 03:12:19,784 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:12:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 03:12:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-04 03:12:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 03:12:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 03:12:19,791 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-02-04 03:12:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:19,792 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 03:12:19,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:12:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 03:12:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:12:19,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:19,792 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:19,792 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:12:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-02-04 03:12:19,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:19,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:19,921 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:12:19,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:19,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:12:19,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:19,922 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:12:19,922 INFO L182 omatonBuilderFactory]: Interpolants [672#true, 673#false, 674#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 675#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 676#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 677#(= 1 (select |#valid| entry_point_~array~0.base)), 678#(= |#valid| |old(#valid)|), 679#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 680#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-04 03:12:19,922 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:12:19,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:12:19,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:12:19,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:12:19,923 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 9 states. [2018-02-04 03:12:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:20,092 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-02-04 03:12:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:12:20,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 03:12:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:20,093 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:12:20,093 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:12:20,094 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:12:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:12:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-02-04 03:12:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 03:12:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 03:12:20,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2018-02-04 03:12:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:20,098 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 03:12:20,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:12:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 03:12:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:12:20,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:20,101 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:12:20,101 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:12:20,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-02-04 03:12:20,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:20,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:20,392 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:12:20,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:20,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:12:20,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:20,393 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:12:20,393 INFO L182 omatonBuilderFactory]: Interpolants [816#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 817#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 818#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 819#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 808#true, 809#false, 810#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 811#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 812#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 813#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 814#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 815#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-04 03:12:20,394 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:12:20,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:12:20,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:12:20,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:12:20,395 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 12 states. [2018-02-04 03:12:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:20,863 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-02-04 03:12:20,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:12:20,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 03:12:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:20,864 INFO L225 Difference]: With dead ends: 100 [2018-02-04 03:12:20,865 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 03:12:20,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:12:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 03:12:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-02-04 03:12:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:12:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-02-04 03:12:20,869 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 28 [2018-02-04 03:12:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:20,869 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-02-04 03:12:20,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:12:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-02-04 03:12:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:12:20,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:20,870 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:12:20,871 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:12:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1097237542, now seen corresponding path program 1 times [2018-02-04 03:12:20,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:20,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:20,947 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:12:20,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:12:20,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:12:20,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:12:20,948 INFO L182 omatonBuilderFactory]: Interpolants [1008#true, 1009#false, 1010#(= entry_point_~i~0 0), 1011#(<= (+ entry_point_~j~0 1) 0)] [2018-02-04 03:12:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:12:20,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:12:20,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:12:20,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:12:20,949 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2018-02-04 03:12:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:20,990 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 03:12:20,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:12:20,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 03:12:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:20,991 INFO L225 Difference]: With dead ends: 67 [2018-02-04 03:12:20,991 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 03:12:20,992 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:12:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 03:12:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-04 03:12:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 03:12:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-02-04 03:12:20,998 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29 [2018-02-04 03:12:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:20,999 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-02-04 03:12:20,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:12:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-02-04 03:12:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:12:21,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:21,000 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:12:21,001 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:12:21,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1190998490, now seen corresponding path program 1 times [2018-02-04 03:12:21,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:21,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:21,105 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:12:21,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:21,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:12:21,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:21,106 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:12:21,106 INFO L182 omatonBuilderFactory]: Interpolants [1143#true, 1144#false, 1145#(= |#valid| |old(#valid)|), 1146#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 1147#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 1148#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret2.base| (select |#valid| |entry_point_#t~ret2.base|))) (not (= 0 |entry_point_#t~ret2.base|)) (= (select |old(#valid)| |entry_point_#t~ret2.base|) 0)), 1149#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))))] [2018-02-04 03:12:21,106 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:12:21,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:12:21,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:12:21,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:12:21,107 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 7 states. [2018-02-04 03:12:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:21,197 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-02-04 03:12:21,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:12:21,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 03:12:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:21,199 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:12:21,199 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 03:12:21,199 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:12:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 03:12:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 03:12:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 03:12:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 03:12:21,202 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2018-02-04 03:12:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:21,202 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 03:12:21,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:12:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 03:12:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:12:21,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:21,203 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:12:21,203 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:12:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1833910404, now seen corresponding path program 1 times [2018-02-04 03:12:21,204 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:21,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:12:21,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:12:21,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:12:21,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:12:21,241 INFO L182 omatonBuilderFactory]: Interpolants [1283#true, 1284#false, 1285#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1286#(not (= 0 |ldv_malloc_#res.base|)), 1287#(not (= 0 |entry_point_#t~ret4.base|)), 1288#(not (= 0 entry_point_~p~0.base))] [2018-02-04 03:12:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:12:21,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:12:21,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:12:21,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:12:21,242 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-04 03:12:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:21,268 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-04 03:12:21,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:12:21,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 03:12:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:21,269 INFO L225 Difference]: With dead ends: 58 [2018-02-04 03:12:21,269 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 03:12:21,269 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:12:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 03:12:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-04 03:12:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 03:12:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-04 03:12:21,272 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2018-02-04 03:12:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:21,273 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-04 03:12:21,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:12:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-04 03:12:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:12:21,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:21,273 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:21,273 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:12:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1409435322, now seen corresponding path program 1 times [2018-02-04 03:12:21,274 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:21,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:21,314 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:12:21,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:21,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:12:21,315 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:21,315 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:12:21,315 INFO L182 omatonBuilderFactory]: Interpolants [1408#false, 1409#(<= 10 entry_point_~len~0), 1410#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1411#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1407#true] [2018-02-04 03:12:21,315 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:12:21,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:12:21,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:12:21,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:12:21,316 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 5 states. [2018-02-04 03:12:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:21,367 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-02-04 03:12:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:12:21,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 03:12:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:21,376 INFO L225 Difference]: With dead ends: 87 [2018-02-04 03:12:21,376 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 03:12:21,376 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:12:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 03:12:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2018-02-04 03:12:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 03:12:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-02-04 03:12:21,380 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34 [2018-02-04 03:12:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:21,380 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-02-04 03:12:21,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:12:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-02-04 03:12:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:12:21,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:21,381 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:12:21,381 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:12:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 804244387, now seen corresponding path program 1 times [2018-02-04 03:12:21,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:21,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:12:21,648 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:12:21,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:21,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:12:21,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:21,648 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:12:21,648 INFO L182 omatonBuilderFactory]: Interpolants [1568#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1569#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 1570#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 1571#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 1572#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1) (<= (+ (* 4 entry_point_~i~0) 36) (select |#length| entry_point_~array~0.base))), 1573#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~i~0) 36) (select |#length| entry_point_~array~0.base))), 1560#true, 1561#false, 1562#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 1563#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 1564#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 2147483648 |ldv_malloc_#in~size|))), 1565#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 1566#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 1567#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-04 03:12:21,648 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:12:21,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:12:21,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:12:21,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:12:21,649 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 14 states. [2018-02-04 03:12:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:22,008 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-02-04 03:12:22,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:12:22,008 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-04 03:12:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:22,009 INFO L225 Difference]: With dead ends: 86 [2018-02-04 03:12:22,009 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 03:12:22,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:12:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 03:12:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-02-04 03:12:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:12:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-02-04 03:12:22,012 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 41 [2018-02-04 03:12:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:22,012 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-02-04 03:12:22,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:12:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-02-04 03:12:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:12:22,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:22,013 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:12:22,013 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:12:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash 835021389, now seen corresponding path program 1 times [2018-02-04 03:12:22,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:22,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:22,087 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:12:22,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:12:22,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:12:22,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:22,087 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:12:22,087 INFO L182 omatonBuilderFactory]: Interpolants [1760#(and (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 1761#(= |old(#length)| |#length|), 1762#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base))), 1757#true, 1758#false, 1759#(and (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))] [2018-02-04 03:12:22,088 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:12:22,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:12:22,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:12:22,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:12:22,088 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 6 states. [2018-02-04 03:12:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:22,166 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-02-04 03:12:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:12:22,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 03:12:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:22,167 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:12:22,167 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:12:22,167 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:12:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:12:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 03:12:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:12:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-02-04 03:12:22,170 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 42 [2018-02-04 03:12:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:22,171 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-02-04 03:12:22,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:12:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-02-04 03:12:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:12:22,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:22,172 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:12:22,172 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:12:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash 115859282, now seen corresponding path program 1 times [2018-02-04 03:12:22,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:22,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:22,354 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:12:22,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:22,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:12:22,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:22,355 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:12:22,355 INFO L182 omatonBuilderFactory]: Interpolants [1922#true, 1923#false, 1924#(= 0 |ldv_malloc_#t~malloc1.offset|), 1925#(= 0 |ldv_malloc_#res.offset|), 1926#(= 0 |entry_point_#t~ret2.offset|), 1927#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 1928#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 1929#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 1930#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 1931#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 1932#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 1933#(= |entry_point_#t~mem7.offset| 0)] [2018-02-04 03:12:22,355 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:12:22,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:12:22,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:12:22,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:12:22,356 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 12 states. [2018-02-04 03:12:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:22,517 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-04 03:12:22,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:12:22,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-02-04 03:12:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:22,518 INFO L225 Difference]: With dead ends: 83 [2018-02-04 03:12:22,518 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 03:12:22,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:12:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 03:12:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2018-02-04 03:12:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:12:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-02-04 03:12:22,520 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 43 [2018-02-04 03:12:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:22,520 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-02-04 03:12:22,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:12:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-02-04 03:12:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:12:22,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:22,521 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:12:22,521 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:12:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash 115859283, now seen corresponding path program 1 times [2018-02-04 03:12:22,522 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:22,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:22,759 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:12:22,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:22,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:12:22,759 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:22,760 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:12:22,760 INFO L182 omatonBuilderFactory]: Interpolants [2112#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2113#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2114#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 2115#(= |#valid| |old(#valid)|), 2116#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= entry_point_~array~0.offset 0) (or (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 2117#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 2103#true, 2104#false, 2105#(= 0 |ldv_malloc_#t~malloc1.offset|), 2106#(= 0 |ldv_malloc_#res.offset|), 2107#(= 0 |entry_point_#t~ret2.offset|), 2108#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2109#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2110#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 2111#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0))] [2018-02-04 03:12:22,760 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:12:22,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:12:22,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:12:22,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:12:22,761 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 15 states. [2018-02-04 03:12:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:23,008 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-02-04 03:12:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:12:23,008 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-02-04 03:12:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:23,009 INFO L225 Difference]: With dead ends: 78 [2018-02-04 03:12:23,009 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 03:12:23,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:12:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 03:12:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 03:12:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 03:12:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2018-02-04 03:12:23,012 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 43 [2018-02-04 03:12:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:23,012 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2018-02-04 03:12:23,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:12:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2018-02-04 03:12:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:12:23,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:23,013 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:12:23,013 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:12:23,013 INFO L82 PathProgramCache]: Analyzing trace with hash -329856377, now seen corresponding path program 1 times [2018-02-04 03:12:23,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:23,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:23,051 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:12:23,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:23,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:12:23,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:23,052 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:12:23,052 INFO L182 omatonBuilderFactory]: Interpolants [2288#(= entry_point_~i~0 0), 2289#(<= 1 entry_point_~i~0), 2290#(<= 0 entry_point_~j~0), 2286#true, 2287#false] [2018-02-04 03:12:23,052 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:12:23,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:12:23,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:12:23,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:12:23,053 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 5 states. [2018-02-04 03:12:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:23,089 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-02-04 03:12:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:12:23,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-04 03:12:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:23,090 INFO L225 Difference]: With dead ends: 76 [2018-02-04 03:12:23,090 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 03:12:23,091 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:12:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 03:12:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 03:12:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 03:12:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-02-04 03:12:23,094 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 45 [2018-02-04 03:12:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:23,094 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-02-04 03:12:23,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:12:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-02-04 03:12:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:12:23,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:23,096 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:23,096 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:12:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1632885427, now seen corresponding path program 2 times [2018-02-04 03:12:23,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:23,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:23,141 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:12:23,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:23,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:12:23,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:23,142 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:12:23,142 INFO L182 omatonBuilderFactory]: Interpolants [2448#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 2449#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 2450#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 2445#true, 2446#false, 2447#(<= 10 entry_point_~len~0)] [2018-02-04 03:12:23,142 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:12:23,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:12:23,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:12:23,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:12:23,143 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2018-02-04 03:12:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:23,208 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-02-04 03:12:23,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:12:23,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-04 03:12:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:23,209 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:12:23,209 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:12:23,210 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:12:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:12:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2018-02-04 03:12:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 03:12:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-02-04 03:12:23,213 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 47 [2018-02-04 03:12:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:23,213 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-02-04 03:12:23,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:12:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-02-04 03:12:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:12:23,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:23,214 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:12:23,214 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:12:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576177, now seen corresponding path program 1 times [2018-02-04 03:12:23,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:23,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:23,472 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:12:23,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:23,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:12:23,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:23,473 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:12:23,473 INFO L182 omatonBuilderFactory]: Interpolants [2656#(and (= entry_point_~array~0.offset 0) (or (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base entry_point_~p~0.base)))), 2657#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 2658#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= entry_point_~array~0.offset 0)), 2659#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 2660#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (<= 1 entry_point_~j~0))), 2661#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 2662#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0)), 2663#(= 1 (select |#valid| entry_point_~array~0.base)), 2646#true, 2647#false, 2648#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 2649#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 2650#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 2651#(and (or (= 1 (select |#valid| entry_point_~array~0.base)) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 2652#(= |#valid| |old(#valid)|), 2653#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 2654#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 2655#(and (or (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0))] [2018-02-04 03:12:23,473 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:12:23,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:12:23,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:12:23,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:12:23,474 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 18 states. [2018-02-04 03:12:23,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:23,885 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-02-04 03:12:23,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:12:23,886 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 03:12:23,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:23,886 INFO L225 Difference]: With dead ends: 95 [2018-02-04 03:12:23,887 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 03:12:23,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:12:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 03:12:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-02-04 03:12:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 03:12:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2018-02-04 03:12:23,889 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 48 [2018-02-04 03:12:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:23,889 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2018-02-04 03:12:23,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:12:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2018-02-04 03:12:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:12:23,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:23,890 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:12:23,890 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:12:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576226, now seen corresponding path program 1 times [2018-02-04 03:12:23,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:23,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:23,920 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:12:23,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:23,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:12:23,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:23,921 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:12:23,921 INFO L182 omatonBuilderFactory]: Interpolants [2869#true, 2870#false, 2871#(= entry_point_~i~0 0), 2872#(<= entry_point_~i~0 1), 2873#(<= entry_point_~j~0 0), 2874#(<= (+ entry_point_~j~0 1) 0)] [2018-02-04 03:12:23,921 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:12:23,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:12:23,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:12:23,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:12:23,922 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 6 states. [2018-02-04 03:12:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:23,960 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-04 03:12:23,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:12:23,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-02-04 03:12:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:23,961 INFO L225 Difference]: With dead ends: 87 [2018-02-04 03:12:23,961 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 03:12:23,961 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:12:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 03:12:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-02-04 03:12:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 03:12:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-04 03:12:23,963 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 48 [2018-02-04 03:12:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:23,963 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-04 03:12:23,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:12:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-04 03:12:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:12:23,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:23,964 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:12:23,964 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:12:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash 255829617, now seen corresponding path program 1 times [2018-02-04 03:12:23,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:23,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:24,725 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:12:24,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:24,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:12:24,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:24,726 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:12:24,726 INFO L182 omatonBuilderFactory]: Interpolants [3049#true, 3050#false, 3051#(= |#valid| |old(#valid)|), 3052#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3053#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 3054#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 3055#(and (= entry_point_~array~0.offset 0) (or (and (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3056#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 3057#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 3058#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3059#(and (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3060#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 3061#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))) (= entry_point_~array~0.offset 0)), 3062#(and (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0)))), 3063#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (or (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 3064#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 3065#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 3)))), 3066#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0))] [2018-02-04 03:12:24,726 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:12:24,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:12:24,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:12:24,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:12:24,727 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 18 states. [2018-02-04 03:12:25,555 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 89 DAG size of output 74 [2018-02-04 03:12:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:25,880 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-02-04 03:12:25,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:12:25,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-02-04 03:12:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:25,881 INFO L225 Difference]: With dead ends: 96 [2018-02-04 03:12:25,881 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:12:25,881 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:12:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:12:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-02-04 03:12:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 03:12:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 03:12:25,883 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 51 [2018-02-04 03:12:25,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:25,883 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 03:12:25,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:12:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 03:12:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 03:12:25,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:25,883 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:12:25,883 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:12:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 797091222, now seen corresponding path program 2 times [2018-02-04 03:12:25,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:25,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:26,157 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:12:26,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:26,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:12:26,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:26,158 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:12:26,158 INFO L182 omatonBuilderFactory]: Interpolants [3264#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3265#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3266#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 3267#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 3268#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 3269#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3270#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3271#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3272#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3257#true, 3258#false, 3259#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 3260#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 3261#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 3262#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 3263#(and (= 0 |entry_point_#t~ret2.offset|) (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1))] [2018-02-04 03:12:26,158 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:12:26,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:12:26,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:12:26,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:12:26,159 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 16 states. [2018-02-04 03:12:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:26,556 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-02-04 03:12:26,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:12:26,558 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-02-04 03:12:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:26,558 INFO L225 Difference]: With dead ends: 70 [2018-02-04 03:12:26,558 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:12:26,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:12:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:12:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-02-04 03:12:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:12:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-04 03:12:26,560 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 54 [2018-02-04 03:12:26,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:26,560 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-04 03:12:26,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:12:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-04 03:12:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:12:26,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:26,561 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:12:26,561 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:12:26,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602309, now seen corresponding path program 2 times [2018-02-04 03:12:26,562 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:26,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:26,750 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:12:26,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:26,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:12:26,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:26,751 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:12:26,751 INFO L182 omatonBuilderFactory]: Interpolants [3433#true, 3434#false, 3435#(= 0 |ldv_malloc_#t~malloc1.offset|), 3436#(= 0 |ldv_malloc_#res.offset|), 3437#(= 0 |entry_point_#t~ret2.offset|), 3438#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 3439#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 3440#(= 0 |entry_point_#t~ret4.offset|), 3441#(= 0 entry_point_~p~0.offset), 3442#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3443#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))), 3444#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))), 3445#(= |entry_point_#t~mem7.offset| 0)] [2018-02-04 03:12:26,751 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:12:26,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:12:26,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:12:26,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:12:26,751 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 13 states. [2018-02-04 03:12:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:27,039 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-02-04 03:12:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:12:27,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-02-04 03:12:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:27,041 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:12:27,041 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:12:27,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:12:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:12:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-02-04 03:12:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:12:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-04 03:12:27,044 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 56 [2018-02-04 03:12:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:27,044 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-04 03:12:27,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:12:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-04 03:12:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:12:27,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:27,045 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:12:27,045 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:12:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602310, now seen corresponding path program 2 times [2018-02-04 03:12:27,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:27,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:27,293 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:12:27,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:27,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:12:27,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:27,294 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:12:27,294 INFO L182 omatonBuilderFactory]: Interpolants [3616#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 3617#(= 1 (select |#valid| |entry_point_#t~ret4.base|)), 3618#(= 1 (select |#valid| entry_point_~p~0.base)), 3619#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 3620#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4)))))), 3621#(= |#valid| |old(#valid)|), 3622#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 3623#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 3608#true, 3609#false, 3610#(= 0 |ldv_malloc_#t~malloc1.offset|), 3611#(= 0 |ldv_malloc_#res.offset|), 3612#(= 0 |entry_point_#t~ret2.offset|), 3613#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 3614#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 3615#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))] [2018-02-04 03:12:27,294 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:12:27,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:12:27,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:12:27,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:12:27,295 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 16 states. [2018-02-04 03:12:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:27,568 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-02-04 03:12:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:12:27,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-04 03:12:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:27,569 INFO L225 Difference]: With dead ends: 70 [2018-02-04 03:12:27,569 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 03:12:27,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:12:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 03:12:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-02-04 03:12:27,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 03:12:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-02-04 03:12:27,571 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 56 [2018-02-04 03:12:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:27,571 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-02-04 03:12:27,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:12:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-02-04 03:12:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 03:12:27,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:27,572 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:27,572 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:12:27,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1244279398, now seen corresponding path program 3 times [2018-02-04 03:12:27,573 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:27,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 03:12:27,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:27,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:12:27,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:27,641 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:12:27,641 INFO L182 omatonBuilderFactory]: Interpolants [3792#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 3786#true, 3787#false, 3788#(<= 10 entry_point_~len~0), 3789#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 3790#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 3791#(<= (+ entry_point_~i~0 8) entry_point_~len~0)] [2018-02-04 03:12:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 03:12:27,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:12:27,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:12:27,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:12:27,642 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 7 states. [2018-02-04 03:12:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:27,734 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-02-04 03:12:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:12:27,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-04 03:12:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:27,735 INFO L225 Difference]: With dead ends: 130 [2018-02-04 03:12:27,735 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 03:12:27,735 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:12:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 03:12:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 75. [2018-02-04 03:12:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 03:12:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 03:12:27,738 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 60 [2018-02-04 03:12:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:27,738 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 03:12:27,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:12:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 03:12:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:12:27,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:27,741 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:12:27,741 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:12:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691215, now seen corresponding path program 2 times [2018-02-04 03:12:27,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:27,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:28,053 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:12:28,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:28,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:12:28,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:28,054 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:12:28,054 INFO L182 omatonBuilderFactory]: Interpolants [4004#true, 4005#false, 4006#(= 0 |ldv_malloc_#t~malloc1.offset|), 4007#(= 0 |ldv_malloc_#res.offset|), 4008#(= 0 |entry_point_#t~ret2.offset|), 4009#(= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0), 4010#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 4011#(and (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4012#(= (select |#valid| entry_point_~array~0.base) 1), 4013#(= |#valid| |old(#valid)|), 4014#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 4015#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 4016#(not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)), 4017#(not (= entry_point_~array~0.base entry_point_~p~0.base)), 4018#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 4019#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))))), 4020#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 4021#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))] [2018-02-04 03:12:28,054 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:12:28,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:12:28,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:12:28,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:12:28,055 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 18 states. [2018-02-04 03:12:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:28,392 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-02-04 03:12:28,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:12:28,392 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-02-04 03:12:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:28,393 INFO L225 Difference]: With dead ends: 82 [2018-02-04 03:12:28,393 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 03:12:28,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:12:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 03:12:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-02-04 03:12:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 03:12:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-02-04 03:12:28,395 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 61 [2018-02-04 03:12:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:28,395 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-02-04 03:12:28,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:12:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-02-04 03:12:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:12:28,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:28,396 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:12:28,396 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:12:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691216, now seen corresponding path program 1 times [2018-02-04 03:12:28,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:28,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:28,437 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:12:28,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:28,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:12:28,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:28,438 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:12:28,438 INFO L182 omatonBuilderFactory]: Interpolants [4208#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 4201#true, 4202#false, 4203#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4204#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4205#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4206#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 4207#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))] [2018-02-04 03:12:28,438 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:12:28,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:12:28,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:12:28,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:12:28,439 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 8 states. [2018-02-04 03:12:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:28,518 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-04 03:12:28,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:12:28,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-04 03:12:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:28,519 INFO L225 Difference]: With dead ends: 81 [2018-02-04 03:12:28,519 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 03:12:28,519 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:12:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 03:12:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-02-04 03:12:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 03:12:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-04 03:12:28,522 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 61 [2018-02-04 03:12:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:28,522 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-04 03:12:28,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:12:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-04 03:12:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:12:28,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:28,524 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:12:28,524 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:12:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081745, now seen corresponding path program 1 times [2018-02-04 03:12:28,525 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:28,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:28,846 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:12:28,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:28,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:12:28,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:28,846 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:12:28,847 INFO L182 omatonBuilderFactory]: Interpolants [4384#(and (or (and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4385#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 4386#(= |entry_point_#t~mem7.offset| 0), 4372#true, 4373#false, 4374#(= 0 |ldv_malloc_#t~malloc1.offset|), 4375#(= 0 |ldv_malloc_#res.offset|), 4376#(= 0 |entry_point_#t~ret2.offset|), 4377#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4378#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 4379#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 4380#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 4381#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 4382#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1)) (<= (* 4 entry_point_~i~0) 0)) (= entry_point_~array~0.offset 0)), 4383#(and (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~i~0) 4) (and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 2))))] [2018-02-04 03:12:28,847 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:12:28,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:12:28,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:12:28,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:12:28,847 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 15 states. [2018-02-04 03:12:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:29,129 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-04 03:12:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:12:29,129 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-04 03:12:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:29,130 INFO L225 Difference]: With dead ends: 101 [2018-02-04 03:12:29,130 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 03:12:29,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:12:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 03:12:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-02-04 03:12:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:12:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-02-04 03:12:29,132 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 62 [2018-02-04 03:12:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:29,132 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-02-04 03:12:29,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:12:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-02-04 03:12:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:12:29,133 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:29,133 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:12:29,133 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:12:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081744, now seen corresponding path program 1 times [2018-02-04 03:12:29,134 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:29,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:29,762 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:12:29,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:29,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:12:29,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:29,763 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:12:29,763 INFO L182 omatonBuilderFactory]: Interpolants [4608#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4609#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))) 1)), 4610#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4611#(= |#valid| |old(#valid)|), 4612#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 4613#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4614#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4615#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~i~0) 4) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0) entry_point_~p~0.base))) (<= (* 4 entry_point_~i~0) 0))), 4616#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (* 4 entry_point_~i~0))))) (<= (* 4 entry_point_~i~0) 0))), 4617#(and (or (<= (* 4 entry_point_~i~0) 4) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 4618#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0)), 4619#(and (or (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4620#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4621#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 4622#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 4598#true, 4599#false, 4600#(= 0 |ldv_malloc_#t~malloc1.offset|), 4601#(= 0 |ldv_malloc_#res.offset|), 4602#(= 0 |entry_point_#t~ret2.offset|), 4603#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4604#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 4605#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4606#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4607#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| |entry_point_#t~ret4.base|) 1))] [2018-02-04 03:12:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:12:29,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:12:29,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:12:29,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:12:29,764 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 25 states. [2018-02-04 03:12:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:30,388 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-04 03:12:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:12:30,388 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-04 03:12:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:30,388 INFO L225 Difference]: With dead ends: 98 [2018-02-04 03:12:30,388 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 03:12:30,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:12:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 03:12:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-02-04 03:12:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 03:12:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-04 03:12:30,390 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 62 [2018-02-04 03:12:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:30,391 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-04 03:12:30,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:12:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-04 03:12:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 03:12:30,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:30,391 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:12:30,391 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:12:30,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2094664908, now seen corresponding path program 2 times [2018-02-04 03:12:30,392 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:30,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:30,824 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:12:30,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:30,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:12:30,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:30,824 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:12:30,825 INFO L182 omatonBuilderFactory]: Interpolants [4837#true, 4838#false, 4839#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4840#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4841#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 4842#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4843#(= |#valid| |old(#valid)|), 4844#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 4845#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 4846#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 4847#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 4848#(and (or (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))))) (= entry_point_~array~0.offset 0) (or (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 4849#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 4850#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))))) (= entry_point_~array~0.offset 0)), 4851#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0)), 4852#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 4853#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 4854#(and (= entry_point_~array~0.offset 0) (or (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))))), 4855#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|))) (<= 1 entry_point_~j~0)), 4856#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 4857#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0)), 4858#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:12:30,825 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:12:30,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:12:30,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:12:30,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:12:30,825 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 22 states. [2018-02-04 03:12:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:31,781 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-02-04 03:12:31,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:12:31,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-04 03:12:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:31,781 INFO L225 Difference]: With dead ends: 109 [2018-02-04 03:12:31,782 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 03:12:31,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1619, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 03:12:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 03:12:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-02-04 03:12:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 03:12:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-02-04 03:12:31,785 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 67 [2018-02-04 03:12:31,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:31,785 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-02-04 03:12:31,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:12:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-02-04 03:12:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 03:12:31,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:31,786 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:12:31,786 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:12:31,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2094664859, now seen corresponding path program 3 times [2018-02-04 03:12:31,786 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:31,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:31,831 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:12:31,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:31,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:12:31,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:31,832 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:12:31,832 INFO L182 omatonBuilderFactory]: Interpolants [5120#false, 5121#(= entry_point_~i~0 0), 5122#(<= entry_point_~i~0 1), 5123#(<= entry_point_~i~0 2), 5124#(<= entry_point_~j~0 1), 5125#(<= entry_point_~j~0 0), 5126#(<= (+ entry_point_~j~0 1) 0), 5119#true] [2018-02-04 03:12:31,832 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:12:31,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:12:31,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:12:31,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:12:31,832 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 8 states. [2018-02-04 03:12:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:31,912 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-02-04 03:12:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:12:31,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-02-04 03:12:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:31,913 INFO L225 Difference]: With dead ends: 104 [2018-02-04 03:12:31,913 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 03:12:31,913 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:12:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 03:12:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-02-04 03:12:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 03:12:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-04 03:12:31,916 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 67 [2018-02-04 03:12:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:31,917 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-04 03:12:31,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:12:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-04 03:12:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 03:12:31,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:31,917 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:12:31,918 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:12:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash -582418738, now seen corresponding path program 2 times [2018-02-04 03:12:31,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:31,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:34,634 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:12:34,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:34,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:12:34,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:34,634 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:12:34,634 INFO L182 omatonBuilderFactory]: Interpolants [5336#true, 5337#false, 5338#(= |#valid| |old(#valid)|), 5339#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5340#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5341#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 5342#(and (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 5343#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 5344#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 5345#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))), 5346#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))), 5347#(and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 5348#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (= (select |#valid| entry_point_~array~0.base) 1) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0) (or (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 5349#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= 0 (div (+ (* (- 4) entry_point_~i~0) (+ (- entry_point_~array~0.offset) 3)) 4294967296)) (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |#valid| entry_point_~array~0.base) 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))))), 5350#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (= |#valid| |old(#valid)|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))))), 5351#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 5352#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)))), 5353#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))))), 5354#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= 0 entry_point_~p~0.base)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0)))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 5355#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 5356#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (<= entry_point_~i~0 1) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5357#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~j~0 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 5358#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~j~0 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (not (= entry_point_~array~0.base 0)) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 5359#(and (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5360#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 5361#(and (or (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5362#(and (= entry_point_~array~0.offset 0) (or (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))))), 5363#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 3)))), 5364#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0))] [2018-02-04 03:12:34,635 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:12:34,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:12:34,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:12:34,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:12:34,635 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 29 states. [2018-02-04 03:12:34,966 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-02-04 03:12:35,932 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 94 DAG size of output 94 [2018-02-04 03:12:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:36,819 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-04 03:12:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:12:36,820 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2018-02-04 03:12:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:36,820 INFO L225 Difference]: With dead ends: 103 [2018-02-04 03:12:36,820 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 03:12:36,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:12:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 03:12:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 03:12:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 03:12:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 03:12:36,823 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 70 [2018-02-04 03:12:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:36,823 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 03:12:36,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:12:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 03:12:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 03:12:36,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:36,824 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:36,824 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:12:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 984429971, now seen corresponding path program 4 times [2018-02-04 03:12:36,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:36,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 03:12:36,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:36,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:12:36,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:36,883 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:12:36,883 INFO L182 omatonBuilderFactory]: Interpolants [5586#true, 5587#false, 5588#(<= 10 entry_point_~len~0), 5589#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 5590#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 5591#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 5592#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 5593#(<= (+ entry_point_~i~0 6) entry_point_~len~0)] [2018-02-04 03:12:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 03:12:36,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:12:36,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:12:36,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:12:36,884 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 8 states. [2018-02-04 03:12:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:36,960 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-04 03:12:36,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:12:36,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-02-04 03:12:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:36,961 INFO L225 Difference]: With dead ends: 158 [2018-02-04 03:12:36,961 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 03:12:36,962 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:12:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 03:12:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 89. [2018-02-04 03:12:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 03:12:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-02-04 03:12:36,965 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 73 [2018-02-04 03:12:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:36,965 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-02-04 03:12:36,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:12:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-02-04 03:12:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 03:12:36,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:36,966 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:12:36,966 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:12:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1615277924, now seen corresponding path program 2 times [2018-02-04 03:12:36,968 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:36,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:37,326 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:12:37,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:37,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:12:37,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:37,326 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:12:37,326 INFO L182 omatonBuilderFactory]: Interpolants [5856#(= entry_point_~array~0.offset 0), 5857#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 5858#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 5859#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 5860#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 5861#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 5862#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 5863#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 5864#(= |entry_point_#t~mem7.offset| 0), 5849#true, 5850#false, 5851#(= 0 |ldv_malloc_#t~malloc1.offset|), 5852#(= 0 |ldv_malloc_#res.offset|), 5853#(= 0 |entry_point_#t~ret2.offset|), 5854#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 5855#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))))] [2018-02-04 03:12:37,327 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:12:37,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:12:37,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:12:37,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:12:37,327 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 16 states. [2018-02-04 03:12:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:37,632 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-02-04 03:12:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:12:37,632 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-02-04 03:12:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:37,633 INFO L225 Difference]: With dead ends: 90 [2018-02-04 03:12:37,633 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 03:12:37,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:12:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 03:12:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-02-04 03:12:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 03:12:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-02-04 03:12:37,636 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 75 [2018-02-04 03:12:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:37,636 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-02-04 03:12:37,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:12:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-02-04 03:12:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 03:12:37,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:37,637 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:12:37,637 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:12:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1615277923, now seen corresponding path program 2 times [2018-02-04 03:12:37,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:37,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:38,249 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:12:38,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:38,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:12:38,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:38,249 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:12:38,250 INFO L182 omatonBuilderFactory]: Interpolants [6080#(= 0 |ldv_malloc_#t~malloc1.offset|), 6081#(= 0 |ldv_malloc_#res.offset|), 6082#(= 0 |entry_point_#t~ret2.offset|), 6083#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6084#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6085#(= entry_point_~array~0.offset 0), 6086#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 6087#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 6088#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0)), 6089#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 6090#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~array~0.offset 0)), 6091#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6092#(= |#valid| |old(#valid)|), 6093#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 6094#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6095#(and (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 |entry_point_#t~ret4.base|))), 6096#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6097#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6098#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 6099#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 6100#(and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 6101#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 6102#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0)), 6103#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 6078#true, 6079#false] [2018-02-04 03:12:38,250 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:12:38,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:12:38,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:12:38,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:12:38,250 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 26 states. [2018-02-04 03:12:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:38,978 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-02-04 03:12:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:12:38,979 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-02-04 03:12:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:38,979 INFO L225 Difference]: With dead ends: 91 [2018-02-04 03:12:38,979 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 03:12:38,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:12:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 03:12:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-02-04 03:12:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 03:12:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-04 03:12:38,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 75 [2018-02-04 03:12:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:38,982 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-04 03:12:38,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:12:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-04 03:12:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 03:12:38,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:38,983 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:12:38,983 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:12:38,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1868460952, now seen corresponding path program 4 times [2018-02-04 03:12:38,984 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:38,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:39,449 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:12:39,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:39,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:12:39,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:39,449 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:12:39,449 INFO L182 omatonBuilderFactory]: Interpolants [6336#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6337#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 6338#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 6339#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 6340#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= entry_point_~i~0 1)) (= entry_point_~array~0.offset 0)), 6341#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (<= entry_point_~i~0 2)) (= entry_point_~array~0.offset 0)), 6342#(and (or (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0)), 6343#(and (or (<= entry_point_~j~0 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))) (= entry_point_~array~0.offset 0)), 6344#(or (<= entry_point_~j~0 0) (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))), 6345#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6346#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6347#(= (select |#valid| entry_point_~array~0.base) 1), 6325#true, 6326#false, 6327#(= 0 |ldv_malloc_#t~malloc1.offset|), 6328#(= 0 |ldv_malloc_#res.offset|), 6329#(= 0 |entry_point_#t~ret2.offset|), 6330#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6331#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6332#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6333#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6334#(= |#valid| |old(#valid)|), 6335#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))] [2018-02-04 03:12:39,450 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:12:39,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:12:39,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:12:39,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:12:39,450 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 23 states. [2018-02-04 03:12:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:40,048 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-02-04 03:12:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:12:40,049 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-02-04 03:12:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:40,049 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:12:40,049 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:12:40,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:12:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:12:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2018-02-04 03:12:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 03:12:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-02-04 03:12:40,052 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 80 [2018-02-04 03:12:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:40,052 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-02-04 03:12:40,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:12:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-02-04 03:12:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 03:12:40,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:40,052 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:12:40,052 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:12:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1868460953, now seen corresponding path program 2 times [2018-02-04 03:12:40,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:40,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:40,126 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:12:40,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:40,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:12:40,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:40,127 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:12:40,127 INFO L182 omatonBuilderFactory]: Interpolants [6624#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6625#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6626#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6627#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6628#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 6629#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 6620#true, 6621#false, 6622#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6623#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))] [2018-02-04 03:12:40,127 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:12:40,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:12:40,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:12:40,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:12:40,128 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 10 states. [2018-02-04 03:12:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:40,237 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-04 03:12:40,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:12:40,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-02-04 03:12:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:40,238 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:12:40,238 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:12:40,238 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:12:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:12:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-02-04 03:12:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:12:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-02-04 03:12:40,241 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 80 [2018-02-04 03:12:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:40,241 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-02-04 03:12:40,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:12:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-02-04 03:12:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:12:40,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:40,242 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:12:40,242 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:12:40,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2087714694, now seen corresponding path program 3 times [2018-02-04 03:12:40,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:40,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:40,653 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:12:40,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:40,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:12:40,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:40,654 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:12:40,654 INFO L182 omatonBuilderFactory]: Interpolants [6862#true, 6863#false, 6864#(= 0 |ldv_malloc_#t~malloc1.offset|), 6865#(= 0 |ldv_malloc_#res.offset|), 6866#(= 0 |entry_point_#t~ret2.offset|), 6867#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6868#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 6869#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 6870#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 6871#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 6872#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))), 6873#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.offset) 0))), 6874#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 6875#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 6876#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 6877#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 6878#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 6879#(= |entry_point_#t~mem7.offset| 0)] [2018-02-04 03:12:40,654 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:12:40,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:12:40,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:12:40,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:12:40,655 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 18 states. [2018-02-04 03:12:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:40,971 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-02-04 03:12:40,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:12:40,971 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-02-04 03:12:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:40,972 INFO L225 Difference]: With dead ends: 122 [2018-02-04 03:12:40,972 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 03:12:40,972 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:12:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 03:12:40,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-02-04 03:12:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 03:12:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-04 03:12:40,974 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 81 [2018-02-04 03:12:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:40,975 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-04 03:12:40,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:12:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-04 03:12:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:12:40,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:40,975 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:12:40,975 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:12:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2087714695, now seen corresponding path program 3 times [2018-02-04 03:12:40,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:40,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:42,120 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:12:42,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:42,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:12:42,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:42,144 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:12:42,144 INFO L182 omatonBuilderFactory]: Interpolants [7132#true, 7133#false, 7134#(= 0 |ldv_malloc_#t~malloc1.offset|), 7135#(= 0 |ldv_malloc_#res.offset|), 7136#(= 0 |entry_point_#t~ret2.offset|), 7137#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7138#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 7139#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 7140#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7141#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7142#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7143#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7144#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 7145#(= |#valid| |old(#valid)|), 7146#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 7147#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 7148#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 7149#(and (<= (* 4 entry_point_~i~0) 4) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0) entry_point_~p~0.base))), 7150#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (<= entry_point_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 7151#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 8)))), 7152#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (not (= 0 |entry_point_#t~ret4.base|))), 7153#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base)) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 7154#(and (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 7155#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 3) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 11)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))), 7156#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7))), 7157#(and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (and (or (and (<= entry_point_~j~0 2) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0))) (not (= 0 |entry_point_#t~mem7.base|))), 7158#(and (or (and (<= entry_point_~j~0 2) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 7159#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 7160#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)))) (= entry_point_~array~0.offset 0)), 7161#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 7162#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 7163#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:12:42,145 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:12:42,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:12:42,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:12:42,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:12:42,145 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 32 states. [2018-02-04 03:12:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:43,336 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 03:12:43,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:12:43,336 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-02-04 03:12:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:43,337 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:12:43,337 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 03:12:43,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=240, Invalid=2412, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 03:12:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 03:12:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-02-04 03:12:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 03:12:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-04 03:12:43,339 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 81 [2018-02-04 03:12:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:43,340 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-04 03:12:43,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:12:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-04 03:12:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 03:12:43,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:43,340 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:12:43,340 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:12:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash 542617019, now seen corresponding path program 3 times [2018-02-04 03:12:43,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:43,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:43,386 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:12:43,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:43,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:12:43,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:43,387 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:12:43,387 INFO L182 omatonBuilderFactory]: Interpolants [7440#false, 7441#(= entry_point_~i~0 0), 7442#(<= 1 entry_point_~i~0), 7443#(<= 2 entry_point_~i~0), 7444#(<= 3 entry_point_~i~0), 7445#(<= 2 entry_point_~j~0), 7446#(<= 1 entry_point_~j~0), 7447#(<= 0 entry_point_~j~0), 7439#true] [2018-02-04 03:12:43,387 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:12:43,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:12:43,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:12:43,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:12:43,387 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 9 states. [2018-02-04 03:12:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:43,443 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-02-04 03:12:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:12:43,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-02-04 03:12:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:43,444 INFO L225 Difference]: With dead ends: 113 [2018-02-04 03:12:43,444 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 03:12:43,444 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:12:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 03:12:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 03:12:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 03:12:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-02-04 03:12:43,446 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 83 [2018-02-04 03:12:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:43,447 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-02-04 03:12:43,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:12:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-02-04 03:12:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:12:43,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:43,447 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:43,447 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:12:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1000111226, now seen corresponding path program 5 times [2018-02-04 03:12:43,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:43,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-04 03:12:43,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:43,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:12:43,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:43,492 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:12:43,492 INFO L182 omatonBuilderFactory]: Interpolants [7680#true, 7681#false, 7682#(<= 10 entry_point_~len~0), 7683#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 7684#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 7685#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 7686#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 7687#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 7688#(<= (+ entry_point_~i~0 5) entry_point_~len~0)] [2018-02-04 03:12:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-04 03:12:43,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:12:43,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:12:43,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:12:43,492 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 9 states. [2018-02-04 03:12:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:43,577 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-02-04 03:12:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:12:43,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-02-04 03:12:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:43,578 INFO L225 Difference]: With dead ends: 195 [2018-02-04 03:12:43,578 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 03:12:43,579 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:12:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 03:12:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 120. [2018-02-04 03:12:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 03:12:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2018-02-04 03:12:43,582 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 86 [2018-02-04 03:12:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:43,582 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2018-02-04 03:12:43,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:12:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2018-02-04 03:12:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:12:43,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:43,583 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:12:43,583 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:12:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -79558979, now seen corresponding path program 3 times [2018-02-04 03:12:43,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:43,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:12:44,078 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:12:44,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:44,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:12:44,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:44,079 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:12:44,079 INFO L182 omatonBuilderFactory]: Interpolants [8032#(and (<= entry_point_~j~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8033#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 8034#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 8035#(= 1 (select |#valid| entry_point_~array~0.base)), 8014#true, 8015#false, 8016#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 8017#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 8018#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 8019#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8020#(= |#valid| |old(#valid)|), 8021#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8022#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8023#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8024#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 8025#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 8026#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8027#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8028#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))), 8029#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8030#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8031#(and (<= entry_point_~j~0 2) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))] [2018-02-04 03:12:44,079 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:12:44,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:12:44,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:12:44,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:12:44,080 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand 22 states. [2018-02-04 03:12:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:44,610 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-04 03:12:44,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:12:44,610 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-02-04 03:12:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:44,610 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:12:44,610 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:12:44,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:12:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:12:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2018-02-04 03:12:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 03:12:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-02-04 03:12:44,613 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 86 [2018-02-04 03:12:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:44,613 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-02-04 03:12:44,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:12:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-02-04 03:12:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:12:44,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:44,614 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:12:44,614 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:12:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash -79558929, now seen corresponding path program 3 times [2018-02-04 03:12:44,614 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:44,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:44,677 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:12:44,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:44,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:12:44,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:44,678 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:12:44,678 INFO L182 omatonBuilderFactory]: Interpolants [8309#true, 8310#false, 8311#(= entry_point_~i~0 0), 8312#(<= entry_point_~i~0 1), 8313#(<= entry_point_~i~0 2), 8314#(<= entry_point_~i~0 3), 8315#(<= entry_point_~j~0 2), 8316#(<= entry_point_~j~0 1), 8317#(<= entry_point_~j~0 0), 8318#(<= (+ entry_point_~j~0 1) 0)] [2018-02-04 03:12:44,678 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:12:44,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:12:44,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:12:44,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:12:44,678 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 10 states. [2018-02-04 03:12:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:44,742 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-02-04 03:12:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:12:44,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-02-04 03:12:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:44,743 INFO L225 Difference]: With dead ends: 124 [2018-02-04 03:12:44,743 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:12:44,743 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:12:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:12:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-02-04 03:12:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 03:12:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-02-04 03:12:44,746 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 86 [2018-02-04 03:12:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:44,746 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-02-04 03:12:44,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:12:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-02-04 03:12:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:12:44,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:44,748 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:12:44,748 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:12:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash 680415909, now seen corresponding path program 4 times [2018-02-04 03:12:44,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:44,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:50,414 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 89 DAG size of output 36 [2018-02-04 03:12:50,862 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 129 DAG size of output 47 [2018-02-04 03:12:51,070 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 137 DAG size of output 53 [2018-02-04 03:12:51,457 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 142 DAG size of output 55 [2018-02-04 03:12:51,726 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 133 DAG size of output 54 [2018-02-04 03:12:52,260 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 107 DAG size of output 64 [2018-02-04 03:12:52,429 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 101 DAG size of output 62 [2018-02-04 03:12:52,606 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 102 DAG size of output 63 [2018-02-04 03:12:52,780 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 110 DAG size of output 71 [2018-02-04 03:12:52,954 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-02-04 03:12:53,143 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 125 DAG size of output 66 [2018-02-04 03:12:53,639 WARN L146 SmtUtils]: Spent 280ms on a formula simplification. DAG size of input: 172 DAG size of output 60 [2018-02-04 03:12:54,125 WARN L146 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 177 DAG size of output 54 [2018-02-04 03:12:54,572 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 124 DAG size of output 54 [2018-02-04 03:12:54,909 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 137 DAG size of output 42 [2018-02-04 03:12:55,308 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 163 DAG size of output 42 [2018-02-04 03:12:55,772 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 163 DAG size of output 42 [2018-02-04 03:12:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:12:56,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:56,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 03:12:56,478 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:56,478 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:12:56,478 INFO L182 omatonBuilderFactory]: Interpolants [8576#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|)), 8577#(and (or (= |#valid| |old(#valid)|) (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 8578#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (<= |ldv_malloc_#in~size| ldv_malloc_~size) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|)))))), 8579#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8580#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8581#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 8582#(and (= 1 (select |#valid| entry_point_~p~0.base)) (or (and (or (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|)) (= entry_point_~p~0.base (@diff |#valid| |old(#valid)|))) (= (store (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (select |old(#valid)| (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (or (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= entry_point_~p~0.base (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)) (= entry_point_~array~0.base (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8583#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))))), 8584#(and (<= (* 4 entry_point_~i~0) 4) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 8585#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8586#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.base| (@diff |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8587#(and (or (and (<= entry_point_~i~0 1) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| |entry_point_#t~ret4.base| 0) entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 0)) (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 8588#(and (= 1 (select |#valid| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 1) (or (= (select (store |#valid| entry_point_~p~0.base 0) entry_point_~array~0.base) 0) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (or (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0)) (and (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))))) (<= (* 4 entry_point_~i~0) 0))), 8589#(and (= entry_point_~array~0.offset 0) (or (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) 0) entry_point_~array~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~0 1) (= (select |#valid| entry_point_~array~0.base) 1)) (<= (* 4 entry_point_~i~0) 3))), 8590#(and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select |#valid| entry_point_~array~0.base) 1) (or (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))))) (<= (* 4 entry_point_~i~0) 7))), 8591#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8592#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 8593#(and (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (or (and (= (select (store (store |#valid| |entry_point_#t~ret4.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~0 2) (not (= 0 |entry_point_#t~ret4.base|)))) (= entry_point_~array~0.offset 0)), 8594#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (or (and (or (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)) (and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base) (= (select (store (store |#valid| entry_point_~p~0.base 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= (* 4 entry_point_~i~0) 8) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))))), 8595#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (or (and (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (<= (* 4 entry_point_~i~0) 8)))), 8596#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 11) (and (<= entry_point_~i~0 3) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) 0) entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))))), 8597#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (and (<= (* 4 entry_point_~j~0) 8) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))))), 8598#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (store (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7))), 8599#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (and (<= entry_point_~j~0 2) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))))) (= entry_point_~array~0.offset 0)), 8600#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) 0) entry_point_~array~0.base) 0))))), 8601#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|))))), 8602#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base 0)) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)))))) (= entry_point_~array~0.offset 0)), 8603#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 1) 0) (and (not (= entry_point_~array~0.base 0)) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 0) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))))))) (= entry_point_~array~0.offset 0)), 8604#(and (or (= (select |#valid| entry_point_~array~0.base) 0) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 0) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 8605#(and (or (= (select |#valid| |entry_point_#t~mem7.base|) 0) (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|)) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 8606#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))))), 8571#true, 8572#false, 8573#(= |#valid| |old(#valid)|), 8574#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 8575#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (@diff |#valid| |old(#valid)|) |ldv_malloc_#res.base|)))] [2018-02-04 03:12:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:12:56,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 03:12:56,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 03:12:56,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:12:56,479 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 36 states. [2018-02-04 03:12:57,206 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 98 DAG size of output 96 [2018-02-04 03:12:58,408 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-04 03:12:58,597 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-04 03:12:58,808 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 101 DAG size of output 88 [2018-02-04 03:12:59,021 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 110 DAG size of output 77 [2018-02-04 03:12:59,326 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 105 DAG size of output 73 [2018-02-04 03:12:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:59,658 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-02-04 03:12:59,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:12:59,658 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-02-04 03:12:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:59,659 INFO L225 Difference]: With dead ends: 123 [2018-02-04 03:12:59,659 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:12:59,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=379, Invalid=2701, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:12:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:12:59,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 03:12:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 03:12:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-04 03:12:59,662 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 89 [2018-02-04 03:12:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:59,662 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-04 03:12:59,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 03:12:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-04 03:12:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 03:12:59,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:59,663 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:12:59,663 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:12:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 35987013, now seen corresponding path program 5 times [2018-02-04 03:12:59,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:59,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:59,893 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:12:59,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:59,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:12:59,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:59,894 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:12:59,894 INFO L182 omatonBuilderFactory]: Interpolants [8866#true, 8867#false, 8868#(= (select |#valid| entry_point_~array~0.base) 1), 8869#(= |#valid| |old(#valid)|), 8870#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 8871#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 8872#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 8873#(and (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 8874#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 8875#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))), 8876#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2)))))))), 8877#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))), 8878#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 8879#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|)))] [2018-02-04 03:12:59,894 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:12:59,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:12:59,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:12:59,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:12:59,895 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 14 states. [2018-02-04 03:13:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:00,309 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-02-04 03:13:00,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:13:00,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-02-04 03:13:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:00,310 INFO L225 Difference]: With dead ends: 98 [2018-02-04 03:13:00,310 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 03:13:00,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:13:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 03:13:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-04 03:13:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 03:13:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-04 03:13:00,312 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 93 [2018-02-04 03:13:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:00,313 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-04 03:13:00,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:13:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-04 03:13:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:13:00,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:00,314 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:13:00,314 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:13:00,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1115597433, now seen corresponding path program 4 times [2018-02-04 03:13:00,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:00,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:00,778 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:13:00,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:00,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:13:00,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:00,779 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:13:00,779 INFO L182 omatonBuilderFactory]: Interpolants [9120#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 9121#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 9122#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9123#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12)))) (= entry_point_~array~0.offset 0)), 9124#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9125#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 9126#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 9127#(= |entry_point_#t~mem7.offset| 0), 9110#true, 9111#false, 9112#(= 0 |ldv_malloc_#t~malloc1.offset|), 9113#(= 0 |ldv_malloc_#res.offset|), 9114#(= 0 |entry_point_#t~ret2.offset|), 9115#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 9116#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 9117#(= entry_point_~array~0.offset 0), 9118#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 9119#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset))] [2018-02-04 03:13:00,779 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:13:00,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:13:00,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:13:00,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:13:00,780 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 18 states. [2018-02-04 03:13:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:01,240 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-02-04 03:13:01,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:13:01,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-02-04 03:13:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:01,241 INFO L225 Difference]: With dead ends: 100 [2018-02-04 03:13:01,241 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 03:13:01,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:13:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 03:13:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-02-04 03:13:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 03:13:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-02-04 03:13:01,243 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 94 [2018-02-04 03:13:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:01,243 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-02-04 03:13:01,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:13:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-02-04 03:13:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:13:01,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:01,244 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:13:01,244 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:13:01,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1115597434, now seen corresponding path program 4 times [2018-02-04 03:13:01,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:01,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:02,766 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:13:02,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:02,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 03:13:02,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:02,766 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:13:02,766 INFO L182 omatonBuilderFactory]: Interpolants [9369#true, 9370#false, 9371#(= 0 (select |#valid| 0)), 9372#(= (select |old(#valid)| 0) (select |#valid| 0)), 9373#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 9374#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 9375#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |#valid| 0))), 9376#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9377#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= (select |old(#valid)| 0) (select |#valid| 0)))) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 9378#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 9379#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9380#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 9381#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 9382#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9383#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9384#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0)), 9385#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9386#(= |#valid| |old(#valid)|), 9387#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 9388#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9389#(and (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 |entry_point_#t~ret4.base|))), 9390#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9391#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9392#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9393#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 9394#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9395#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) |entry_point_#t~ret4.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 |entry_point_#t~ret4.base|))), 9396#(and (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8))) entry_point_~p~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9397#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9398#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (= entry_point_~array~0.offset 0)), 9399#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 9400#(and (= entry_point_~array~0.offset 0) (or (and (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))) (and (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (not (= |entry_point_#t~mem7.base| 0))))), 9401#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))), 9402#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9403#(and (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|)) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9404#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9405#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0)), 9406#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:13:02,767 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:13:02,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 03:13:02,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 03:13:02,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:13:02,767 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 38 states. [2018-02-04 03:13:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:04,998 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-02-04 03:13:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 03:13:04,998 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-02-04 03:13:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:04,999 INFO L225 Difference]: With dead ends: 100 [2018-02-04 03:13:04,999 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 03:13:05,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=618, Invalid=4784, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 03:13:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 03:13:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-02-04 03:13:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 03:13:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-02-04 03:13:05,002 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 94 [2018-02-04 03:13:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:05,002 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-02-04 03:13:05,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 03:13:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-02-04 03:13:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:13:05,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:05,003 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:13:05,003 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:13:05,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1301854323, now seen corresponding path program 6 times [2018-02-04 03:13:05,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:05,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-04 03:13:05,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:05,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:13:05,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:05,085 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:13:05,085 INFO L182 omatonBuilderFactory]: Interpolants [9680#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 9681#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 9682#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 9683#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 9684#(<= (+ entry_point_~i~0 5) entry_point_~len~0), 9685#(<= (+ entry_point_~i~0 4) entry_point_~len~0), 9676#true, 9677#false, 9678#(<= 10 entry_point_~len~0), 9679#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-04 03:13:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-04 03:13:05,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:13:05,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:13:05,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:13:05,085 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 10 states. [2018-02-04 03:13:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:05,161 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2018-02-04 03:13:05,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:13:05,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-02-04 03:13:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:05,162 INFO L225 Difference]: With dead ends: 208 [2018-02-04 03:13:05,162 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 03:13:05,162 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:13:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 03:13:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 104. [2018-02-04 03:13:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 03:13:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-02-04 03:13:05,166 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 99 [2018-02-04 03:13:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:05,166 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-02-04 03:13:05,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:13:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-02-04 03:13:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:13:05,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:05,167 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:13:05,167 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:13:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash -2072560726, now seen corresponding path program 4 times [2018-02-04 03:13:05,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:05,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:05,232 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:13:05,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:05,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:13:05,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:05,233 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:13:05,233 INFO L182 omatonBuilderFactory]: Interpolants [10016#(<= 4 entry_point_~i~0), 10017#(<= 3 entry_point_~j~0), 10018#(<= 2 entry_point_~j~0), 10019#(<= 1 entry_point_~j~0), 10020#(<= 0 entry_point_~j~0), 10010#true, 10011#false, 10012#(= entry_point_~i~0 0), 10013#(<= 1 entry_point_~i~0), 10014#(<= 2 entry_point_~i~0), 10015#(<= 3 entry_point_~i~0)] [2018-02-04 03:13:05,233 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:13:05,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:13:05,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:13:05,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:13:05,233 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 11 states. [2018-02-04 03:13:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:05,349 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-02-04 03:13:05,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:13:05,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-02-04 03:13:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:05,350 INFO L225 Difference]: With dead ends: 108 [2018-02-04 03:13:05,350 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 03:13:05,350 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:13:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 03:13:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-04 03:13:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:13:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-02-04 03:13:05,353 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 99 [2018-02-04 03:13:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:05,353 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-02-04 03:13:05,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:13:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-02-04 03:13:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:13:05,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:05,354 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:13:05,354 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:13:05,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2072560677, now seen corresponding path program 6 times [2018-02-04 03:13:05,356 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:05,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:06,061 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:13:06,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:06,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:13:06,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:06,062 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:13:06,062 INFO L182 omatonBuilderFactory]: Interpolants [10245#true, 10246#false, 10247#(= 0 |ldv_malloc_#t~malloc1.offset|), 10248#(= 0 |ldv_malloc_#res.offset|), 10249#(= 0 |entry_point_#t~ret2.offset|), 10250#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10251#(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))), 10252#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10253#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10254#(= |#valid| |old(#valid)|), 10255#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10256#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10257#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 10258#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 10259#(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)))))), 10260#(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)), 10261#(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)), 10262#(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))))))), 10263#(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)), 10264#(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)), 10265#(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)), 10266#(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|)))), 10267#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10268#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10269#(= (select |#valid| entry_point_~array~0.base) 1)] [2018-02-04 03:13:06,062 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:13:06,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:13:06,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:13:06,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:13:06,062 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 25 states. [2018-02-04 03:13:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:06,901 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-02-04 03:13:06,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:13:06,901 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-02-04 03:13:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:06,902 INFO L225 Difference]: With dead ends: 149 [2018-02-04 03:13:06,902 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 03:13:06,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 03:13:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 03:13:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2018-02-04 03:13:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 03:13:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-02-04 03:13:06,906 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 99 [2018-02-04 03:13:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:06,907 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-02-04 03:13:06,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:13:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-02-04 03:13:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:13:06,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:06,908 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:13:06,909 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:13:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2072560676, now seen corresponding path program 4 times [2018-02-04 03:13:06,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:06,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:07,015 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:13:07,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:07,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:13:07,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:07,016 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:13:07,016 INFO L182 omatonBuilderFactory]: Interpolants [10608#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 10609#(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))), 10610#(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))), 10599#true, 10600#false, 10601#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10602#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10603#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10604#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10605#(<= 16 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10606#(<= 12 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 10607#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))] [2018-02-04 03:13:07,016 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:13:07,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:13:07,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:13:07,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:13:07,017 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 12 states. [2018-02-04 03:13:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:07,135 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-02-04 03:13:07,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:13:07,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-02-04 03:13:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:07,136 INFO L225 Difference]: With dead ends: 139 [2018-02-04 03:13:07,136 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 03:13:07,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:13:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 03:13:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2018-02-04 03:13:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 03:13:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2018-02-04 03:13:07,138 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 99 [2018-02-04 03:13:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:07,138 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2018-02-04 03:13:07,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:13:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-02-04 03:13:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:13:07,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:07,139 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:13:07,139 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:13:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash 175128483, now seen corresponding path program 5 times [2018-02-04 03:13:07,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:07,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:07,496 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:13:07,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:07,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:13:07,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:07,497 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:13:07,497 INFO L182 omatonBuilderFactory]: Interpolants [10912#(= |entry_point_#t~mem7.offset| 0), 10893#true, 10894#false, 10895#(= 0 |ldv_malloc_#t~malloc1.offset|), 10896#(= 0 |ldv_malloc_#res.offset|), 10897#(= 0 |entry_point_#t~ret2.offset|), 10898#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10899#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 10900#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 10901#(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))))), 10902#(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)), 10903#(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)), 10904#(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))), 10905#(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))), 10906#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10907#(and (<= entry_point_~i~0 4) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10908#(and (<= entry_point_~j~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10909#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10910#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10911#(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) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))] [2018-02-04 03:13:07,497 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:13:07,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:13:07,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:13:07,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:13:07,498 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 20 states. [2018-02-04 03:13:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:07,786 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2018-02-04 03:13:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:13:07,786 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2018-02-04 03:13:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:07,787 INFO L225 Difference]: With dead ends: 146 [2018-02-04 03:13:07,787 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 03:13:07,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:13:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 03:13:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2018-02-04 03:13:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 03:13:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2018-02-04 03:13:07,790 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 100 [2018-02-04 03:13:07,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:07,790 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2018-02-04 03:13:07,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:13:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2018-02-04 03:13:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:13:07,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:07,791 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:13:07,791 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:13:07,791 INFO L82 PathProgramCache]: Analyzing trace with hash 175128484, now seen corresponding path program 5 times [2018-02-04 03:13:07,792 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:07,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:09,576 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:13:09,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:09,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 03:13:09,577 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:09,577 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:13:09,577 INFO L182 omatonBuilderFactory]: Interpolants [11218#true, 11219#false, 11220#(= 0 |ldv_malloc_#t~malloc1.offset|), 11221#(= 0 |ldv_malloc_#res.offset|), 11222#(= 0 |entry_point_#t~ret2.offset|), 11223#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 11224#(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))))), 11225#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 11226#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 11227#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 11228#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 11229#(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)), 11230#(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)))), 11231#(= |#valid| |old(#valid)|), 11232#(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)), 11233#(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|))))), 11234#(and (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_~i~0 1) (= 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|))), 11235#(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)), 11236#(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))), 11237#(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)), 11238#(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|))))), 11239#(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)), 11240#(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)), 11241#(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)), 11242#(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))), 11243#(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)), 11244#(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))), 11245#(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)), 11246#(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)), 11247#(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)), 11248#(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)), 11249#(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)), 11250#(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)), 11251#(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)), 11252#(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))), 11253#(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)))))), 11254#(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)), 11255#(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)), 11256#(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)))))), 11257#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:13:09,578 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:13:09,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 03:13:09,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 03:13:09,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:13:09,578 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand 40 states. [2018-02-04 03:13:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:10,961 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-02-04 03:13:10,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:13:10,961 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 100 [2018-02-04 03:13:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:10,962 INFO L225 Difference]: With dead ends: 145 [2018-02-04 03:13:10,962 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 03:13:10,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=442, Invalid=2750, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 03:13:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 03:13:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-02-04 03:13:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 03:13:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-04 03:13:10,964 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 100 [2018-02-04 03:13:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:10,964 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-04 03:13:10,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 03:13:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-04 03:13:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 03:13:10,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:10,965 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:13:10,965 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:13:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1796845376, now seen corresponding path program 5 times [2018-02-04 03:13:10,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:10,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:11,401 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:13:11,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:11,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:13:11,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:11,402 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:13:11,402 INFO L182 omatonBuilderFactory]: Interpolants [11584#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 11585#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 11586#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 11587#(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)))))), 11588#(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)))), 11589#(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)))), 11590#(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)))), 11591#(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)))), 11592#(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)))), 11593#(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)))), 11594#(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)))), 11595#(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)))), 11596#(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)))), 11597#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (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))))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 11598#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 11599#(= 1 (select |#valid| entry_point_~array~0.base)), 11576#true, 11577#false, 11578#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 11579#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11580#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 11581#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 11582#(= |#valid| |old(#valid)|), 11583#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))] [2018-02-04 03:13:11,402 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:13:11,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:13:11,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:13:11,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:13:11,403 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand 24 states. [2018-02-04 03:13:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:12,000 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-02-04 03:13:12,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:13:12,000 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2018-02-04 03:13:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:12,001 INFO L225 Difference]: With dead ends: 145 [2018-02-04 03:13:12,001 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 03:13:12,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:13:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 03:13:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-02-04 03:13:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 03:13:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2018-02-04 03:13:12,003 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 105 [2018-02-04 03:13:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:12,003 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2018-02-04 03:13:12,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:13:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2018-02-04 03:13:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 03:13:12,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:12,004 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:13:12,004 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:13:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1796845326, now seen corresponding path program 5 times [2018-02-04 03:13:12,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:12,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:12,060 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:13:12,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:12,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:13:12,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:12,084 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:13:12,084 INFO L182 omatonBuilderFactory]: Interpolants [11920#(<= entry_point_~i~0 1), 11921#(<= entry_point_~i~0 2), 11922#(<= entry_point_~i~0 3), 11923#(<= entry_point_~i~0 4), 11924#(<= entry_point_~j~0 3), 11925#(<= entry_point_~j~0 2), 11926#(<= entry_point_~j~0 1), 11927#(<= entry_point_~j~0 0), 11928#(<= (+ entry_point_~j~0 1) 0), 11917#true, 11918#false, 11919#(= entry_point_~i~0 0)] [2018-02-04 03:13:12,084 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:13:12,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:13:12,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:13:12,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:13:12,084 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 12 states. [2018-02-04 03:13:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:12,144 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-02-04 03:13:12,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:13:12,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-02-04 03:13:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:12,145 INFO L225 Difference]: With dead ends: 143 [2018-02-04 03:13:12,145 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 03:13:12,145 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:13:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 03:13:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-02-04 03:13:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 03:13:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2018-02-04 03:13:12,147 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 105 [2018-02-04 03:13:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:12,147 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-02-04 03:13:12,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:13:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2018-02-04 03:13:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 03:13:12,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:12,148 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:13:12,148 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:13:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1643174462, now seen corresponding path program 5 times [2018-02-04 03:13:12,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:12,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:12,470 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 108 DAG size of output 45 [2018-02-04 03:14:12,647 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 111 DAG size of output 51 [2018-02-04 03:14:12,955 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 113 DAG size of output 51 [2018-02-04 03:14:13,196 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 118 DAG size of output 49 [2018-02-04 03:14:13,643 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 142 DAG size of output 67 [2018-02-04 03:14:13,971 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 138 DAG size of output 66 [2018-02-04 03:14:14,561 WARN L146 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 139 DAG size of output 65 [2018-02-04 03:14:14,832 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 139 DAG size of output 75 [2018-02-04 03:14:15,375 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 122 DAG size of output 87 [2018-02-04 03:14:15,609 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 117 DAG size of output 88 [2018-02-04 03:14:15,852 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 120 DAG size of output 87 [2018-02-04 03:14:16,108 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 127 DAG size of output 93 [2018-02-04 03:14:16,346 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 123 DAG size of output 90 [2018-02-04 03:14:16,600 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 133 DAG size of output 92 [2018-02-04 03:14:17,071 WARN L146 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 177 DAG size of output 87 [2018-02-04 03:14:17,509 WARN L146 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 166 DAG size of output 79 [2018-02-04 03:14:17,890 WARN L146 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 147 DAG size of output 75 [2018-02-04 03:14:18,469 WARN L146 SmtUtils]: Spent 350ms on a formula simplification. DAG size of input: 167 DAG size of output 59 [2018-02-04 03:14:19,076 WARN L146 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 175 DAG size of output 60 [2018-02-04 03:14:19,543 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 130 DAG size of output 58 [2018-02-04 03:14:20,134 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 151 DAG size of output 42 [2018-02-04 03:14:20,824 WARN L146 SmtUtils]: Spent 309ms on a formula simplification. DAG size of input: 180 DAG size of output 44 [2018-02-04 03:14:21,584 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 120 DAG size of output 39 [2018-02-04 03:14:22,027 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 102 DAG size of output 30 [2018-02-04 03:14:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 42 proven. 110 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 03:14:23,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:23,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 03:14:23,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:23,200 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:14:23,201 INFO L182 omatonBuilderFactory]: Interpolants [12224#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 12225#(= |#valid| |old(#valid)|), 12226#(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|)), 12227#(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)), 12228#(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)), 12229#(and (= 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)) (not (= 0 entry_point_~array~0.base))), 12230#(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)|)))))), 12231#(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|)), 12232#(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|)), 12233#(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))), 12234#(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))), 12235#(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)))))), 12236#(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)), 12237#(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)), 12238#(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|))), 12239#(and (or (<= (* 4 entry_point_~i~0) 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_#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)) (<= entry_point_~i~0 1) (= 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)))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 12240#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (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))) (= 1 (select |#valid| entry_point_~p~0.base)) (= 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)))) (<= 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)))) (<= (* 4 entry_point_~i~0) 0))), 12241#(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 (= (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) 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)|) (= 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)) (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))), 12242#(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 entry_point_~i~0) (- 4))))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 (select |old(#valid)| (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) (- 4))))) (= (select |#valid| entry_point_~array~0.base) 1) (= |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))) (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) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 12243#(and (= entry_point_~array~0.offset 0) (or (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))))) (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)) (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)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (and (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (= 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)) (<= (* 4 entry_point_~i~0) 8)), 12244#(and (= entry_point_~array~0.offset 0) (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)) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) |old(#valid)|) (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) (+ (* 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) 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)) (= (select |old(#valid)| 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))) (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))) (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)) (<= (* 4 entry_point_~i~0) 8)), 12245#(and (or (<= (* 4 entry_point_~i~0) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (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)) (= 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))) (= (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) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select |old(#valid)| 0) (select |#valid| 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))))) (= 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 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)), 12246#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= entry_point_~i~0 3) (= 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))))))) (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))) (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))))))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (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))) (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 (= (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))), 12247#(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)), 12248#(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|))), 12249#(and (or (and (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))))))) (<= (* 4 entry_point_~i~0) 12) (= (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_~i~0 (- 1))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (or (= entry_point_~array~0.base |entry_point_#t~ret4.base|) (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 (- 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)) (not (= entry_point_~array~0.base (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) (- 8))) |entry_point_#t~ret4.base|) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|) (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)| |entry_point_#t~ret4.base|)) (= 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) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|))))) (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))))) (not (= 0 |entry_point_#t~ret4.base|))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 11)) (= entry_point_~array~0.offset 0)), 12250#(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))))) (<= 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) (+ 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))))))) (or (= entry_point_~array~0.base 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) (- 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))) (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 (= 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))))))) (= (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) (+ (* 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))))) (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)|)) (= (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 (= 0 entry_point_~p~0.base))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 11)) (= entry_point_~array~0.offset 0)), 12251#(and (or (and (<= entry_point_~i~0 3) (or (= 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))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 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 (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))) (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))))))) (= (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) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (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) (- 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))) (= (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)| 0) (select |#valid| 0)) (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) entry_point_~array~0.offset) 11)) (= entry_point_~array~0.offset 0)), 12252#(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) (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 (- 1)))))) (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)) (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))))) (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))))))) (= 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)) (= (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) (+ (* 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) 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)|)) (= (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) 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) (+ (* 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))))))) (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)), 12253#(and (or (<= (* 4 entry_point_~j~0) 11) (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 (= (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))))) (= (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 (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 (= (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) (+ (* 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) 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)|) (= 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)| (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))))))) (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_~array~0.base (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))))) (= entry_point_~array~0.offset 0)), 12254#(and (= entry_point_~array~0.offset 0) (or (and (or (and (= entry_point_~array~0.base |entry_point_#t~mem7.base|) (= (select |old(#valid)| 0) (select |#valid| 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))))) (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 (= 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)) (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))))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) (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) 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)) (= 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)))) (= (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))) (= |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_~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))))) (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))))))) (not (= 0 |entry_point_#t~mem7.base|))) (<= (* 4 entry_point_~j~0) 11))), 12255#(and (<= (* 4 entry_point_~j~0) 12) (= 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) (- 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))))))) (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) (- 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))))) (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)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))) 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))))) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset (- 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) 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)) (= 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))))))))) (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)))))))))) (<= (* 4 entry_point_~j~0) 11))), 12256#(and (or (<= (* 4 entry_point_~j~0) 7) (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| 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 (= (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)))) (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)) (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) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= (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) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= entry_point_~array~0.base (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 (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_~array~0.offset 0)), 12257#(and (or (and (<= entry_point_~j~0 2) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (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)) (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)| (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 |#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_#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|)) (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)), 12258#(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 (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))) (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))) (= |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))))) (= (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)), 12259#(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 1) (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))))) (not (= entry_point_~array~0.base 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 (= 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)|))) (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))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 12260#(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|))))), 12261#(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))))), 12262#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= 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) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 12263#(and (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (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)), 12264#(and (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (= 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))), 12265#(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))), 12266#(or (= (select |old(#valid)| 0) 1) (= (select |old(#valid)| (@diff |#valid| |old(#valid)|)) (select |#valid| (@diff |#valid| |old(#valid)|)))), 12221#true, 12222#false, 12223#(= 0 (select |#valid| 0))] [2018-02-04 03:14:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 42 proven. 110 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 03:14:23,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 03:14:23,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 03:14:23,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1805, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:14:23,201 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 46 states. [2018-02-04 03:14:24,508 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 98 DAG size of output 92 [2018-02-04 03:14:25,140 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 137 DAG size of output 129 [2018-02-04 03:14:25,498 WARN L143 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 150 [2018-02-04 03:14:26,014 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 175 DAG size of output 164 [2018-02-04 03:14:26,350 WARN L146 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 134 DAG size of output 118 [2018-02-04 03:14:26,584 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 109 DAG size of output 104 [2018-02-04 03:14:27,000 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 103 DAG size of output 98 [2018-02-04 03:14:27,259 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 114 DAG size of output 108 [2018-02-04 03:14:27,440 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 90 DAG size of output 86 [2018-02-04 03:14:27,729 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 84 DAG size of output 84 [2018-02-04 03:14:27,916 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-02-04 03:14:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:28,991 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-02-04 03:14:28,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 03:14:28,991 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 108 [2018-02-04 03:14:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:28,992 INFO L225 Difference]: With dead ends: 142 [2018-02-04 03:14:28,992 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 03:14:28,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=885, Invalid=6255, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 03:14:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 03:14:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 03:14:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 03:14:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2018-02-04 03:14:28,995 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 108 [2018-02-04 03:14:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:28,995 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2018-02-04 03:14:28,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 03:14:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2018-02-04 03:14:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 03:14:28,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:28,996 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:14:28,996 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:14:28,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1238084774, now seen corresponding path program 7 times [2018-02-04 03:14:28,997 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:29,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-02-04 03:14:29,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:29,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:14:29,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-02-04 03:14:29,060 INFO L182 omatonBuilderFactory]: Interpolants [12596#true, 12597#false, 12598#(<= 10 entry_point_~len~0), 12599#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 12600#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 12601#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 12602#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 12603#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 12604#(<= (+ entry_point_~i~0 5) entry_point_~len~0), 12605#(<= (+ entry_point_~i~0 4) entry_point_~len~0), 12606#(<= (+ entry_point_~i~0 3) entry_point_~len~0)] [2018-02-04 03:14:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-02-04 03:14:29,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:14:29,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:14:29,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:14:29,061 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 11 states. [2018-02-04 03:14:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:29,143 INFO L93 Difference]: Finished difference Result 235 states and 256 transitions. [2018-02-04 03:14:29,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:14:29,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-02-04 03:14:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:29,144 INFO L225 Difference]: With dead ends: 235 [2018-02-04 03:14:29,144 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 03:14:29,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:14:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 03:14:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 116. [2018-02-04 03:14:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:14:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-04 03:14:29,147 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 112 [2018-02-04 03:14:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:29,147 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-04 03:14:29,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:14:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-04 03:14:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 03:14:29,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:29,149 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:14:29,149 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:14:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2136330226, now seen corresponding path program 7 times [2018-02-04 03:14:29,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:29,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:29,376 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:14:29,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:29,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:14:29,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:29,376 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:14:29,376 INFO L182 omatonBuilderFactory]: Interpolants [12972#true, 12973#false, 12974#(= 1 (select |#valid| entry_point_~array~0.base)), 12975#(= |#valid| |old(#valid)|), 12976#(= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0), 12977#(= (select |old(#valid)| |ldv_malloc_#res.base|) 0), 12978#(not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)), 12979#(not (= entry_point_~array~0.base entry_point_~p~0.base)), 12980#(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)))), 12981#(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)))), 12982#(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)))), 12983#(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)))), 12984#(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)))), 12985#(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)))), 12986#(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)))), 12987#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))] [2018-02-04 03:14:29,377 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:14:29,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:14:29,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:14:29,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:14:29,377 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 16 states. [2018-02-04 03:14:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:29,812 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-02-04 03:14:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:14:29,812 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2018-02-04 03:14:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:29,813 INFO L225 Difference]: With dead ends: 118 [2018-02-04 03:14:29,813 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 03:14:29,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:14:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 03:14:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-02-04 03:14:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:14:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2018-02-04 03:14:29,815 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 112 [2018-02-04 03:14:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:29,815 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2018-02-04 03:14:29,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:14:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2018-02-04 03:14:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 03:14:29,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:29,816 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:14:29,816 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:14:29,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1801727536, now seen corresponding path program 6 times [2018-02-04 03:14:29,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:29,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:14:30,311 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:14:30,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:30,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:14:30,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:30,312 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:14:30,312 INFO L182 omatonBuilderFactory]: Interpolants [13280#(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))))), 13281#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 13282#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 13283#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12)))) (= entry_point_~array~0.offset 0)), 13284#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 16))))), 13285#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 12)))) (= entry_point_~array~0.offset 0)), 13286#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))) (= entry_point_~array~0.offset 0)), 13287#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 13288#(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))))), 13289#(= |entry_point_#t~mem7.offset| 0), 13270#true, 13271#false, 13272#(= 0 |ldv_malloc_#t~malloc1.offset|), 13273#(= 0 |ldv_malloc_#res.offset|), 13274#(= 0 |entry_point_#t~ret2.offset|), 13275#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 13276#(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))))), 13277#(= entry_point_~array~0.offset 0), 13278#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 13279#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset))] [2018-02-04 03:14:30,312 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:14:30,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:14:30,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:14:30,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:14:30,313 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand 20 states. [2018-02-04 03:14:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:30,977 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-02-04 03:14:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:14:30,977 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-02-04 03:14:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:30,977 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:14:30,978 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:14:30,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=364, Invalid=1798, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:14:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:14:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-04 03:14:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:14:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-02-04 03:14:30,979 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 113 [2018-02-04 03:14:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:30,980 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-02-04 03:14:30,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:14:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-02-04 03:14:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 03:14:30,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:30,980 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:14:30,980 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:14:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1801727535, now seen corresponding path program 6 times [2018-02-04 03:14:30,981 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:30,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:32,770 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:14:32,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:32,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 03:14:32,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:32,770 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:14:32,771 INFO L182 omatonBuilderFactory]: Interpolants [13581#true, 13582#false, 13583#(= 0 (select |#valid| 0)), 13584#(= (select |old(#valid)| 0) (select |#valid| 0)), 13585#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 13586#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 13587#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |#valid| 0))), 13588#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 13589#(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)))), 13590#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 13591#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 13592#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 13593#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 13594#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 13595#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 13596#(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)), 13597#(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)))))), 13598#(= |#valid| |old(#valid)|), 13599#(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)), 13600#(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|))))), 13601#(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|))), 13602#(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))), 13603#(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))))), 13604#(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)))))), 13605#(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|))), 13606#(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)), 13607#(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)))))), 13608#(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))))), 13609#(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|))), 13610#(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))))), 13611#(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))))), 13612#(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))))), 13613#(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))))), 13614#(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))))), 13615#(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))))), 13616#(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)))))), 13617#(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|))), 13618#(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)), 13619#(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)))))), 13620#(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)))))), 13621#(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)))))), 13622#(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)), 13623#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 03:14:32,771 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:14:32,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 03:14:32,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 03:14:32,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:14:32,771 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 43 states. [2018-02-04 03:14:35,179 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 137 DAG size of output 111 [2018-02-04 03:14:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:35,978 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-02-04 03:14:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 03:14:35,978 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-02-04 03:14:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:35,979 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:14:35,979 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:14:35,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=822, Invalid=6660, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 03:14:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:14:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-04 03:14:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:14:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2018-02-04 03:14:35,982 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 113 [2018-02-04 03:14:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:35,982 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2018-02-04 03:14:35,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 03:14:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-02-04 03:14:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:14:35,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:35,983 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:14:35,983 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:14:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash 502272691, now seen corresponding path program 6 times [2018-02-04 03:14:35,984 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:35,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:36,188 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:14:36,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:36,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:14:36,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:36,188 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:14:36,189 INFO L182 omatonBuilderFactory]: Interpolants [13952#(= 0 |ldv_malloc_#res.offset|), 13953#(= 0 |entry_point_#t~ret2.offset|), 13954#(= entry_point_~array~0.offset 0), 13955#(and (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 13956#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 13957#(and (<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 13958#(and (<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 13959#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 13960#(and (= entry_point_~array~0.offset 0) (<= 20 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 13961#(and (<= 16 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 13962#(and (<= 12 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 13963#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 13964#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 13965#(<= 1 entry_point_~j~0), 13966#(<= 0 entry_point_~j~0), 13949#true, 13950#false, 13951#(= 0 |ldv_malloc_#t~malloc1.offset|)] [2018-02-04 03:14:36,189 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:14:36,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:14:36,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:14:36,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:14:36,189 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand 18 states. [2018-02-04 03:14:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:36,353 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 03:14:36,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:14:36,353 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2018-02-04 03:14:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:36,354 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:14:36,354 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 03:14:36,354 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:14:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 03:14:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 03:14:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 03:14:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2018-02-04 03:14:36,356 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 118 [2018-02-04 03:14:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:36,357 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2018-02-04 03:14:36,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:14:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2018-02-04 03:14:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:14:36,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:36,357 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:14:36,358 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:14:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash 502272740, now seen corresponding path program 8 times [2018-02-04 03:14:36,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:36,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:36,975 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:14:36,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:36,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:14:36,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:36,975 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:14:36,975 INFO L182 omatonBuilderFactory]: Interpolants [14221#true, 14222#false, 14223#(= 0 |ldv_malloc_#t~malloc1.offset|), 14224#(= 0 |ldv_malloc_#res.offset|), 14225#(= 0 |entry_point_#t~ret2.offset|), 14226#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 14227#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 14228#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 14229#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 14230#(= |#valid| |old(#valid)|), 14231#(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))))), 14232#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 14233#(or (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|)), 14234#(and (or (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 0)) (= entry_point_~array~0.offset 0)), 14235#(and (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base entry_point_~p~0.base)) (<= entry_point_~i~0 0))), 14236#(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))))))), 14237#(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)), 14238#(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)), 14239#(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))))))), 14240#(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))))))), 14241#(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))), 14242#(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)), 14243#(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)), 14244#(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)), 14245#(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|)))), 14246#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 14247#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 14248#(= (select |#valid| entry_point_~array~0.base) 1)] [2018-02-04 03:14:36,975 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:14:36,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:14:36,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:14:36,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:14:36,976 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 28 states. [2018-02-04 03:14:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:38,015 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-04 03:14:38,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:14:38,015 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2018-02-04 03:14:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:38,016 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:14:38,016 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:14:38,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=511, Invalid=2569, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:14:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:14:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-02-04 03:14:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:14:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2018-02-04 03:14:38,019 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 118 [2018-02-04 03:14:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:38,019 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2018-02-04 03:14:38,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:14:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2018-02-04 03:14:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:14:38,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:38,020 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:14:38,020 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:14:38,021 INFO L82 PathProgramCache]: Analyzing trace with hash 502272741, now seen corresponding path program 6 times [2018-02-04 03:14:38,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:38,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:38,145 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:14:38,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:38,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:14:38,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:38,146 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:14:38,146 INFO L182 omatonBuilderFactory]: Interpolants [14560#(<= 16 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 14561#(<= 12 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 14562#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 14563#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 14564#(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))), 14565#(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))), 14552#true, 14553#false, 14554#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14555#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14556#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14557#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14558#(<= 16 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 14559#(<= 20 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))] [2018-02-04 03:14:38,146 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:14:38,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:14:38,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:14:38,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:14:38,147 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 14 states. [2018-02-04 03:14:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:38,302 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-02-04 03:14:38,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:14:38,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 118 [2018-02-04 03:14:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:38,303 INFO L225 Difference]: With dead ends: 127 [2018-02-04 03:14:38,303 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:14:38,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:14:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:14:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-04 03:14:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:14:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-02-04 03:14:38,304 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 118 [2018-02-04 03:14:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:38,304 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-02-04 03:14:38,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:14:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-02-04 03:14:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 03:14:38,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:38,305 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:14:38,305 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:14:38,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1609414214, now seen corresponding path program 7 times [2018-02-04 03:14:38,306 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:38,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:38,775 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:14:38,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:38,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:14:38,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:38,776 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:14:38,776 INFO L182 omatonBuilderFactory]: Interpolants [14848#(= |entry_point_#t~mem7.offset| 0), 14827#true, 14828#false, 14829#(= 0 |ldv_malloc_#t~malloc1.offset|), 14830#(= 0 |ldv_malloc_#res.offset|), 14831#(= 0 |entry_point_#t~ret2.offset|), 14832#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 14833#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 14834#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 14835#(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))))), 14836#(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)), 14837#(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)), 14838#(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)), 14839#(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))), 14840#(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))), 14841#(and (<= entry_point_~i~0 4) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 14842#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 5)), 14843#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~j~0 4)), 14844#(and (<= entry_point_~j~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 14845#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 14846#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 14847#(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)))))] [2018-02-04 03:14:38,776 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:14:38,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:14:38,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:14:38,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:14:38,776 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 22 states. [2018-02-04 03:14:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:39,078 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2018-02-04 03:14:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:14:39,079 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 119 [2018-02-04 03:14:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:39,079 INFO L225 Difference]: With dead ends: 165 [2018-02-04 03:14:39,079 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 03:14:39,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:14:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 03:14:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2018-02-04 03:14:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 03:14:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2018-02-04 03:14:39,082 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 119 [2018-02-04 03:14:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:39,082 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2018-02-04 03:14:39,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:14:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2018-02-04 03:14:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 03:14:39,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:39,083 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:14:39,083 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:14:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1609414213, now seen corresponding path program 7 times [2018-02-04 03:14:39,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:39,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:42,425 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:14:42,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:42,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 03:14:42,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:42,425 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:14:42,426 INFO L182 omatonBuilderFactory]: Interpolants [15232#(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))))))) (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|)) (<= 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 (- 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))), 15233#(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))), 15234#(and (or (<= (* 4 entry_point_~j~0) 11) (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) (- 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) 12) (= entry_point_~array~0.offset 0)), 15235#(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)), 15236#(and (<= (* 4 entry_point_~j~0) 12) (= 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) (- 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)))) (<= (* 4 entry_point_~j~0) 11))), 15237#(and (<= (* 4 entry_point_~j~0) 8) (or (and (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)) (= entry_point_~array~0.offset 0)), 15238#(and (<= (* 4 entry_point_~j~0) 8) (= 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) 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))), 15239#(and (<= (* 4 entry_point_~j~0) 8) (or (and (= 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)), 15240#(and (<= entry_point_~j~0 1) (= 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))))) (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)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3))), 15241#(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)), 15242#(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)), 15243#(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)), 15244#(= 1 (select |#valid| |entry_point_#t~mem7.base|)), 15196#true, 15197#false, 15198#(= 0 |ldv_malloc_#t~malloc1.offset|), 15199#(= 0 |ldv_malloc_#res.offset|), 15200#(= 0 |entry_point_#t~ret2.offset|), 15201#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 15202#(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))))), 15203#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 15204#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 15205#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| |entry_point_#t~ret4.base|) 1)), 15206#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 15207#(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)), 15208#(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)))), 15209#(= |#valid| |old(#valid)|), 15210#(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|)), 15211#(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|))))), 15212#(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|))), 15213#(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))), 15214#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) 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))))) (<= 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) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 15215#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~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_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 8)), 15216#(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|))))), 15217#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~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_~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|)) (<= (* 4 entry_point_~i~0) 8) (not (= 0 |entry_point_#t~ret4.base|))), 15218#(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)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~0) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (<= (* 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) (- 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)))))), 15219#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 2) entry_point_~i~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) 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))))) (= entry_point_~array~0.offset 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_~i~0) entry_point_~array~0.offset)))) (<= (* 4 entry_point_~i~0) 8)), 15220#(and (<= (* 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) (- 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))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))), 15221#(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|)), 15222#(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|))))), 15223#(and (<= (* 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) (- 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)))) (= entry_point_~array~0.offset 0) (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))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~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|))), 15224#(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)) (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)))) (<= (* 4 entry_point_~i~0) 12) (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)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~0)), 15225#(and (<= (* 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) (- 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))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~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)), 15226#(and (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)))) (<= (* 4 entry_point_~i~0) 16) (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))))))) (= (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))))) (= entry_point_~array~0.offset 0)), 15227#(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|))))), 15228#(and (<= (* 4 entry_point_~i~0) 16) (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~i~0) 15) (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) (+ 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)))))))), 15229#(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)))) (<= (* 4 entry_point_~i~0) 16) (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 (= (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) entry_point_~array~0.offset) 15)) (= entry_point_~array~0.offset 0)), 15230#(and (<= (* 4 entry_point_~i~0) 20) (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~i~0) 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))) (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)))))))))), 15231#(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))))))) (= 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)))) (<= 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) 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)) (= entry_point_~array~0.offset 0))] [2018-02-04 03:14:42,426 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:14:42,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 03:14:42,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 03:14:42,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2093, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 03:14:42,427 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 49 states. [2018-02-04 03:14:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:44,241 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2018-02-04 03:14:44,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 03:14:44,242 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 119 [2018-02-04 03:14:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:44,242 INFO L225 Difference]: With dead ends: 164 [2018-02-04 03:14:44,242 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 03:14:44,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=536, Invalid=4156, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 03:14:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 03:14:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2018-02-04 03:14:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 03:14:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2018-02-04 03:14:44,245 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 119 [2018-02-04 03:14:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:44,245 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2018-02-04 03:14:44,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 03:14:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2018-02-04 03:14:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 03:14:44,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:44,245 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:14:44,246 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:14:44,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1842060461, now seen corresponding path program 8 times [2018-02-04 03:14:44,246 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:44,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:14:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-02-04 03:14:44,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:44,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:14:44,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-02-04 03:14:44,321 INFO L182 omatonBuilderFactory]: Interpolants [15616#(<= (+ entry_point_~i~0 4) entry_point_~len~0), 15617#(<= (+ entry_point_~i~0 3) entry_point_~len~0), 15618#(<= (+ entry_point_~i~0 2) entry_point_~len~0), 15607#true, 15608#false, 15609#(<= 10 entry_point_~len~0), 15610#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 15611#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 15612#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 15613#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 15614#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 15615#(<= (+ entry_point_~i~0 5) entry_point_~len~0)] [2018-02-04 03:14:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-02-04 03:14:44,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:14:44,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:14:44,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:14:44,321 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand 12 states. [2018-02-04 03:14:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:44,403 INFO L93 Difference]: Finished difference Result 308 states and 328 transitions. [2018-02-04 03:14:44,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:14:44,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2018-02-04 03:14:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:44,405 INFO L225 Difference]: With dead ends: 308 [2018-02-04 03:14:44,405 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 03:14:44,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:14:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 03:14:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 165. [2018-02-04 03:14:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:14:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2018-02-04 03:14:44,407 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 125 [2018-02-04 03:14:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:44,407 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2018-02-04 03:14:44,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:14:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2018-02-04 03:14:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 03:14:44,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:44,408 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:14:44,408 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:14:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1815739657, now seen corresponding path program 7 times [2018-02-04 03:14:44,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:44,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:44,995 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:14:44,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:44,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:14:44,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:44,995 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:14:44,995 INFO L182 omatonBuilderFactory]: Interpolants [16128#(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)))), 16129#(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)))), 16130#(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)))), 16131#(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))))), 16132#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 16133#(= 1 (select |#valid| entry_point_~array~0.base)), 16108#true, 16109#false, 16110#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 16111#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 16112#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 16113#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 16114#(= |#valid| |old(#valid)|), 16115#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 16116#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 16117#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 16118#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 16119#(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)))))), 16120#(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)))), 16121#(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)))), 16122#(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)))), 16123#(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)))), 16124#(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)))), 16125#(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)))), 16126#(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)))), 16127#(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))))] [2018-02-04 03:14:44,995 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:14:44,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:14:44,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:14:44,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:14:44,996 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand 26 states. [2018-02-04 03:14:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:45,748 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2018-02-04 03:14:45,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:14:45,748 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 124 [2018-02-04 03:14:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:45,749 INFO L225 Difference]: With dead ends: 171 [2018-02-04 03:14:45,749 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 03:14:45,749 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 03:14:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 03:14:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2018-02-04 03:14:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 03:14:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2018-02-04 03:14:45,751 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 124 [2018-02-04 03:14:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:45,751 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2018-02-04 03:14:45,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:14:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2018-02-04 03:14:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 03:14:45,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:45,751 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:14:45,751 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:14:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1815739707, now seen corresponding path program 7 times [2018-02-04 03:14:45,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:45,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:45,822 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:14:45,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:45,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:14:45,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:45,823 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:14:45,823 INFO L182 omatonBuilderFactory]: Interpolants [16512#(<= entry_point_~i~0 1), 16513#(<= entry_point_~i~0 2), 16514#(<= entry_point_~i~0 3), 16515#(<= entry_point_~i~0 4), 16516#(<= entry_point_~i~0 5), 16517#(<= entry_point_~j~0 4), 16518#(<= entry_point_~j~0 3), 16519#(<= entry_point_~j~0 2), 16520#(<= entry_point_~j~0 1), 16521#(<= entry_point_~j~0 0), 16522#(<= (+ entry_point_~j~0 1) 0), 16509#true, 16510#false, 16511#(= entry_point_~i~0 0)] [2018-02-04 03:14:45,823 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:14:45,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:14:45,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:14:45,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:14:45,823 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand 14 states. [2018-02-04 03:14:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:14:45,916 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2018-02-04 03:14:45,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:14:45,916 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-02-04 03:14:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:14:45,917 INFO L225 Difference]: With dead ends: 169 [2018-02-04 03:14:45,917 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 03:14:45,917 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:14:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 03:14:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-02-04 03:14:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:14:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 179 transitions. [2018-02-04 03:14:45,919 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 179 transitions. Word has length 124 [2018-02-04 03:14:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:14:45,919 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 179 transitions. [2018-02-04 03:14:45,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:14:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2018-02-04 03:14:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 03:14:45,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:14:45,919 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:14:45,919 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:14:45,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1882007769, now seen corresponding path program 6 times [2018-02-04 03:14:45,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:14:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:14:45,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:14:48,874 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 126 DAG size of output 70 [2018-02-04 03:14:49,087 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 123 DAG size of output 71 [2018-02-04 03:14:49,411 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 124 DAG size of output 71 [2018-02-04 03:14:49,598 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 115 DAG size of output 77 [2018-02-04 03:14:50,000 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-02-04 03:14:50,464 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 108 DAG size of output 87 [2018-02-04 03:14:51,050 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 144 DAG size of output 74 [2018-02-04 03:14:51,501 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 125 DAG size of output 70 [2018-02-04 03:14:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 35 proven. 202 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-02-04 03:14:53,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:14:53,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 03:14:53,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:14:53,706 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:14:53,707 INFO L182 omatonBuilderFactory]: Interpolants [16896#(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))) (= 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 (= 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 (= (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))) (= (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) 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))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) |old(#valid)|)) (<= 13 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= 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))))))) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 3) entry_point_~i~0) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 16897#(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) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (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)) (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) 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))))))) (= (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) 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))) |old(#valid)|)) (<= 13 (+ (* 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))))), 16898#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 15) (<= 17 (+ (* 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 (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))) (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 |#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) 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)))))) (= 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)))))))), 16899#(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)), 16900#(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|))), 16901#(and (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)))) (or (<= (+ (* 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 (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))))))) (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))) (= |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) 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)))) (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)))) (= (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|)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (not (= 0 |entry_point_#t~ret4.base|))), 16902#(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))))))) (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))))))) (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))) (= (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) 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))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) |old(#valid)|))) (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 16903#(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) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 15) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| 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) 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)))) (= 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))) (= (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))))) (<= 17 (+ (* 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 (= 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)))))))), 16904#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 3))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (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 (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))) (= |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 (- 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) 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)))) (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) (+ 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))))), 16905#(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)))) (= entry_point_~array~0.offset 0) (or (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)) (= (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) 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))) |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))) (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))))), 16906#(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)))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|)) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 15) (<= 17 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (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))) (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| |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) 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))) |old(#valid)|)) (= |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)))))))))), 16907#(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 (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 (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| (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) 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))) |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)))) (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))) (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)), 16908#(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 (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 11) (<= 13 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (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 (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))) (= (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) 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))) |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)))))))))), 16909#(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 (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))))))) (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 |#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) 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))) |old(#valid)|)) (= (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 (= 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|))), 16910#(and (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 (<= (+ (* 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) (<= 13 (+ (* 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 (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 |#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) 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))) |old(#valid)|)))), 16911#(and (not (= 0 (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) (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) 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))) |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)))), 16912#(and (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)) (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| |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) 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))) |old(#valid)|)) (<= 9 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 16913#(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))) (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))))) (<= 9 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16914#(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) 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)))), 16915#(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)|)))), 16916#(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)), 16917#(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))))), 16918#(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)), 16919#(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)), 16920#(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)))), 16921#(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)), 16869#true, 16870#false, 16871#(= |#valid| |old(#valid)|), 16872#(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|)), 16873#(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)), 16874#(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)), 16875#(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))), 16876#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 16877#(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|))), 16878#(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|))), 16879#(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|))), 16880#(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)) (= entry_point_~array~0.offset 0) (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))), 16881#(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)))), 16882#(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)), 16883#(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))))), 16884#(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|)), 16885#(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|)))), 16886#(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_#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 |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|))))), 16887#(and (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)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~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 (= 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)), 16888#(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))) (= (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) (+ 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)) (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)), 16889#(and (= entry_point_~array~0.offset 0) (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)) (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))))) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 16890#(and (= entry_point_~array~0.offset 0) (or (<= 9 (+ (* 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 (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)) (= (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) 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))) |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)))) (not (= 0 |entry_point_#t~ret4.base|))), 16891#(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))) (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 |#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) 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))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) |old(#valid)|) (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)))) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 16892#(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))) (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)) (= |old(#valid)| (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) 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_~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))))), 16893#(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))) (= 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))) (= 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))) (= |old(#valid)| (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) 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))))) (<= 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))))))) (= entry_point_~array~0.offset 0)), 16894#(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|))))), 16895#(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 (<= 13 (+ (* 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_#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))) (= (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) 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))) |old(#valid)|) (<= (+ (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))) (= 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 (= 0 |entry_point_#t~ret4.base|)))] [2018-02-04 03:14:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 35 proven. 202 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-02-04 03:14:53,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 03:14:53,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 03:14:53,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2581, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 03:14:53,708 INFO L87 Difference]: Start difference. First operand 165 states and 179 transitions. Second operand 53 states. [2018-02-04 03:14:55,844 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 128 DAG size of output 118 [2018-02-04 03:14:56,204 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 137 DAG size of output 96 [2018-02-04 03:14:56,400 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 98 DAG size of output 94 [2018-02-04 03:14:57,064 WARN L146 SmtUtils]: Spent 505ms on a formula simplification. DAG size of input: 154 DAG size of output 139 [2018-02-04 03:14:57,449 WARN L146 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 160 DAG size of output 128 [2018-02-04 03:14:57,798 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 124 DAG size of output 104 [2018-02-04 03:14:59,489 WARN L146 SmtUtils]: Spent 1443ms on a formula simplification. DAG size of input: 259 DAG size of output 209 [2018-02-04 03:15:03,111 WARN L146 SmtUtils]: Spent 3285ms on a formula simplification. DAG size of input: 294 DAG size of output 224 [2018-02-04 03:15:05,577 WARN L146 SmtUtils]: Spent 2198ms on a formula simplification. DAG size of input: 243 DAG size of output 191 [2018-02-04 03:15:06,630 WARN L146 SmtUtils]: Spent 874ms on a formula simplification. DAG size of input: 189 DAG size of output 159 [2018-02-04 03:15:07,020 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 132 DAG size of output 130 [2018-02-04 03:15:07,624 WARN L146 SmtUtils]: Spent 475ms on a formula simplification. DAG size of input: 163 DAG size of output 160 [2018-02-04 03:15:09,489 WARN L146 SmtUtils]: Spent 1578ms on a formula simplification. DAG size of input: 244 DAG size of output 202 [2018-02-04 03:15:10,337 WARN L146 SmtUtils]: Spent 634ms on a formula simplification. DAG size of input: 204 DAG size of output 170 [2018-02-04 03:15:10,829 WARN L146 SmtUtils]: Spent 311ms on a formula simplification. DAG size of input: 163 DAG size of output 147 [2018-02-04 03:15:11,563 WARN L146 SmtUtils]: Spent 562ms on a formula simplification. DAG size of input: 181 DAG size of output 159 [2018-02-04 03:15:12,350 WARN L146 SmtUtils]: Spent 658ms on a formula simplification. DAG size of input: 151 DAG size of output 131 [2018-02-04 03:15:12,699 WARN L146 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 124 DAG size of output 111 [2018-02-04 03:15:13,106 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 103 DAG size of output 103 [2018-02-04 03:15:13,310 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 90 DAG size of output 78 [2018-02-04 03:15:14,111 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 101 DAG size of output 86 [2018-02-04 03:15:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:14,574 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-02-04 03:15:14,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 03:15:14,575 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 127 [2018-02-04 03:15:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:14,575 INFO L225 Difference]: With dead ends: 185 [2018-02-04 03:15:14,575 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 03:15:14,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=742, Invalid=7090, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 03:15:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 03:15:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 135. [2018-02-04 03:15:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 03:15:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2018-02-04 03:15:14,577 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 127 [2018-02-04 03:15:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:14,577 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2018-02-04 03:15:14,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 03:15:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2018-02-04 03:15:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 03:15:14,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:14,578 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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:15:14,578 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:15:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash -608426387, now seen corresponding path program 8 times [2018-02-04 03:15:14,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:14,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 20 proven. 214 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:15:15,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:15:15,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:15:15,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-02-04 03:15:15,112 INFO L182 omatonBuilderFactory]: Interpolants [17314#true, 17315#false, 17316#(= 0 |ldv_malloc_#t~malloc1.offset|), 17317#(= 0 |ldv_malloc_#res.offset|), 17318#(= 0 |entry_point_#t~ret2.offset|), 17319#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 17320#(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))))), 17321#(= entry_point_~array~0.offset 0), 17322#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 17323#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 17324#(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))))), 17325#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 4)))))), 17326#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0)), 17327#(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) (- 12)))))), 17328#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16))))) (= entry_point_~array~0.offset 0)), 17329#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 20))))) (= entry_point_~array~0.offset 0)), 17330#(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) (- 16)))))), 17331#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 12))))) (= entry_point_~array~0.offset 0)), 17332#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 8)))))), 17333#(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) (- 4)))))), 17334#(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))))), 17335#(= |entry_point_#t~mem7.offset| 0)] [2018-02-04 03:15:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 20 proven. 214 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:15:15,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:15:15,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:15:15,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:15:15,113 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand 22 states. [2018-02-04 03:15:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:15,933 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-02-04 03:15:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:15:15,933 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 132 [2018-02-04 03:15:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:15,934 INFO L225 Difference]: With dead ends: 136 [2018-02-04 03:15:15,934 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 03:15:15,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=492, Invalid=2370, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 03:15:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 03:15:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-02-04 03:15:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 03:15:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2018-02-04 03:15:15,936 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 132 [2018-02-04 03:15:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:15,936 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2018-02-04 03:15:15,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:15:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2018-02-04 03:15:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 03:15:15,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:15,936 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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:15:15,936 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:15:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash -608426386, now seen corresponding path program 8 times [2018-02-04 03:15:15,937 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:15,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 03:15:16,891 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 03:15:16,894 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 03:15:16,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:15:16 BoogieIcfgContainer [2018-02-04 03:15:16,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:15:16,895 INFO L168 Benchmark]: Toolchain (without parser) took 178338.84 ms. Allocated memory was 394.3 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 351.1 MB in the beginning and 353.5 MB in the end (delta: -2.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-02-04 03:15:16,896 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 394.3 MB. Free memory is still 357.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:15:16,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.49 ms. Allocated memory is still 394.3 MB. Free memory was 351.1 MB in the beginning and 337.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:15:16,896 INFO L168 Benchmark]: Boogie Preprocessor took 24.00 ms. Allocated memory is still 394.3 MB. Free memory was 337.9 MB in the beginning and 336.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:15:16,896 INFO L168 Benchmark]: RCFGBuilder took 189.06 ms. Allocated memory is still 394.3 MB. Free memory was 336.6 MB in the beginning and 318.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:16,896 INFO L168 Benchmark]: TraceAbstraction took 177964.56 ms. Allocated memory was 394.3 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 317.3 MB in the beginning and 353.5 MB in the end (delta: -36.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-04 03:15:16,897 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.13 ms. Allocated memory is still 394.3 MB. Free memory is still 357.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.49 ms. Allocated memory is still 394.3 MB. Free memory was 351.1 MB in the beginning and 337.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 24.00 ms. Allocated memory is still 394.3 MB. Free memory was 337.9 MB in the beginning and 336.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 189.06 ms. Allocated memory is still 394.3 MB. Free memory was 336.6 MB in the beginning and 318.6 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 177964.56 ms. Allocated memory was 394.3 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 317.3 MB in the beginning and 353.5 MB in the end (delta: -36.3 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 analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 133 with TraceHistMax 8, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 177.9s OverallTime, 70 OverallIterations, 9 TraceHistogramMax, 59.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2758 SDtfs, 7045 SDslu, 20645 SDs, 0 SdLazy, 30861 SolverSat, 2166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2286 GetRequests, 297 SyntacticMatches, 154 SemanticMatches, 1835 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15255 ImplicationChecksByTransitivity, 85.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 3972/8189 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, 979 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 115.2s InterpolantComputationTime, 5220 NumberOfCodeBlocks, 5220 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 5151 ConstructedInterpolants, 0 QuantifiedInterpolants, 8721495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 7 PerfectInterpolantSequences, 3972/8189 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-15-16-902.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-15-16-902.csv Completed graceful shutdown