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-c17473d-m [2018-02-04 16:26:16,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:26:16,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:26:16,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:26:16,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:26:16,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:26:16,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:26:16,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:26:16,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:26:16,117 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:26:16,118 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:26:16,118 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:26:16,119 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:26:16,120 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:26:16,121 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:26:16,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:26:16,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:26:16,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:26:16,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:26:16,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:26:16,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:26:16,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:26:16,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:26:16,131 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:26:16,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:26:16,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:26:16,133 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:26:16,133 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:26:16,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:26:16,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:26:16,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:26:16,134 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 16:26:16,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:26:16,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:26:16,143 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:26:16,144 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:26:16,144 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:26:16,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:26:16,144 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:26:16,144 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:26:16,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:26:16,144 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:26:16,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:26:16,144 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:26:16,145 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:26:16,145 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:26:16,145 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:26:16,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:26:16,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:26:16,145 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:26:16,145 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:26:16,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:26:16,145 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:26:16,145 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:26:16,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:26:16,182 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:26:16,185 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:26:16,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:26:16,186 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:26:16,186 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 16:26:16,320 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:26:16,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:26:16,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:26:16,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:26:16,325 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:26:16,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286f8729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16, skipping insertion in model container [2018-02-04 16:26:16,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,338 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:26:16,373 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:26:16,464 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:26:16,479 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:26:16,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16 WrapperNode [2018-02-04 16:26:16,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:26:16,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:26:16,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:26:16,486 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:26:16,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (1/1) ... [2018-02-04 16:26:16,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:26:16,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:26:16,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:26:16,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:26:16,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (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 16:26:16,549 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:26:16,549 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:26:16,550 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 16:26:16,550 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 16:26:16,550 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:26:16,550 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 16:26:16,550 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 16:26:16,550 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:26:16,550 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:26:16,550 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:26:16,550 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 16:26:16,550 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 16:26:16,550 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 16:26:16,551 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 16:26:16,551 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 16:26:16,551 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:26:16,551 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:26:16,551 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:26:16,690 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:26:16,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:26:16 BoogieIcfgContainer [2018-02-04 16:26:16,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:26:16,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:26:16,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:26:16,693 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:26:16,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:26:16" (1/3) ... [2018-02-04 16:26:16,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452acfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:26:16, skipping insertion in model container [2018-02-04 16:26:16,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:26:16" (2/3) ... [2018-02-04 16:26:16,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452acfce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:26:16, skipping insertion in model container [2018-02-04 16:26:16,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:26:16" (3/3) ... [2018-02-04 16:26:16,695 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-04 16:26:16,700 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:26:16,705 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 16:26:16,732 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:26:16,732 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:26:16,732 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:26:16,732 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:26:16,732 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:26:16,733 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:26:16,733 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:26:16,733 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:26:16,733 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:26:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 16:26:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 16:26:16,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:16,751 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 16:26:16,751 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 16:26:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-02-04 16:26:16,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:16,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:16,892 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 16:26:16,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:26:16,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:26:16,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:16,897 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 16:26:16,897 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= |#valid| |old(#valid)|)] [2018-02-04 16:26:16,897 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 16:26:16,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:26:16,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:26:16,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:26:16,909 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 16:26:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:17,050 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 16:26:17,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:26:17,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 16:26:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:17,059 INFO L225 Difference]: With dead ends: 74 [2018-02-04 16:26:17,059 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 16:26:17,060 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 16:26:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 16:26:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-02-04 16:26:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 16:26:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 16:26:17,091 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-02-04 16:26:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:17,092 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 16:26:17,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:26:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 16:26:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 16:26:17,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:17,093 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 16:26:17,093 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 16:26:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-02-04 16:26:17,095 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:17,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:17,165 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 16:26:17,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:26:17,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:26:17,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:17,166 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 16:26:17,166 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 16:26:17,166 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 16:26:17,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:26:17,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:26:17,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:26:17,168 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-04 16:26:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:17,248 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-02-04 16:26:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:26:17,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 16:26:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:17,255 INFO L225 Difference]: With dead ends: 78 [2018-02-04 16:26:17,255 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 16:26:17,256 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 16:26:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 16:26:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-02-04 16:26:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 16:26:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 16:26:17,263 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-02-04 16:26:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:17,263 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 16:26:17,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:26:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 16:26:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 16:26:17,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:17,264 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 16:26:17,264 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 16:26:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-02-04 16:26:17,266 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:17,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:17,335 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 16:26:17,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:26:17,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:26:17,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:17,335 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 16:26:17,336 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 16:26:17,336 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 16:26:17,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:26:17,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:26:17,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:26:17,337 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-02-04 16:26:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:17,375 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-02-04 16:26:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:26:17,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 16:26:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:17,376 INFO L225 Difference]: With dead ends: 86 [2018-02-04 16:26:17,377 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 16:26:17,377 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 16:26:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 16:26:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-02-04 16:26:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 16:26:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-02-04 16:26:17,381 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-02-04 16:26:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:17,381 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-02-04 16:26:17,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:26:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-02-04 16:26:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 16:26:17,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:17,382 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 16:26:17,382 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 16:26:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-02-04 16:26:17,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:17,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:17,436 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 16:26:17,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:17,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:26:17,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:17,437 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 16:26:17,437 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 16:26:17,438 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 16:26:17,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:26:17,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:26:17,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:26:17,438 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-02-04 16:26:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:17,462 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 16:26:17,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:26:17,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 16:26:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:17,463 INFO L225 Difference]: With dead ends: 49 [2018-02-04 16:26:17,463 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 16:26:17,464 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 16:26:17,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 16:26:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 16:26:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 16:26:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 16:26:17,468 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-02-04 16:26:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:17,468 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 16:26:17,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:26:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 16:26:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 16:26:17,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:17,469 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 16:26:17,469 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 16:26:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-02-04 16:26:17,471 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:17,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:17,519 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 16:26:17,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:26:17,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:26:17,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:17,519 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 16:26:17,519 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 16:26:17,519 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 16:26:17,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:26:17,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:26:17,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:26:17,520 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-02-04 16:26:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:17,533 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-02-04 16:26:17,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:26:17,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 16:26:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:17,534 INFO L225 Difference]: With dead ends: 51 [2018-02-04 16:26:17,534 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 16:26:17,534 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 16:26:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 16:26:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-04 16:26:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 16:26:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 16:26:17,537 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-02-04 16:26:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:17,537 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 16:26:17,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:26:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 16:26:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 16:26:17,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:17,538 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 16:26:17,538 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 16:26:17,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-02-04 16:26:17,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:17,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:17,663 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 16:26:17,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:17,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:26:17,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:17,664 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 16:26:17,664 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 16:26:17,664 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 16:26:17,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:26:17,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:26:17,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:26:17,665 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 9 states. [2018-02-04 16:26:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:17,816 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-02-04 16:26:17,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:26:17,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-04 16:26:17,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:17,817 INFO L225 Difference]: With dead ends: 69 [2018-02-04 16:26:17,817 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 16:26:17,818 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 16:26:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 16:26:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-02-04 16:26:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 16:26:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 16:26:17,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2018-02-04 16:26:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:17,822 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 16:26:17,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:26:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 16:26:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 16:26:17,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:17,823 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 16:26:17,823 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 16:26:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-02-04 16:26:17,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:17,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:18,093 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 16:26:18,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:18,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:26:18,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:18,094 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 16:26:18,094 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 16:26:18,094 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 16:26:18,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:26:18,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:26:18,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:26:18,095 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 12 states. [2018-02-04 16:26:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:18,506 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-02-04 16:26:18,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:26:18,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-04 16:26:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:18,507 INFO L225 Difference]: With dead ends: 100 [2018-02-04 16:26:18,507 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 16:26:18,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-02-04 16:26:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 16:26:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-02-04 16:26:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 16:26:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-02-04 16:26:18,511 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 28 [2018-02-04 16:26:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:18,512 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-02-04 16:26:18,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:26:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-02-04 16:26:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 16:26:18,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:18,513 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 16:26:18,513 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 16:26:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1097237542, now seen corresponding path program 1 times [2018-02-04 16:26:18,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:18,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:18,544 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 16:26:18,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:26:18,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:26:18,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:18,545 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 16:26:18,545 INFO L182 omatonBuilderFactory]: Interpolants [1008#true, 1009#false, 1010#(= entry_point_~i~0 0), 1011#(<= (+ entry_point_~j~0 1) 0)] [2018-02-04 16:26:18,545 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 16:26:18,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:26:18,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:26:18,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:26:18,545 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2018-02-04 16:26:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:18,570 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 16:26:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:26:18,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 16:26:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:18,571 INFO L225 Difference]: With dead ends: 67 [2018-02-04 16:26:18,571 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 16:26:18,571 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 16:26:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 16:26:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-04 16:26:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 16:26:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-02-04 16:26:18,576 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29 [2018-02-04 16:26:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:18,576 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-02-04 16:26:18,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:26:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-02-04 16:26:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 16:26:18,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:18,577 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 16:26:18,577 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 16:26:18,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1190998490, now seen corresponding path program 1 times [2018-02-04 16:26:18,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:18,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:18,676 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 16:26:18,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:18,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:26:18,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:18,676 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 16:26:18,677 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 16:26:18,677 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 16:26:18,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:26:18,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:26:18,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:26:18,677 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 7 states. [2018-02-04 16:26:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:18,761 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-02-04 16:26:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:26:18,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 16:26:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:18,761 INFO L225 Difference]: With dead ends: 69 [2018-02-04 16:26:18,762 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 16:26:18,762 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 16:26:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 16:26:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 16:26:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 16:26:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 16:26:18,765 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2018-02-04 16:26:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:18,766 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 16:26:18,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:26:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 16:26:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 16:26:18,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:18,767 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 16:26:18,767 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 16:26:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1833910404, now seen corresponding path program 1 times [2018-02-04 16:26:18,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:18,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:18,827 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 16:26:18,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:26:18,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:26:18,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:18,827 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 16:26:18,827 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 16:26:18,828 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 16:26:18,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:26:18,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:26:18,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:26:18,828 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-04 16:26:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:18,855 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-04 16:26:18,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:26:18,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 16:26:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:18,855 INFO L225 Difference]: With dead ends: 58 [2018-02-04 16:26:18,856 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 16:26:18,856 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 16:26:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 16:26:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-04 16:26:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 16:26:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-04 16:26:18,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2018-02-04 16:26:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:18,859 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-04 16:26:18,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:26:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-04 16:26:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 16:26:18,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:18,860 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 16:26:18,860 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 16:26:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1409435322, now seen corresponding path program 1 times [2018-02-04 16:26:18,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:18,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:18,890 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 16:26:18,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:18,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:26:18,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:18,891 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 16:26:18,891 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 16:26:18,891 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 16:26:18,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:26:18,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:26:18,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:26:18,892 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 5 states. [2018-02-04 16:26:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:18,936 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-02-04 16:26:18,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:26:18,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 16:26:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:18,937 INFO L225 Difference]: With dead ends: 87 [2018-02-04 16:26:18,937 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 16:26:18,937 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 16:26:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 16:26:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2018-02-04 16:26:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 16:26:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-02-04 16:26:18,940 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34 [2018-02-04 16:26:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:18,940 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-02-04 16:26:18,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:26:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-02-04 16:26:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 16:26:18,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:18,941 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 16:26:18,941 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 16:26:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash 804244387, now seen corresponding path program 1 times [2018-02-04 16:26:18,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:18,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:19,210 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 16:26:19,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:19,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:26:19,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:19,210 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 16:26:19,211 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 16:26:19,211 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 16:26:19,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:26:19,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:26:19,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:26:19,211 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 14 states. [2018-02-04 16:26:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:19,549 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-02-04 16:26:19,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:26:19,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-04 16:26:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:19,551 INFO L225 Difference]: With dead ends: 86 [2018-02-04 16:26:19,551 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 16:26:19,551 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 16:26:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 16:26:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-02-04 16:26:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 16:26:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-02-04 16:26:19,554 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 41 [2018-02-04 16:26:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:19,555 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-02-04 16:26:19,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:26:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-02-04 16:26:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 16:26:19,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:19,555 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 16:26:19,556 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 16:26:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash 835021389, now seen corresponding path program 1 times [2018-02-04 16:26:19,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:19,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:19,613 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 16:26:19,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:26:19,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:26:19,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:19,615 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 16:26:19,615 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 16:26:19,615 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 16:26:19,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:26:19,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:26:19,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:26:19,616 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 6 states. [2018-02-04 16:26:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:19,702 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-02-04 16:26:19,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:26:19,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 16:26:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:19,703 INFO L225 Difference]: With dead ends: 80 [2018-02-04 16:26:19,703 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 16:26:19,704 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 16:26:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 16:26:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 16:26:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 16:26:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-02-04 16:26:19,707 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 42 [2018-02-04 16:26:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:19,707 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-02-04 16:26:19,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:26:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-02-04 16:26:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 16:26:19,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:19,709 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 16:26:19,709 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 16:26:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash 115859282, now seen corresponding path program 1 times [2018-02-04 16:26:19,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:19,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:19,910 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 16:26:19,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:19,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:26:19,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:19,911 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 16:26:19,911 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 16:26:19,911 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 16:26:19,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:26:19,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:26:19,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:26:19,912 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 12 states. [2018-02-04 16:26:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:20,076 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-04 16:26:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:26:20,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-02-04 16:26:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:20,077 INFO L225 Difference]: With dead ends: 83 [2018-02-04 16:26:20,077 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 16:26:20,077 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 16:26:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 16:26:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2018-02-04 16:26:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 16:26:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-02-04 16:26:20,080 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 43 [2018-02-04 16:26:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:20,081 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-02-04 16:26:20,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:26:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-02-04 16:26:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 16:26:20,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:20,081 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 16:26:20,081 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 16:26:20,081 INFO L82 PathProgramCache]: Analyzing trace with hash 115859283, now seen corresponding path program 1 times [2018-02-04 16:26:20,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:20,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:20,315 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 16:26:20,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:20,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:26:20,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:20,316 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 16:26:20,317 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 16:26:20,317 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 16:26:20,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:26:20,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:26:20,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:26:20,317 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 15 states. [2018-02-04 16:26:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:20,553 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-02-04 16:26:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:26:20,554 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-02-04 16:26:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:20,554 INFO L225 Difference]: With dead ends: 78 [2018-02-04 16:26:20,554 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 16:26:20,555 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 16:26:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 16:26:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 16:26:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 16:26:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2018-02-04 16:26:20,557 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 43 [2018-02-04 16:26:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:20,558 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2018-02-04 16:26:20,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:26:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2018-02-04 16:26:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 16:26:20,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:20,558 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 16:26:20,559 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 16:26:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash -329856377, now seen corresponding path program 1 times [2018-02-04 16:26:20,559 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:20,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:20,595 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 16:26:20,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:20,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:26:20,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:20,596 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 16:26:20,596 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 16:26:20,596 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 16:26:20,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:26:20,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:26:20,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:26:20,597 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 5 states. [2018-02-04 16:26:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:20,631 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-02-04 16:26:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:26:20,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-04 16:26:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:20,632 INFO L225 Difference]: With dead ends: 76 [2018-02-04 16:26:20,632 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 16:26:20,633 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 16:26:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 16:26:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 16:26:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 16:26:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-02-04 16:26:20,635 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 45 [2018-02-04 16:26:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:20,636 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-02-04 16:26:20,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:26:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-02-04 16:26:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 16:26:20,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:20,637 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 16:26:20,637 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 16:26:20,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1632885427, now seen corresponding path program 2 times [2018-02-04 16:26:20,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:20,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:20,693 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 16:26:20,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:20,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:26:20,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:20,694 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 16:26:20,694 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 16:26:20,695 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 16:26:20,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:26:20,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:26:20,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:26:20,695 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2018-02-04 16:26:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:20,747 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-02-04 16:26:20,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:26:20,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-04 16:26:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:20,748 INFO L225 Difference]: With dead ends: 112 [2018-02-04 16:26:20,748 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 16:26:20,749 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 16:26:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 16:26:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2018-02-04 16:26:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 16:26:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-02-04 16:26:20,752 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 47 [2018-02-04 16:26:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:20,752 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-02-04 16:26:20,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:26:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-02-04 16:26:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 16:26:20,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:20,753 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 16:26:20,753 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 16:26:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576177, now seen corresponding path program 1 times [2018-02-04 16:26:20,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:20,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:21,011 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 16:26:21,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:21,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:26:21,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:21,012 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 16:26:21,013 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 16:26:21,013 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 16:26:21,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:26:21,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:26:21,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:26:21,014 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 18 states. [2018-02-04 16:26:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:21,423 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-02-04 16:26:21,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:26:21,423 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 16:26:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:21,424 INFO L225 Difference]: With dead ends: 95 [2018-02-04 16:26:21,424 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 16:26:21,424 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 16:26:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 16:26:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-02-04 16:26:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 16:26:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2018-02-04 16:26:21,426 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 48 [2018-02-04 16:26:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:21,426 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2018-02-04 16:26:21,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:26:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2018-02-04 16:26:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 16:26:21,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:21,426 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 16:26:21,426 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 16:26:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576226, now seen corresponding path program 1 times [2018-02-04 16:26:21,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:21,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:21,469 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 16:26:21,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:21,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:26:21,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:21,469 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 16:26:21,469 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 16:26:21,469 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 16:26:21,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:26:21,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:26:21,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:26:21,470 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand 6 states. [2018-02-04 16:26:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:21,494 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-04 16:26:21,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:26:21,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-02-04 16:26:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:21,495 INFO L225 Difference]: With dead ends: 87 [2018-02-04 16:26:21,495 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 16:26:21,495 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 16:26:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 16:26:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-02-04 16:26:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 16:26:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-04 16:26:21,497 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 48 [2018-02-04 16:26:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:21,497 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-04 16:26:21,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:26:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-04 16:26:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 16:26:21,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:21,497 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 16:26:21,497 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 16:26:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 255829617, now seen corresponding path program 1 times [2018-02-04 16:26:21,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:21,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:22,232 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 16:26:22,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:22,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:26:22,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:22,233 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 16:26:22,233 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 16:26:22,233 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 16:26:22,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:26:22,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:26:22,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:26:22,233 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 18 states. [2018-02-04 16:26:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:23,365 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-02-04 16:26:23,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:26:23,366 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-02-04 16:26:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:23,366 INFO L225 Difference]: With dead ends: 96 [2018-02-04 16:26:23,366 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 16:26:23,367 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 16:26:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 16:26:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-02-04 16:26:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 16:26:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 16:26:23,369 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 51 [2018-02-04 16:26:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:23,369 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 16:26:23,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:26:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 16:26:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 16:26:23,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:23,370 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 16:26:23,371 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 16:26:23,371 INFO L82 PathProgramCache]: Analyzing trace with hash 797091222, now seen corresponding path program 2 times [2018-02-04 16:26:23,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:23,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:23,643 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 16:26:23,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:23,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:26:23,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:23,643 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 16:26:23,644 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 16:26:23,644 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 16:26:23,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:26:23,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:26:23,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:26:23,644 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 16 states. [2018-02-04 16:26:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:24,050 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-02-04 16:26:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:26:24,050 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-02-04 16:26:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:24,050 INFO L225 Difference]: With dead ends: 70 [2018-02-04 16:26:24,051 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 16:26:24,051 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 16:26:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 16:26:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-02-04 16:26:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 16:26:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-04 16:26:24,053 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 54 [2018-02-04 16:26:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:24,053 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-04 16:26:24,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:26:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-04 16:26:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 16:26:24,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:24,054 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 16:26:24,054 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 16:26:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602309, now seen corresponding path program 2 times [2018-02-04 16:26:24,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:24,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:24,267 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 16:26:24,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:24,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:26:24,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:24,268 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 16:26:24,268 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 16:26:24,268 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 16:26:24,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:26:24,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:26:24,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:26:24,269 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 13 states. [2018-02-04 16:26:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:24,550 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-02-04 16:26:24,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:26:24,550 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-02-04 16:26:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:24,551 INFO L225 Difference]: With dead ends: 69 [2018-02-04 16:26:24,551 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 16:26:24,551 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 16:26:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 16:26:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-02-04 16:26:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 16:26:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-04 16:26:24,554 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 56 [2018-02-04 16:26:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:24,554 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-04 16:26:24,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:26:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-04 16:26:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 16:26:24,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:24,554 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 16:26:24,554 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 16:26:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602310, now seen corresponding path program 2 times [2018-02-04 16:26:24,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:24,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:24,770 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 16:26:24,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:24,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:26:24,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:24,771 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 16:26:24,771 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 16:26:24,771 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 16:26:24,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:26:24,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:26:24,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:26:24,772 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 16 states. [2018-02-04 16:26:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:25,023 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-02-04 16:26:25,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:26:25,023 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-04 16:26:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:25,024 INFO L225 Difference]: With dead ends: 70 [2018-02-04 16:26:25,024 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 16:26:25,024 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 16:26:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 16:26:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-02-04 16:26:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 16:26:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-02-04 16:26:25,026 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 56 [2018-02-04 16:26:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:25,026 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-02-04 16:26:25,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:26:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-02-04 16:26:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 16:26:25,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:25,027 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 16:26:25,027 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 16:26:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1244279398, now seen corresponding path program 3 times [2018-02-04 16:26:25,027 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:25,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:25,072 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 16:26:25,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:25,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:26:25,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:25,072 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 16:26:25,073 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 16:26:25,073 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 16:26:25,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:26:25,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:26:25,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:26:25,073 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 7 states. [2018-02-04 16:26:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:25,105 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-02-04 16:26:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:26:25,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-04 16:26:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:25,106 INFO L225 Difference]: With dead ends: 130 [2018-02-04 16:26:25,106 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 16:26:25,106 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 16:26:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 16:26:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 75. [2018-02-04 16:26:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 16:26:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 16:26:25,108 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 60 [2018-02-04 16:26:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:25,108 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 16:26:25,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:26:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 16:26:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 16:26:25,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:25,109 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 16:26:25,109 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 16:26:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691215, now seen corresponding path program 2 times [2018-02-04 16:26:25,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:25,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:25,322 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 16:26:25,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:25,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:26:25,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:25,322 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 16:26:25,322 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 16:26:25,323 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 16:26:25,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:26:25,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:26:25,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:26:25,323 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 18 states. [2018-02-04 16:26:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:25,572 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-02-04 16:26:25,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:26:25,573 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-02-04 16:26:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:25,573 INFO L225 Difference]: With dead ends: 82 [2018-02-04 16:26:25,573 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 16:26:25,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-02-04 16:26:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 16:26:25,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-02-04 16:26:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 16:26:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-02-04 16:26:25,575 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 61 [2018-02-04 16:26:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:25,575 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-02-04 16:26:25,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:26:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-02-04 16:26:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 16:26:25,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:25,576 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 16:26:25,576 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 16:26:25,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2045691216, now seen corresponding path program 1 times [2018-02-04 16:26:25,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:25,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:25,642 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 16:26:25,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:25,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:26:25,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:25,642 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 16:26:25,643 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 16:26:25,643 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 16:26:25,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:26:25,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:26:25,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:26:25,643 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 8 states. [2018-02-04 16:26:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:25,711 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-04 16:26:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:26:25,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-04 16:26:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:25,712 INFO L225 Difference]: With dead ends: 81 [2018-02-04 16:26:25,712 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 16:26:25,713 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 16:26:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 16:26:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-02-04 16:26:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 16:26:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-04 16:26:25,715 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 61 [2018-02-04 16:26:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:25,715 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-04 16:26:25,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:26:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-04 16:26:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 16:26:25,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:25,716 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 16:26:25,716 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 16:26:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081745, now seen corresponding path program 1 times [2018-02-04 16:26:25,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:25,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:26,046 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 16:26:26,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:26,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:26:26,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:26,046 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 16:26:26,047 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 16:26:26,047 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 16:26:26,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 16:26:26,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 16:26:26,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:26:26,047 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 15 states. [2018-02-04 16:26:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:26,320 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-04 16:26:26,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:26:26,320 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-04 16:26:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:26,320 INFO L225 Difference]: With dead ends: 101 [2018-02-04 16:26:26,320 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 16:26:26,321 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 16:26:26,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 16:26:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-02-04 16:26:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 16:26:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-02-04 16:26:26,322 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 62 [2018-02-04 16:26:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:26,322 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-02-04 16:26:26,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 16:26:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-02-04 16:26:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 16:26:26,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:26,323 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 16:26:26,323 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 16:26:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1008081744, now seen corresponding path program 1 times [2018-02-04 16:26:26,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:26,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:26,941 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 16:26:26,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:26,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:26:26,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:26,942 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 16:26:26,942 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 16:26:26,942 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 16:26:26,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:26:26,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:26:26,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:26:26,943 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 25 states. [2018-02-04 16:26:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:27,550 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-02-04 16:26:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:26:27,551 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-04 16:26:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:27,552 INFO L225 Difference]: With dead ends: 98 [2018-02-04 16:26:27,552 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 16:26:27,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 16:26:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 16:26:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-02-04 16:26:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 16:26:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-04 16:26:27,555 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 62 [2018-02-04 16:26:27,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:27,555 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-04 16:26:27,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:26:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-04 16:26:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 16:26:27,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:27,556 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 16:26:27,556 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 16:26:27,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2094664908, now seen corresponding path program 2 times [2018-02-04 16:26:27,557 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:27,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:28,013 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 16:26:28,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:28,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:26:28,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:28,013 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 16:26:28,013 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 16:26:28,013 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 16:26:28,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:26:28,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:26:28,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:26:28,014 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 22 states. [2018-02-04 16:26:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:28,963 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-02-04 16:26:28,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 16:26:28,963 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-04 16:26:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:28,964 INFO L225 Difference]: With dead ends: 109 [2018-02-04 16:26:28,964 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 16:26:28,964 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 16:26:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 16:26:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-02-04 16:26:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 16:26:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-02-04 16:26:28,966 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 67 [2018-02-04 16:26:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:28,966 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-02-04 16:26:28,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:26:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-02-04 16:26:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 16:26:28,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:28,966 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 16:26:28,967 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 16:26:28,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2094664859, now seen corresponding path program 3 times [2018-02-04 16:26:28,967 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:28,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:29,009 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 16:26:29,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:29,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:26:29,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:29,010 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 16:26:29,010 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 16:26:29,010 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 16:26:29,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:26:29,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:26:29,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:26:29,011 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 8 states. [2018-02-04 16:26:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:29,065 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-02-04 16:26:29,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:26:29,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-02-04 16:26:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:29,067 INFO L225 Difference]: With dead ends: 104 [2018-02-04 16:26:29,067 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 16:26:29,067 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 16:26:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 16:26:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-02-04 16:26:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 16:26:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-04 16:26:29,070 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 67 [2018-02-04 16:26:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:29,070 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-04 16:26:29,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:26:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-04 16:26:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 16:26:29,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:29,071 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 16:26:29,071 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 16:26:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash -582418738, now seen corresponding path program 2 times [2018-02-04 16:26:29,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:29,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:30,433 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 80 DAG size of output 49 [2018-02-04 16:26:31,997 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 16:26:31,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:31,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 16:26:31,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:31,998 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 16:26:31,999 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 16:26:31,999 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 16:26:31,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 16:26:31,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 16:26:32,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-04 16:26:32,000 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 29 states. [2018-02-04 16:26:33,244 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 94 DAG size of output 94 [2018-02-04 16:26:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:34,167 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-04 16:26:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 16:26:34,167 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2018-02-04 16:26:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:34,168 INFO L225 Difference]: With dead ends: 103 [2018-02-04 16:26:34,168 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 16:26:34,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 16:26:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 16:26:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 16:26:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 16:26:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 16:26:34,170 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 70 [2018-02-04 16:26:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:34,170 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 16:26:34,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 16:26:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 16:26:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 16:26:34,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:34,171 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 16:26:34,171 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 16:26:34,171 INFO L82 PathProgramCache]: Analyzing trace with hash 984429971, now seen corresponding path program 4 times [2018-02-04 16:26:34,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:34,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:34,207 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 16:26:34,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:34,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:26:34,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:34,208 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 16:26:34,208 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 16:26:34,208 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 16:26:34,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:26:34,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:26:34,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:26:34,209 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 8 states. [2018-02-04 16:26:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:34,271 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-02-04 16:26:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:26:34,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-02-04 16:26:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:34,272 INFO L225 Difference]: With dead ends: 158 [2018-02-04 16:26:34,272 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 16:26:34,272 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 16:26:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 16:26:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 89. [2018-02-04 16:26:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 16:26:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-02-04 16:26:34,275 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 73 [2018-02-04 16:26:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:34,276 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-02-04 16:26:34,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:26:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-02-04 16:26:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 16:26:34,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:34,277 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 16:26:34,277 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 16:26:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1615277924, now seen corresponding path program 2 times [2018-02-04 16:26:34,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:34,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:34,622 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 16:26:34,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:34,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:26:34,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:34,623 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 16:26:34,623 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 16:26:34,623 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 16:26:34,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:26:34,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:26:34,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:26:34,623 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 16 states. [2018-02-04 16:26:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:34,941 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-02-04 16:26:34,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:26:34,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-02-04 16:26:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:34,942 INFO L225 Difference]: With dead ends: 90 [2018-02-04 16:26:34,942 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 16:26:34,943 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 16:26:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 16:26:34,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-02-04 16:26:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 16:26:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-02-04 16:26:34,944 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 75 [2018-02-04 16:26:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:34,945 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-02-04 16:26:34,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:26:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-02-04 16:26:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 16:26:34,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:34,945 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 16:26:34,945 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 16:26:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1615277923, now seen corresponding path program 2 times [2018-02-04 16:26:34,946 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:34,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:35,516 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 16:26:35,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:35,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:26:35,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:35,517 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 16:26:35,517 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 16:26:35,517 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 16:26:35,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 16:26:35,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 16:26:35,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:26:35,518 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 26 states. [2018-02-04 16:26:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:36,238 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-02-04 16:26:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 16:26:36,238 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-02-04 16:26:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:36,239 INFO L225 Difference]: With dead ends: 91 [2018-02-04 16:26:36,239 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 16:26:36,239 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 16:26:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 16:26:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-02-04 16:26:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 16:26:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-04 16:26:36,241 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 75 [2018-02-04 16:26:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:36,241 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-04 16:26:36,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 16:26:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-04 16:26:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 16:26:36,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:36,242 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 16:26:36,242 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 16:26:36,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1868460952, now seen corresponding path program 4 times [2018-02-04 16:26:36,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:36,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:36,792 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 16:26:36,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:36,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:26:36,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:36,793 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 16:26:36,793 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 16:26:36,793 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 16:26:36,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:26:36,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:26:36,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:26:36,794 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 23 states. [2018-02-04 16:26:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:37,423 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-02-04 16:26:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 16:26:37,423 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-02-04 16:26:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:37,424 INFO L225 Difference]: With dead ends: 125 [2018-02-04 16:26:37,424 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 16:26:37,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 16:26:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 16:26:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2018-02-04 16:26:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 16:26:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-02-04 16:26:37,426 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 80 [2018-02-04 16:26:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:37,426 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-02-04 16:26:37,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:26:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-02-04 16:26:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 16:26:37,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:37,427 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 16:26:37,427 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 16:26:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1868460953, now seen corresponding path program 2 times [2018-02-04 16:26:37,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:37,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:37,537 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 16:26:37,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:37,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:26:37,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:37,538 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 16:26:37,538 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 16:26:37,538 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 16:26:37,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:26:37,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:26:37,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:26:37,539 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 10 states. [2018-02-04 16:26:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:37,659 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-04 16:26:37,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:26:37,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-02-04 16:26:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:37,661 INFO L225 Difference]: With dead ends: 116 [2018-02-04 16:26:37,661 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 16:26:37,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:26:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 16:26:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-02-04 16:26:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 16:26:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-02-04 16:26:37,664 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 80 [2018-02-04 16:26:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:37,664 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-02-04 16:26:37,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:26:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-02-04 16:26:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 16:26:37,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:37,665 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 16:26:37,665 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 16:26:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2087714694, now seen corresponding path program 3 times [2018-02-04 16:26:37,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:37,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:38,090 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 16:26:38,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:38,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:26:38,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:38,091 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 16:26:38,092 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 16:26:38,092 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 16:26:38,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:26:38,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:26:38,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:26:38,092 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 18 states. [2018-02-04 16:26:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:38,340 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-02-04 16:26:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 16:26:38,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-02-04 16:26:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:38,341 INFO L225 Difference]: With dead ends: 122 [2018-02-04 16:26:38,341 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 16:26:38,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:26:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 16:26:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-02-04 16:26:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 16:26:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-04 16:26:38,343 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 81 [2018-02-04 16:26:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:38,343 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-04 16:26:38,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:26:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-04 16:26:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 16:26:38,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:38,343 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 16:26:38,343 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 16:26:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2087714695, now seen corresponding path program 3 times [2018-02-04 16:26:38,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:38,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:39,545 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 16:26:39,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:39,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 16:26:39,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:39,545 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 16:26:39,545 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 16:26:39,545 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 16:26:39,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 16:26:39,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 16:26:39,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-02-04 16:26:39,546 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 32 states. [2018-02-04 16:26:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:40,688 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 16:26:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 16:26:40,688 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-02-04 16:26:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:40,688 INFO L225 Difference]: With dead ends: 121 [2018-02-04 16:26:40,689 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 16:26:40,689 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 16:26:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 16:26:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-02-04 16:26:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 16:26:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-04 16:26:40,692 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 81 [2018-02-04 16:26:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:40,692 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-04 16:26:40,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 16:26:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-04 16:26:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 16:26:40,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:40,693 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 16:26:40,693 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 16:26:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash 542617019, now seen corresponding path program 3 times [2018-02-04 16:26:40,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:40,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:40,769 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 16:26:40,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:40,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:26:40,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:40,770 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 16:26:40,770 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 16:26:40,770 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 16:26:40,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:26:40,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:26:40,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:26:40,770 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 9 states. [2018-02-04 16:26:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:40,863 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-02-04 16:26:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:26:40,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-02-04 16:26:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:40,864 INFO L225 Difference]: With dead ends: 113 [2018-02-04 16:26:40,864 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 16:26:40,864 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 16:26:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 16:26:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 16:26:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 16:26:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-02-04 16:26:40,867 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 83 [2018-02-04 16:26:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:40,867 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-02-04 16:26:40,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:26:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-02-04 16:26:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 16:26:40,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:40,868 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 16:26:40,868 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 16:26:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1000111226, now seen corresponding path program 5 times [2018-02-04 16:26:40,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:40,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:40,932 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 16:26:40,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:40,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:26:40,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:40,933 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 16:26:40,933 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 16:26:40,933 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 16:26:40,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:26:40,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:26:40,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:26:40,934 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 9 states. [2018-02-04 16:26:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:41,046 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-02-04 16:26:41,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:26:41,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-02-04 16:26:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:41,048 INFO L225 Difference]: With dead ends: 195 [2018-02-04 16:26:41,048 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 16:26:41,048 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 16:26:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 16:26:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 120. [2018-02-04 16:26:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 16:26:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2018-02-04 16:26:41,051 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 86 [2018-02-04 16:26:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:41,051 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2018-02-04 16:26:41,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:26:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2018-02-04 16:26:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 16:26:41,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:41,052 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 16:26:41,052 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 16:26:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash -79558979, now seen corresponding path program 3 times [2018-02-04 16:26:41,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:41,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:41,501 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 16:26:41,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:41,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:26:41,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:41,502 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 16:26:41,502 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 16:26:41,502 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 16:26:41,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:26:41,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:26:41,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:26:41,502 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand 22 states. [2018-02-04 16:26:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:41,993 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-04 16:26:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:26:41,994 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-02-04 16:26:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:41,994 INFO L225 Difference]: With dead ends: 126 [2018-02-04 16:26:41,994 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 16:26:41,995 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 16:26:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 16:26:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2018-02-04 16:26:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 16:26:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2018-02-04 16:26:41,996 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 86 [2018-02-04 16:26:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:41,996 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2018-02-04 16:26:41,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:26:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2018-02-04 16:26:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 16:26:41,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:41,997 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 16:26:41,997 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 16:26:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash -79558929, now seen corresponding path program 3 times [2018-02-04 16:26:41,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:42,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:42,050 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 16:26:42,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:42,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:26:42,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:42,051 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 16:26:42,051 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 16:26:42,051 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 16:26:42,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:26:42,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:26:42,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:26:42,052 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 10 states. [2018-02-04 16:26:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:42,126 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-02-04 16:26:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:26:42,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-02-04 16:26:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:42,127 INFO L225 Difference]: With dead ends: 124 [2018-02-04 16:26:42,127 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 16:26:42,128 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 16:26:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 16:26:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-02-04 16:26:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 16:26:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-02-04 16:26:42,130 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 86 [2018-02-04 16:26:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:42,131 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-02-04 16:26:42,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:26:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-02-04 16:26:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 16:26:42,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:42,131 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 16:26:42,132 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 16:26:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash 680415909, now seen corresponding path program 4 times [2018-02-04 16:26:42,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:42,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:48,205 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 129 DAG size of output 47 [2018-02-04 16:26:48,457 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 137 DAG size of output 53 [2018-02-04 16:26:48,841 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 142 DAG size of output 55 [2018-02-04 16:26:49,108 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 133 DAG size of output 54 [2018-02-04 16:26:49,628 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 107 DAG size of output 64 [2018-02-04 16:26:49,805 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 101 DAG size of output 62 [2018-02-04 16:26:49,976 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 102 DAG size of output 63 [2018-02-04 16:26:50,157 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 110 DAG size of output 71 [2018-02-04 16:26:50,325 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-02-04 16:26:50,505 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 125 DAG size of output 66 [2018-02-04 16:26:50,977 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 172 DAG size of output 60 [2018-02-04 16:26:51,447 WARN L146 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 177 DAG size of output 54 [2018-02-04 16:26:51,972 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 124 DAG size of output 54 [2018-02-04 16:26:52,320 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 137 DAG size of output 42 [2018-02-04 16:26:52,786 WARN L146 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 163 DAG size of output 42 [2018-02-04 16:26:53,323 WARN L146 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 163 DAG size of output 42 [2018-02-04 16:26:54,084 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 16:26:54,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:54,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 16:26:54,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:54,084 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 16:26:54,085 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 16:26:54,085 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 16:26:54,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 16:26:54,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 16:26:54,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 16:26:54,086 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 36 states. [2018-02-04 16:26:54,831 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 98 DAG size of output 96 [2018-02-04 16:26:56,063 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-04 16:26:56,247 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-04 16:26:56,450 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 101 DAG size of output 88 [2018-02-04 16:26:56,664 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 110 DAG size of output 77 [2018-02-04 16:26:56,992 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 105 DAG size of output 73 [2018-02-04 16:26:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:57,344 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-02-04 16:26:57,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 16:26:57,344 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-02-04 16:26:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:57,344 INFO L225 Difference]: With dead ends: 123 [2018-02-04 16:26:57,344 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 16:26:57,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=379, Invalid=2701, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 16:26:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 16:26:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 16:26:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 16:26:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-04 16:26:57,348 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 89 [2018-02-04 16:26:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:57,348 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-04 16:26:57,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 16:26:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-04 16:26:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 16:26:57,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:57,349 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 16:26:57,349 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 16:26:57,349 INFO L82 PathProgramCache]: Analyzing trace with hash 35987013, now seen corresponding path program 5 times [2018-02-04 16:26:57,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:57,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:57,598 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 16:26:57,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:57,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:26:57,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:57,599 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 16:26:57,599 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 16:26:57,599 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 16:26:57,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:26:57,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:26:57,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:26:57,600 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 14 states. [2018-02-04 16:26:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:58,019 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-02-04 16:26:58,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:26:58,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-02-04 16:26:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:58,020 INFO L225 Difference]: With dead ends: 98 [2018-02-04 16:26:58,020 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 16:26:58,020 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 16:26:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 16:26:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-04 16:26:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 16:26:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-04 16:26:58,022 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 93 [2018-02-04 16:26:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:58,022 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-04 16:26:58,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:26:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-04 16:26:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 16:26:58,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:58,023 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 16:26:58,023 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 16:26:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1115597433, now seen corresponding path program 4 times [2018-02-04 16:26:58,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:58,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:26:58,455 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 16:26:58,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:26:58,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:26:58,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:26:58,456 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 16:26:58,456 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 16:26:58,456 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 16:26:58,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:26:58,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:26:58,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:26:58,456 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 18 states. [2018-02-04 16:26:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:26:58,943 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-02-04 16:26:58,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 16:26:58,943 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-02-04 16:26:58,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:26:58,944 INFO L225 Difference]: With dead ends: 100 [2018-02-04 16:26:58,944 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 16:26:58,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 16:26:58,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 16:26:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-02-04 16:26:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 16:26:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-02-04 16:26:58,946 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 94 [2018-02-04 16:26:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:26:58,946 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-02-04 16:26:58,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:26:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-02-04 16:26:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 16:26:58,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:26:58,946 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 16:26:58,946 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 16:26:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1115597434, now seen corresponding path program 4 times [2018-02-04 16:26:58,947 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:26:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:26:58,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:00,366 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 16:27:00,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:00,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 16:27:00,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:00,366 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 16:27:00,367 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 16:27:00,367 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 16:27:00,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 16:27:00,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 16:27:00,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:27:00,367 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 38 states. [2018-02-04 16:27:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:02,503 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-02-04 16:27:02,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 16:27:02,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-02-04 16:27:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:02,504 INFO L225 Difference]: With dead ends: 100 [2018-02-04 16:27:02,504 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 16:27:02,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=618, Invalid=4784, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 16:27:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 16:27:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-02-04 16:27:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 16:27:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-02-04 16:27:02,507 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 94 [2018-02-04 16:27:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:02,507 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-02-04 16:27:02,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 16:27:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-02-04 16:27:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 16:27:02,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:02,509 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 16:27:02,509 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 16:27:02,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1301854323, now seen corresponding path program 6 times [2018-02-04 16:27:02,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:02,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:02,584 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 16:27:02,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:02,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:27:02,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:02,585 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 16:27:02,586 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 16:27:02,586 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 16:27:02,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:27:02,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:27:02,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:27:02,587 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 10 states. [2018-02-04 16:27:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:02,695 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2018-02-04 16:27:02,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:27:02,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-02-04 16:27:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:02,696 INFO L225 Difference]: With dead ends: 208 [2018-02-04 16:27:02,696 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 16:27:02,696 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 16:27:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 16:27:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 104. [2018-02-04 16:27:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 16:27:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-02-04 16:27:02,698 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 99 [2018-02-04 16:27:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:02,698 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-02-04 16:27:02,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:27:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-02-04 16:27:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 16:27:02,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:02,699 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 16:27:02,699 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 16:27:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2072560726, now seen corresponding path program 4 times [2018-02-04 16:27:02,700 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:02,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:02,861 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 16:27:02,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:02,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:27:02,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:02,862 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 16:27:02,862 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 16:27:02,862 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 16:27:02,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:27:02,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:27:02,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:27:02,863 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 11 states. [2018-02-04 16:27:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:02,982 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-02-04 16:27:02,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:27:02,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-02-04 16:27:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:02,983 INFO L225 Difference]: With dead ends: 108 [2018-02-04 16:27:02,983 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 16:27:02,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:27:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 16:27:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-04 16:27:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 16:27:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-02-04 16:27:02,985 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 99 [2018-02-04 16:27:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:02,986 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-02-04 16:27:02,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:27:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-02-04 16:27:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 16:27:02,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:02,986 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 16:27:02,987 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 16:27:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2072560677, now seen corresponding path program 6 times [2018-02-04 16:27:02,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:03,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:03,758 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 16:27:03,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:03,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:27:03,759 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:03,759 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 16:27:03,759 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 16:27:03,759 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 16:27:03,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:27:03,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:27:03,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:27:03,760 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 25 states. [2018-02-04 16:27:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:04,535 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-02-04 16:27:04,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 16:27:04,535 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-02-04 16:27:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:04,536 INFO L225 Difference]: With dead ends: 149 [2018-02-04 16:27:04,536 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 16:27:04,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 16:27:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 16:27:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2018-02-04 16:27:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 16:27:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-02-04 16:27:04,539 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 99 [2018-02-04 16:27:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:04,540 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-02-04 16:27:04,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:27:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-02-04 16:27:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 16:27:04,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:04,541 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 16:27:04,541 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 16:27:04,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2072560676, now seen corresponding path program 4 times [2018-02-04 16:27:04,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:04,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:04,660 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 16:27:04,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:04,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:27:04,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:04,660 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 16:27:04,661 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 16:27:04,661 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 16:27:04,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:27:04,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:27:04,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:27:04,661 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 12 states. [2018-02-04 16:27:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:04,780 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-02-04 16:27:04,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 16:27:04,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-02-04 16:27:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:04,781 INFO L225 Difference]: With dead ends: 139 [2018-02-04 16:27:04,782 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 16:27:04,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:27:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 16:27:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2018-02-04 16:27:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 16:27:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2018-02-04 16:27:04,785 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 99 [2018-02-04 16:27:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:04,785 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2018-02-04 16:27:04,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:27:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-02-04 16:27:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 16:27:04,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:04,786 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 16:27:04,786 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 16:27:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash 175128483, now seen corresponding path program 5 times [2018-02-04 16:27:04,787 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:04,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:05,170 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 16:27:05,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:05,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:27:05,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:05,171 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 16:27:05,171 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 16:27:05,171 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 16:27:05,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:27:05,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:27:05,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:27:05,172 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 20 states. [2018-02-04 16:27:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:05,424 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2018-02-04 16:27:05,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:27:05,424 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2018-02-04 16:27:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:05,425 INFO L225 Difference]: With dead ends: 146 [2018-02-04 16:27:05,425 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 16:27:05,426 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 16:27:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 16:27:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2018-02-04 16:27:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 16:27:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2018-02-04 16:27:05,428 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 100 [2018-02-04 16:27:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:05,428 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2018-02-04 16:27:05,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:27:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2018-02-04 16:27:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 16:27:05,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:05,428 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 16:27:05,428 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 16:27:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash 175128484, now seen corresponding path program 5 times [2018-02-04 16:27:05,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:05,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:07,109 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 16:27:07,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:07,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 16:27:07,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:07,109 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 16:27:07,110 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 16:27:07,110 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 16:27:07,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 16:27:07,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 16:27:07,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 16:27:07,110 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand 40 states. [2018-02-04 16:27:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:08,464 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-02-04 16:27:08,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 16:27:08,464 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 100 [2018-02-04 16:27:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:08,465 INFO L225 Difference]: With dead ends: 145 [2018-02-04 16:27:08,465 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 16:27:08,465 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 16:27:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 16:27:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-02-04 16:27:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 16:27:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-04 16:27:08,467 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 100 [2018-02-04 16:27:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:08,467 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-04 16:27:08,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 16:27:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-04 16:27:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 16:27:08,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:08,468 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 16:27:08,468 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 16:27:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1796845376, now seen corresponding path program 5 times [2018-02-04 16:27:08,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:08,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:08,943 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 16:27:08,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:08,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:27:08,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:08,944 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 16:27:08,944 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 16:27:08,944 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 16:27:08,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:27:08,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:27:08,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:27:08,945 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand 24 states. [2018-02-04 16:27:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:09,562 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-02-04 16:27:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 16:27:09,562 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2018-02-04 16:27:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:09,563 INFO L225 Difference]: With dead ends: 145 [2018-02-04 16:27:09,563 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 16:27:09,563 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 16:27:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 16:27:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-02-04 16:27:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 16:27:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2018-02-04 16:27:09,565 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 105 [2018-02-04 16:27:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:09,565 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2018-02-04 16:27:09,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:27:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2018-02-04 16:27:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 16:27:09,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:09,566 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 16:27:09,566 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 16:27:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1796845326, now seen corresponding path program 5 times [2018-02-04 16:27:09,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:09,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:27:09,623 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 16:27:09,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:27:09,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:27:09,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:27:09,624 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 16:27:09,624 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 16:27:09,625 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 16:27:09,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:27:09,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:27:09,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:27:09,625 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 12 states. [2018-02-04 16:27:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:27:09,685 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-02-04 16:27:09,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:27:09,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-02-04 16:27:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:27:09,686 INFO L225 Difference]: With dead ends: 143 [2018-02-04 16:27:09,686 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 16:27:09,686 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 16:27:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 16:27:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-02-04 16:27:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 16:27:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2018-02-04 16:27:09,688 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 105 [2018-02-04 16:27:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:27:09,689 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-02-04 16:27:09,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:27:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2018-02-04 16:27:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 16:27:09,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:27:09,690 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 16:27:09,690 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 16:27:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1643174462, now seen corresponding path program 5 times [2018-02-04 16:27:09,692 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:27:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:27:09,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:10,044 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 108 DAG size of output 45 [2018-02-04 16:28:10,208 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 111 DAG size of output 51 [2018-02-04 16:28:10,478 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 113 DAG size of output 51 [2018-02-04 16:28:10,716 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 118 DAG size of output 49 [2018-02-04 16:28:11,048 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 142 DAG size of output 67 [2018-02-04 16:28:11,327 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 138 DAG size of output 66 [2018-02-04 16:28:11,794 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 139 DAG size of output 65 [2018-02-04 16:28:12,127 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 139 DAG size of output 75 [2018-02-04 16:28:12,779 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 122 DAG size of output 87 [2018-02-04 16:28:13,018 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 117 DAG size of output 88 [2018-02-04 16:28:13,261 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 120 DAG size of output 87 [2018-02-04 16:28:13,528 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 127 DAG size of output 93 [2018-02-04 16:28:13,770 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 123 DAG size of output 90 [2018-02-04 16:28:14,023 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 133 DAG size of output 92 [2018-02-04 16:28:14,502 WARN L146 SmtUtils]: Spent 313ms on a formula simplification. DAG size of input: 177 DAG size of output 87 [2018-02-04 16:28:14,955 WARN L146 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 166 DAG size of output 79 [2018-02-04 16:28:15,302 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 147 DAG size of output 75 [2018-02-04 16:28:15,852 WARN L146 SmtUtils]: Spent 318ms on a formula simplification. DAG size of input: 167 DAG size of output 59 [2018-02-04 16:28:16,452 WARN L146 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 175 DAG size of output 60 [2018-02-04 16:28:16,904 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 130 DAG size of output 58 [2018-02-04 16:28:17,500 WARN L146 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 151 DAG size of output 42 [2018-02-04 16:28:18,253 WARN L146 SmtUtils]: Spent 326ms on a formula simplification. DAG size of input: 180 DAG size of output 44 [2018-02-04 16:28:18,966 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 120 DAG size of output 39 [2018-02-04 16:28:19,386 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 102 DAG size of output 30 [2018-02-04 16:28:20,464 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 16:28:20,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:20,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 16:28:20,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:20,465 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 16:28:20,466 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 16:28:20,466 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 16:28:20,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 16:28:20,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 16:28:20,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1805, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 16:28:20,467 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 46 states. [2018-02-04 16:28:21,780 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 98 DAG size of output 92 [2018-02-04 16:28:22,397 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 137 DAG size of output 129 [2018-02-04 16:28:22,729 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 150 [2018-02-04 16:28:23,234 WARN L146 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 175 DAG size of output 164 [2018-02-04 16:28:23,565 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 134 DAG size of output 118 [2018-02-04 16:28:23,809 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 109 DAG size of output 104 [2018-02-04 16:28:24,181 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 103 DAG size of output 98 [2018-02-04 16:28:24,439 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 114 DAG size of output 108 [2018-02-04 16:28:24,632 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 90 DAG size of output 86 [2018-02-04 16:28:24,954 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 84 DAG size of output 84 [2018-02-04 16:28:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:26,149 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-02-04 16:28:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 16:28:26,150 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 108 [2018-02-04 16:28:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:26,150 INFO L225 Difference]: With dead ends: 142 [2018-02-04 16:28:26,150 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 16:28:26,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=885, Invalid=6255, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 16:28:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 16:28:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 16:28:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 16:28:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2018-02-04 16:28:26,152 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 108 [2018-02-04 16:28:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:26,152 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2018-02-04 16:28:26,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 16:28:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2018-02-04 16:28:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 16:28:26,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:26,153 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 16:28:26,153 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 16:28:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1238084774, now seen corresponding path program 7 times [2018-02-04 16:28:26,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:26,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:26,209 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 16:28:26,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:26,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:28:26,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:26,210 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 16:28:26,210 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 16:28:26,210 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 16:28:26,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:28:26,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:28:26,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:28:26,210 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 11 states. [2018-02-04 16:28:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:26,294 INFO L93 Difference]: Finished difference Result 235 states and 256 transitions. [2018-02-04 16:28:26,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:28:26,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-02-04 16:28:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:26,295 INFO L225 Difference]: With dead ends: 235 [2018-02-04 16:28:26,295 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 16:28:26,295 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 16:28:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 16:28:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 116. [2018-02-04 16:28:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 16:28:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-04 16:28:26,297 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 112 [2018-02-04 16:28:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:26,297 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-04 16:28:26,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:28:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-04 16:28:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 16:28:26,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:26,298 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 16:28:26,298 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 16:28:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2136330226, now seen corresponding path program 7 times [2018-02-04 16:28:26,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:26,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:26,519 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 16:28:26,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:26,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 16:28:26,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:26,519 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 16:28:26,520 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 16:28:26,520 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 16:28:26,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 16:28:26,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 16:28:26,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:28:26,520 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 16 states. [2018-02-04 16:28:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:26,998 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-02-04 16:28:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 16:28:26,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2018-02-04 16:28:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:26,998 INFO L225 Difference]: With dead ends: 118 [2018-02-04 16:28:26,998 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 16:28:26,999 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 16:28:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 16:28:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-02-04 16:28:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 16:28:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2018-02-04 16:28:27,000 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 112 [2018-02-04 16:28:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:27,000 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2018-02-04 16:28:27,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 16:28:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2018-02-04 16:28:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 16:28:27,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:27,001 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 16:28:27,001 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 16:28:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1801727536, now seen corresponding path program 6 times [2018-02-04 16:28:27,001 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:27,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:27,485 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 16:28:27,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:27,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:28:27,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:27,485 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 16:28:27,485 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 16:28:27,485 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 16:28:27,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:28:27,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:28:27,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:28:27,486 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand 20 states. [2018-02-04 16:28:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:28,124 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-02-04 16:28:28,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 16:28:28,125 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-02-04 16:28:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:28,125 INFO L225 Difference]: With dead ends: 120 [2018-02-04 16:28:28,125 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 16:28:28,125 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 16:28:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 16:28:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-04 16:28:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 16:28:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-02-04 16:28:28,127 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 113 [2018-02-04 16:28:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:28,127 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-02-04 16:28:28,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:28:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-02-04 16:28:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 16:28:28,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:28,128 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 16:28:28,128 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 16:28:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1801727535, now seen corresponding path program 6 times [2018-02-04 16:28:28,128 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:28,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:29,994 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 16:28:29,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:29,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 16:28:29,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:29,994 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 16:28:29,995 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 16:28:29,995 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 16:28:29,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 16:28:29,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 16:28:29,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 16:28:29,995 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 43 states. [2018-02-04 16:28:32,514 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 137 DAG size of output 111 [2018-02-04 16:28:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:33,288 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-02-04 16:28:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 16:28:33,288 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-02-04 16:28:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:33,289 INFO L225 Difference]: With dead ends: 120 [2018-02-04 16:28:33,289 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 16:28:33,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=822, Invalid=6660, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 16:28:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 16:28:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-04 16:28:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 16:28:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2018-02-04 16:28:33,291 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 113 [2018-02-04 16:28:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:33,291 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2018-02-04 16:28:33,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 16:28:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-02-04 16:28:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 16:28:33,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:33,292 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 16:28:33,292 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 16:28:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 502272691, now seen corresponding path program 6 times [2018-02-04 16:28:33,293 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:33,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:33,442 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 16:28:33,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:33,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 16:28:33,443 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:33,443 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 16:28:33,443 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 16:28:33,443 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 16:28:33,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:28:33,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:28:33,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:28:33,443 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand 18 states. [2018-02-04 16:28:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:33,585 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 16:28:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:28:33,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2018-02-04 16:28:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:33,585 INFO L225 Difference]: With dead ends: 121 [2018-02-04 16:28:33,585 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 16:28:33,586 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 16:28:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 16:28:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 16:28:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 16:28:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2018-02-04 16:28:33,587 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 118 [2018-02-04 16:28:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:33,587 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2018-02-04 16:28:33,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:28:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2018-02-04 16:28:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 16:28:33,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:33,588 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 16:28:33,588 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 16:28:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash 502272740, now seen corresponding path program 8 times [2018-02-04 16:28:33,588 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:33,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:34,364 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 16:28:34,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:34,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 16:28:34,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:34,364 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 16:28:34,364 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 16:28:34,364 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 16:28:34,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 16:28:34,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 16:28:34,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2018-02-04 16:28:34,365 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 28 states. [2018-02-04 16:28:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:35,462 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-04 16:28:35,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 16:28:35,462 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 118 [2018-02-04 16:28:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:35,462 INFO L225 Difference]: With dead ends: 125 [2018-02-04 16:28:35,462 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 16:28:35,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=511, Invalid=2569, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 16:28:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 16:28:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-02-04 16:28:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 16:28:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2018-02-04 16:28:35,464 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 118 [2018-02-04 16:28:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:35,464 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2018-02-04 16:28:35,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 16:28:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2018-02-04 16:28:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 16:28:35,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:35,465 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 16:28:35,465 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 16:28:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash 502272741, now seen corresponding path program 6 times [2018-02-04 16:28:35,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:35,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:35,564 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 16:28:35,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:35,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:28:35,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:35,565 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 16:28:35,565 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 16:28:35,565 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 16:28:35,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:28:35,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:28:35,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:28:35,565 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 14 states. [2018-02-04 16:28:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:35,710 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-02-04 16:28:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:28:35,710 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 118 [2018-02-04 16:28:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:35,711 INFO L225 Difference]: With dead ends: 127 [2018-02-04 16:28:35,711 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 16:28:35,711 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 16:28:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 16:28:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-04 16:28:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 16:28:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-02-04 16:28:35,712 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 118 [2018-02-04 16:28:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:35,712 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-02-04 16:28:35,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:28:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-02-04 16:28:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 16:28:35,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:35,713 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 16:28:35,713 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 16:28:35,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1609414214, now seen corresponding path program 7 times [2018-02-04 16:28:35,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:35,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:36,171 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 16:28:36,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:36,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:28:36,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:36,171 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 16:28:36,171 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 16:28:36,172 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 16:28:36,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:28:36,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:28:36,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:28:36,172 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 22 states. [2018-02-04 16:28:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:36,512 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2018-02-04 16:28:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 16:28:36,512 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 119 [2018-02-04 16:28:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:36,512 INFO L225 Difference]: With dead ends: 165 [2018-02-04 16:28:36,513 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 16:28:36,513 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 16:28:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 16:28:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2018-02-04 16:28:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 16:28:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2018-02-04 16:28:36,515 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 119 [2018-02-04 16:28:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:36,515 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2018-02-04 16:28:36,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:28:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2018-02-04 16:28:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 16:28:36,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:36,516 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 16:28:36,516 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 16:28:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1609414213, now seen corresponding path program 7 times [2018-02-04 16:28:36,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:36,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:39,844 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 16:28:39,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:39,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 16:28:39,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:39,845 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 16:28:39,845 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 16:28:39,845 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 16:28:39,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 16:28:39,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 16:28:39,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2093, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 16:28:39,846 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 49 states. [2018-02-04 16:28:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:41,549 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2018-02-04 16:28:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 16:28:41,549 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 119 [2018-02-04 16:28:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:41,550 INFO L225 Difference]: With dead ends: 164 [2018-02-04 16:28:41,550 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 16:28:41,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=536, Invalid=4156, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 16:28:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 16:28:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2018-02-04 16:28:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 16:28:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2018-02-04 16:28:41,552 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 119 [2018-02-04 16:28:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:41,552 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2018-02-04 16:28:41,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 16:28:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2018-02-04 16:28:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 16:28:41,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:41,553 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 16:28:41,553 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 16:28:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1842060461, now seen corresponding path program 8 times [2018-02-04 16:28:41,553 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:41,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:41,652 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 16:28:41,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:41,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:28:41,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:41,652 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 16:28:41,653 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 16:28:41,653 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 16:28:41,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:28:41,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:28:41,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:28:41,653 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand 12 states. [2018-02-04 16:28:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:41,733 INFO L93 Difference]: Finished difference Result 308 states and 328 transitions. [2018-02-04 16:28:41,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 16:28:41,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2018-02-04 16:28:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:41,734 INFO L225 Difference]: With dead ends: 308 [2018-02-04 16:28:41,734 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 16:28:41,734 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 16:28:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 16:28:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 165. [2018-02-04 16:28:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 16:28:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2018-02-04 16:28:41,735 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 125 [2018-02-04 16:28:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:41,736 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2018-02-04 16:28:41,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:28:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2018-02-04 16:28:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 16:28:41,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:41,736 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 16:28:41,736 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 16:28:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1815739657, now seen corresponding path program 7 times [2018-02-04 16:28:41,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:41,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:42,273 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 16:28:42,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:42,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:28:42,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:42,274 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 16:28:42,274 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 16:28:42,274 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 16:28:42,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 16:28:42,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 16:28:42,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:28:42,274 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand 26 states. [2018-02-04 16:28:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:43,015 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2018-02-04 16:28:43,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 16:28:43,015 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 124 [2018-02-04 16:28:43,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:43,016 INFO L225 Difference]: With dead ends: 171 [2018-02-04 16:28:43,016 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 16:28:43,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 16:28:43,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 16:28:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2018-02-04 16:28:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 16:28:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2018-02-04 16:28:43,018 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 124 [2018-02-04 16:28:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:43,018 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2018-02-04 16:28:43,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 16:28:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2018-02-04 16:28:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 16:28:43,019 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:43,019 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 16:28:43,019 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 16:28:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1815739707, now seen corresponding path program 7 times [2018-02-04 16:28:43,020 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:43,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:43,082 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 16:28:43,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:43,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 16:28:43,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:43,083 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 16:28:43,083 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 16:28:43,083 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 16:28:43,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:28:43,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:28:43,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:28:43,083 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand 14 states. [2018-02-04 16:28:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:28:43,164 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2018-02-04 16:28:43,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:28:43,165 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-02-04 16:28:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:28:43,165 INFO L225 Difference]: With dead ends: 169 [2018-02-04 16:28:43,165 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 16:28:43,165 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 16:28:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 16:28:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-02-04 16:28:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 16:28:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 179 transitions. [2018-02-04 16:28:43,167 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 179 transitions. Word has length 124 [2018-02-04 16:28:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:28:43,167 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 179 transitions. [2018-02-04 16:28:43,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:28:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2018-02-04 16:28:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 16:28:43,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:28:43,168 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 16:28:43,168 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 16:28:43,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1882007769, now seen corresponding path program 6 times [2018-02-04 16:28:43,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:28:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:28:43,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:28:45,899 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 111 DAG size of output 64 [2018-02-04 16:28:46,159 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 126 DAG size of output 70 [2018-02-04 16:28:46,379 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 123 DAG size of output 71 [2018-02-04 16:28:46,756 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 124 DAG size of output 71 [2018-02-04 16:28:46,948 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 115 DAG size of output 77 [2018-02-04 16:28:47,384 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-02-04 16:28:47,556 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 101 DAG size of output 79 [2018-02-04 16:28:47,736 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 100 DAG size of output 80 [2018-02-04 16:28:47,918 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 108 DAG size of output 87 [2018-02-04 16:28:48,274 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 114 DAG size of output 82 [2018-02-04 16:28:48,536 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 144 DAG size of output 74 [2018-02-04 16:28:49,001 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 125 DAG size of output 70 [2018-02-04 16:28:51,412 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 16:28:51,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:28:51,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 16:28:51,412 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:28:51,412 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 16:28:51,413 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 16:28:51,413 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 16:28:51,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 16:28:51,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 16:28:51,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2581, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 16:28:51,414 INFO L87 Difference]: Start difference. First operand 165 states and 179 transitions. Second operand 53 states. [2018-02-04 16:28:53,450 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 103 DAG size of output 89 [2018-02-04 16:28:53,708 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 128 DAG size of output 118 [2018-02-04 16:28:54,065 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 137 DAG size of output 96 [2018-02-04 16:28:54,293 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 98 DAG size of output 94 [2018-02-04 16:28:54,955 WARN L146 SmtUtils]: Spent 498ms on a formula simplification. DAG size of input: 154 DAG size of output 139 [2018-02-04 16:28:55,323 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 160 DAG size of output 128 [2018-02-04 16:28:55,633 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 124 DAG size of output 104 [2018-02-04 16:28:57,263 WARN L146 SmtUtils]: Spent 1383ms on a formula simplification. DAG size of input: 259 DAG size of output 209 [2018-02-04 16:29:00,509 WARN L146 SmtUtils]: Spent 2917ms on a formula simplification. DAG size of input: 294 DAG size of output 224 [2018-02-04 16:29:02,989 WARN L146 SmtUtils]: Spent 2208ms on a formula simplification. DAG size of input: 243 DAG size of output 191 [2018-02-04 16:29:04,101 WARN L146 SmtUtils]: Spent 941ms on a formula simplification. DAG size of input: 189 DAG size of output 159 [2018-02-04 16:29:04,482 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 132 DAG size of output 130 [2018-02-04 16:29:05,080 WARN L146 SmtUtils]: Spent 476ms on a formula simplification. DAG size of input: 163 DAG size of output 160 [2018-02-04 16:29:06,951 WARN L146 SmtUtils]: Spent 1593ms on a formula simplification. DAG size of input: 244 DAG size of output 202 [2018-02-04 16:29:07,833 WARN L146 SmtUtils]: Spent 665ms on a formula simplification. DAG size of input: 204 DAG size of output 170 [2018-02-04 16:29:08,339 WARN L146 SmtUtils]: Spent 317ms on a formula simplification. DAG size of input: 163 DAG size of output 147 [2018-02-04 16:29:09,065 WARN L146 SmtUtils]: Spent 556ms on a formula simplification. DAG size of input: 181 DAG size of output 159 [2018-02-04 16:29:09,840 WARN L146 SmtUtils]: Spent 641ms on a formula simplification. DAG size of input: 151 DAG size of output 131 [2018-02-04 16:29:10,233 WARN L146 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 124 DAG size of output 111 [2018-02-04 16:29:10,680 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 103 DAG size of output 103 [2018-02-04 16:29:10,875 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 90 DAG size of output 78 [2018-02-04 16:29:11,792 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 102 DAG size of output 82 [2018-02-04 16:29:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:12,065 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-02-04 16:29:12,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 16:29:12,065 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 127 [2018-02-04 16:29:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:12,065 INFO L225 Difference]: With dead ends: 185 [2018-02-04 16:29:12,065 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 16:29:12,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=742, Invalid=7090, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 16:29:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 16:29:12,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 135. [2018-02-04 16:29:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 16:29:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2018-02-04 16:29:12,068 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 127 [2018-02-04 16:29:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:12,068 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2018-02-04 16:29:12,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 16:29:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2018-02-04 16:29:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 16:29:12,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:12,069 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 16:29:12,069 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 16:29:12,069 INFO L82 PathProgramCache]: Analyzing trace with hash -608426387, now seen corresponding path program 8 times [2018-02-04 16:29:12,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:12,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:12,707 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 16:29:12,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:29:12,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:29:12,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:12,708 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 16:29:12,708 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 16:29:12,708 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 16:29:12,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:29:12,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:29:12,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:29:12,708 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand 22 states. [2018-02-04 16:29:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:13,577 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-02-04 16:29:13,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 16:29:13,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 132 [2018-02-04 16:29:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:13,578 INFO L225 Difference]: With dead ends: 136 [2018-02-04 16:29:13,578 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 16:29:13,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=492, Invalid=2370, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 16:29:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 16:29:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-02-04 16:29:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 16:29:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2018-02-04 16:29:13,580 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 132 [2018-02-04 16:29:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:13,580 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2018-02-04 16:29:13,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:29:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2018-02-04 16:29:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 16:29:13,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:13,580 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 16:29:13,580 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 16:29:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash -608426386, now seen corresponding path program 8 times [2018-02-04 16:29:13,581 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:13,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 67 proven. 225 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 16:29:16,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:29:16,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 16:29:16,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 50 proven. 41 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 16:29:16,265 INFO L182 omatonBuilderFactory]: Interpolants [17671#true, 17672#false, 17673#(= 0 |ldv_malloc_#t~malloc1.offset|), 17674#(= 0 |ldv_malloc_#res.offset|), 17675#(= 0 |entry_point_#t~ret2.offset|), 17676#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 17677#(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))), 17678#(= entry_point_~array~0.offset 0), 17679#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 17680#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 17681#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0)), 17682#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 17683#(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)), 17684#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 4)))))) (= entry_point_~array~0.offset 0)), 17685#(= |#valid| |old(#valid)|), 17686#(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)), 17687#(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|))))), 17688#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 4)))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 4)))) |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 17689#(and (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) (+ entry_point_~array~0.offset (- 4)))) 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) (+ entry_point_~array~0.offset (- 4))))))), 17690#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 4)))))) (not (= (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) 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))))), 17691#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 8)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 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 (- 1))) entry_point_~array~0.offset))))), 17692#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 8)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 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 (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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)))) (not (= 0 |entry_point_#t~ret4.base|))), 17693#(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) (+ entry_point_~array~0.offset (+ (* 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 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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 8)))))) (= 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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 8)))) entry_point_~p~0.base))), 17694#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 8)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 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) (+ entry_point_~array~0.offset (+ (* 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))))), 17695#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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 (- 2))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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)))) (= 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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 12))))))), 17696#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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 (- 2))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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)))) (= 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) (- 12)))) |entry_point_#t~ret4.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 12)))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= 0 |entry_point_#t~ret4.base|))), 17697#(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)))) (= 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) (+ 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) (+ entry_point_~array~0.offset (+ (* 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) (+ entry_point_~array~0.offset (+ (* 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 (= (select (store (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) (- 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 (= 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))))), 17698#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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 (- 2))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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)))) (= 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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 12)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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))))), 17699#(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)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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 (- 1))))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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) (+ entry_point_~array~0.offset (- 16)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))), 17700#(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)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) |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))))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) 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_~i~0) (+ entry_point_~array~0.offset (- 16)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 |entry_point_#t~ret4.base|))), 17701#(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) (+ (* 4 (+ entry_point_~i~0 (- 3))) entry_point_~array~0.offset)))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (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) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (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) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) entry_point_~p~0.base)) (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) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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) (+ (* 4 (+ entry_point_~i~0 (- 3))) entry_point_~array~0.offset)))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 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) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))))) (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) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (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) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))), 17702#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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) (+ (* 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)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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 (- 1))))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (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) (+ entry_point_~array~0.offset (- 16)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (+ entry_point_~array~0.offset (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))), 17703#(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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 20)))) (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 (- 1))))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 4))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 20)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 4))) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 20)))) (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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 20)))) (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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 20)))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2)))))))), 17704#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))) (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) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (= entry_point_~array~0.offset 0) (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 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 3))) 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) (- 16)))) (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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))) (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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 3))) entry_point_~array~0.offset))))), 17705#(and (or (= 0 (select |#valid| |entry_point_#t~mem7.base|)) (and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 2))) 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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))))) (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 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 3))) 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) (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 3))) entry_point_~array~0.offset)))))) (= entry_point_~array~0.offset 0))) (not (= 0 |entry_point_#t~mem7.base|))), 17706#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))) (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) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (= 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)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 3))) 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) (- 16)))) (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) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 16)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 3))) entry_point_~array~0.offset))))), 17707#(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) (+ entry_point_~array~0.offset (- 12)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 12)))))) (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) (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) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 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) (+ entry_point_~array~0.offset (- 12)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset))))), 17708#(and (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) (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)))) (= 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) (+ entry_point_~array~0.offset (- 12)))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 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) (+ entry_point_~array~0.offset (- 12)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset))))), 17709#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 12)))))) (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) (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) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 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) (+ entry_point_~array~0.offset (- 12)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset))))), 17710#(and (not (= 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) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 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) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 8)))) (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) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 8)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset))))), 17711#(and (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) (= 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) (+ entry_point_~array~0.offset (- 8)))))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 8)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset))))), 17712#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 8)))))) (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) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (+ entry_point_~array~0.offset (- 8)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset))))), 17713#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 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) (- 4)))) (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) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 17714#(and (= 1 (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) (- 4)))))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 17715#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0)), 17716#(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)), 17717#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-04 16:29:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 67 proven. 225 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 16:29:16,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 16:29:16,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 16:29:16,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2019, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 16:29:16,266 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand 47 states. [2018-02-04 16:29:17,785 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 137 DAG size of output 104 [2018-02-04 16:29:18,135 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 145 DAG size of output 108 Received shutdown request... [2018-02-04 16:29:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:29:18,164 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 16:29:18,167 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 16:29:18,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:29:18 BoogieIcfgContainer [2018-02-04 16:29:18,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:29:18,168 INFO L168 Benchmark]: Toolchain (without parser) took 181847.20 ms. Allocated memory was 402.7 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 356.7 MB in the beginning and 805.3 MB in the end (delta: -448.6 MB). Peak memory consumption was 936.0 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:18,169 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:29:18,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.77 ms. Allocated memory is still 402.7 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:18,169 INFO L168 Benchmark]: Boogie Preprocessor took 27.05 ms. Allocated memory is still 402.7 MB. Free memory was 343.5 MB in the beginning and 342.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:18,169 INFO L168 Benchmark]: RCFGBuilder took 177.79 ms. Allocated memory is still 402.7 MB. Free memory was 342.2 MB in the beginning and 323.6 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:18,169 INFO L168 Benchmark]: TraceAbstraction took 181476.14 ms. Allocated memory was 402.7 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 322.3 MB in the beginning and 805.3 MB in the end (delta: -483.0 MB). Peak memory consumption was 901.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:18,170 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 402.7 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.77 ms. Allocated memory is still 402.7 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.05 ms. Allocated memory is still 402.7 MB. Free memory was 343.5 MB in the beginning and 342.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 177.79 ms. Allocated memory is still 402.7 MB. Free memory was 342.2 MB in the beginning and 323.6 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 181476.14 ms. Allocated memory was 402.7 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 322.3 MB in the beginning and 805.3 MB in the end (delta: -483.0 MB). Peak memory consumption was 901.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (135states) and interpolant automaton (currently 28 states, 47 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 181.4s OverallTime, 70 OverallIterations, 9 TraceHistogramMax, 60.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2780 SDtfs, 7073 SDslu, 20958 SDs, 0 SdLazy, 32022 SolverSat, 2221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2373 GetRequests, 313 SyntacticMatches, 156 SemanticMatches, 1903 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16048 ImplicationChecksByTransitivity, 88.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 4088/8530 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.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 118.5s InterpolantComputationTime, 5352 NumberOfCodeBlocks, 5352 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 5282 ConstructedInterpolants, 0 QuantifiedInterpolants, 9612295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 7 PerfectInterpolantSequences, 4088/8530 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_16-29-18-175.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_16-29-18-175.csv Completed graceful shutdown