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_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:18:40,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:18:40,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:18:40,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:18:40,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:18:40,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:18:40,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:18:40,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:18:40,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:18:40,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:18:40,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:18:40,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:18:40,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:18:40,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:18:40,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:18:40,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:18:40,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:18:40,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:18:40,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:18:40,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:18:40,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:18:40,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:18:40,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:18:40,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:18:40,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:18:40,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:18:40,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:18:40,035 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:18:40,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:18:40,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:18:40,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:18:40,035 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:18:40,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:18:40,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:18:40,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:18:40,045 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:18:40,045 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:18:40,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:18:40,045 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:18:40,045 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:18:40,045 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:18:40,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:18:40,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:18:40,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:18:40,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:18:40,047 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:18:40,047 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:18:40,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:18:40,080 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:18:40,083 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:18:40,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:18:40,084 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:18:40,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 03:18:40,230 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:18:40,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:18:40,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:18:40,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:18:40,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:18:40,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694e9a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40, skipping insertion in model container [2018-02-04 03:18:40,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,249 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:18:40,283 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:18:40,377 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:18:40,391 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:18:40,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40 WrapperNode [2018-02-04 03:18:40,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:18:40,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:18:40,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:18:40,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:18:40,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (1/1) ... [2018-02-04 03:18:40,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:18:40,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:18:40,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:18:40,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:18:40,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:18:40,471 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:18:40,471 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:18:40,471 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:18:40,471 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 03:18:40,471 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 03:18:40,471 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:18:40,471 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:18:40,472 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 03:18:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 03:18:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:18:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:18:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:18:40,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:18:40,657 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:18:40,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:18:40 BoogieIcfgContainer [2018-02-04 03:18:40,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:18:40,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:18:40,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:18:40,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:18:40,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:18:40" (1/3) ... [2018-02-04 03:18:40,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c67c6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:18:40, skipping insertion in model container [2018-02-04 03:18:40,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:18:40" (2/3) ... [2018-02-04 03:18:40,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c67c6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:18:40, skipping insertion in model container [2018-02-04 03:18:40,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:18:40" (3/3) ... [2018-02-04 03:18:40,662 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 03:18:40,667 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:18:40,672 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 03:18:40,702 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:18:40,702 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:18:40,703 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:18:40,703 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:18:40,703 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:18:40,703 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:18:40,703 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:18:40,703 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:18:40,703 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:18:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 03:18:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:18:40,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:40,725 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:40,725 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-02-04 03:18:40,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:40,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:40,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:40,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:18:40,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:40,910 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 81#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 82#(and (= 0 |entry_point_#t~ret10.base|) (= 0 |entry_point_#t~ret10.offset|)), 83#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset)), 79#true] [2018-02-04 03:18:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:40,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:18:40,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:18:40,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:18:40,986 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-02-04 03:18:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:41,050 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-04 03:18:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:18:41,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 03:18:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:41,057 INFO L225 Difference]: With dead ends: 82 [2018-02-04 03:18:41,057 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 03:18:41,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:18:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 03:18:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-04 03:18:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:18:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 03:18:41,088 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-02-04 03:18:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:41,089 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 03:18:41,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:18:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 03:18:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:18:41,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:41,090 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:41,090 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-02-04 03:18:41,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:41,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:41,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:18:41,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,132 INFO L182 omatonBuilderFactory]: Interpolants [243#true, 244#false, 245#(= |#valid| |old(#valid)|)] [2018-02-04 03:18:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:18:41,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:18:41,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:18:41,134 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-02-04 03:18:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:41,198 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 03:18:41,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:18:41,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 03:18:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:41,199 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:18:41,200 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 03:18:41,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:18:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 03:18:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-02-04 03:18:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 03:18:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 03:18:41,207 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-02-04 03:18:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:41,208 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 03:18:41,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:18:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 03:18:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:18:41,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:41,208 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:41,209 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-02-04 03:18:41,210 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:41,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:41,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:18:41,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,283 INFO L182 omatonBuilderFactory]: Interpolants [433#true, 434#false, 435#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 436#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 437#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 438#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:18:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:18:41,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:18:41,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:41,284 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-02-04 03:18:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:41,379 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-04 03:18:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:18:41,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:18:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:41,380 INFO L225 Difference]: With dead ends: 76 [2018-02-04 03:18:41,380 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 03:18:41,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:18:41,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 03:18:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-04 03:18:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 03:18:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 03:18:41,384 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-02-04 03:18:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:41,384 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 03:18:41,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:18:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 03:18:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:18:41,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:41,385 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:41,385 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-02-04 03:18:41,386 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:41,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:41,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:18:41,584 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,584 INFO L182 omatonBuilderFactory]: Interpolants [592#false, 593#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 594#(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))), 595#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 596#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 597#(and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 598#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 599#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 591#true] [2018-02-04 03:18:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:18:41,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:18:41,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:18:41,585 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-04 03:18:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:41,800 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 03:18:41,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:18:41,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 03:18:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:41,801 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:18:41,801 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:18:41,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:18:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:18:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 03:18:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:18:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-04 03:18:41,804 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-02-04 03:18:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:41,804 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-04 03:18:41,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:18:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-04 03:18:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:18:41,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:41,805 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:41,805 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:41,805 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-02-04 03:18:41,806 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:41,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:41,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:18:41,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,841 INFO L182 omatonBuilderFactory]: Interpolants [768#false, 769#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 770#(not (= 0 |ldv_malloc_#res.base|)), 771#(not (= 0 |entry_point_#t~ret10.base|)), 772#(not (= 0 entry_point_~array~0.base)), 767#true] [2018-02-04 03:18:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:41,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:18:41,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:18:41,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:41,842 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-02-04 03:18:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:41,872 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 03:18:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:18:41,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:18:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:41,873 INFO L225 Difference]: With dead ends: 77 [2018-02-04 03:18:41,873 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 03:18:41,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:18:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 03:18:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 03:18:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:18:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 03:18:41,876 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-02-04 03:18:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:41,876 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 03:18:41,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:18:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 03:18:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:18:41,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:41,876 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] [2018-02-04 03:18:41,876 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-02-04 03:18:41,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:41,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:42,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:18:42,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,074 INFO L182 omatonBuilderFactory]: Interpolants [929#true, 930#false, 931#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 932#(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) 0))), 933#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 934#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 935#(or (and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 936#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 937#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))) (= entry_point_~i~2 0)), 938#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 939#(and (<= (+ (* 4 entry_point_~i~2) 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-04 03:18:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:18:42,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:18:42,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:18:42,075 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 11 states. [2018-02-04 03:18:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:42,285 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-04 03:18:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:18:42,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 03:18:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:42,286 INFO L225 Difference]: With dead ends: 83 [2018-02-04 03:18:42,287 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 03:18:42,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:18:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 03:18:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 03:18:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 03:18:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 03:18:42,290 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2018-02-04 03:18:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:42,290 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 03:18:42,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:18:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 03:18:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:18:42,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:42,290 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:42,291 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-02-04 03:18:42,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:42,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:42,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:18:42,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,458 INFO L182 omatonBuilderFactory]: Interpolants [1120#(<= entry_point_~len~0 10), 1121#(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) 0))), 1122#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 1123#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1124#(or (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 1125#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1126#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1127#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1128#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 1129#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1130#(and (<= (+ (* 4 entry_point_~i~2) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1118#true, 1119#false] [2018-02-04 03:18:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:18:42,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:18:42,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:18:42,459 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 13 states. [2018-02-04 03:18:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:42,634 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 03:18:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:18:42,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 03:18:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:42,635 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:18:42,635 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:18:42,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:18:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:18:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-02-04 03:18:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 03:18:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-04 03:18:42,638 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 27 [2018-02-04 03:18:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:42,639 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-04 03:18:42,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:18:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-04 03:18:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:18:42,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:42,639 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:42,639 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:42,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1676632482, now seen corresponding path program 1 times [2018-02-04 03:18:42,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:42,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:18:42,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:42,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:18:42,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:42,687 INFO L182 omatonBuilderFactory]: Interpolants [1300#true, 1301#false, 1302#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1303#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1304#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-04 03:18:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:18:42,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:18:42,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:18:42,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:18:42,687 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 5 states. [2018-02-04 03:18:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:42,702 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 03:18:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:18:42,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 03:18:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:42,704 INFO L225 Difference]: With dead ends: 79 [2018-02-04 03:18:42,704 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 03:18:42,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:18:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 03:18:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-04 03:18:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:18:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 03:18:42,708 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 34 [2018-02-04 03:18:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:42,708 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 03:18:42,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:18:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 03:18:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:18:42,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:42,709 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:42,709 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1914987476, now seen corresponding path program 1 times [2018-02-04 03:18:42,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:42,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:42,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:18:42,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,752 INFO L182 omatonBuilderFactory]: Interpolants [1461#true, 1462#false, 1463#(= 1 (select |#valid| entry_point_~array~0.base)), 1464#(= |#valid| |old(#valid)|), 1465#(= 1 (select |#valid| |free_17_#in~array.base|)), 1466#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:18:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:18:42,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:18:42,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:42,753 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 6 states. [2018-02-04 03:18:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:42,854 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-04 03:18:42,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:18:42,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 03:18:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:42,855 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:18:42,856 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:18:42,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:18:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:18:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2018-02-04 03:18:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 03:18:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-02-04 03:18:42,859 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 35 [2018-02-04 03:18:42,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:42,859 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-02-04 03:18:42,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:18:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-02-04 03:18:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:18:42,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:42,860 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:42,860 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1914987475, now seen corresponding path program 1 times [2018-02-04 03:18:42,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:42,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:42,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:18:42,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,886 INFO L182 omatonBuilderFactory]: Interpolants [1696#false, 1697#(<= 10 entry_point_~len~0), 1698#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1699#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1695#true] [2018-02-04 03:18:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:18:42,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:18:42,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:18:42,887 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 5 states. [2018-02-04 03:18:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:42,931 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-02-04 03:18:42,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:18:42,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 03:18:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:42,932 INFO L225 Difference]: With dead ends: 108 [2018-02-04 03:18:42,932 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 03:18:42,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 03:18:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-04 03:18:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 03:18:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-02-04 03:18:42,935 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 35 [2018-02-04 03:18:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:42,936 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-02-04 03:18:42,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:18:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-02-04 03:18:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:18:42,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:42,936 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:42,936 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:42,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 2 times [2018-02-04 03:18:42,937 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:42,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:42,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:18:42,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,977 INFO L182 omatonBuilderFactory]: Interpolants [1920#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1921#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 1916#true, 1917#false, 1918#(<= 10 entry_point_~len~0), 1919#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0))] [2018-02-04 03:18:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:42,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:18:42,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:18:42,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:42,979 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 6 states. [2018-02-04 03:18:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:43,021 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-04 03:18:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:18:43,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 03:18:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:43,023 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:18:43,023 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:18:43,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:18:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:18:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-04 03:18:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 03:18:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-02-04 03:18:43,028 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-02-04 03:18:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:43,028 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-02-04 03:18:43,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:18:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-02-04 03:18:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:18:43,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:43,030 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:43,030 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 3 times [2018-02-04 03:18:43,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:43,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:43,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:18:43,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,090 INFO L182 omatonBuilderFactory]: Interpolants [2148#true, 2149#false, 2150#(<= 10 entry_point_~len~0), 2151#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2152#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2153#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2154#(<= (+ entry_point_~i~2 7) entry_point_~len~0)] [2018-02-04 03:18:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:18:43,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:18:43,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:18:43,091 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 7 states. [2018-02-04 03:18:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:43,133 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2018-02-04 03:18:43,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:18:43,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-04 03:18:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:43,135 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:18:43,135 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:18:43,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:18:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:18:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-04 03:18:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 03:18:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-04 03:18:43,139 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 43 [2018-02-04 03:18:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:43,140 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-04 03:18:43,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:18:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-04 03:18:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:18:43,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:43,141 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:43,141 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1950591474, now seen corresponding path program 4 times [2018-02-04 03:18:43,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:43,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:43,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:18:43,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,199 INFO L182 omatonBuilderFactory]: Interpolants [2391#true, 2392#false, 2393#(<= 10 entry_point_~len~0), 2394#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2395#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2396#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2397#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2398#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-04 03:18:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:18:43,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:18:43,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:18:43,200 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 8 states. [2018-02-04 03:18:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:43,253 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-02-04 03:18:43,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:18:43,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-04 03:18:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:43,254 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:18:43,254 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:18:43,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:18:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:18:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-04 03:18:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 03:18:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-02-04 03:18:43,258 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 47 [2018-02-04 03:18:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:43,259 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-02-04 03:18:43,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:18:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-02-04 03:18:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:18:43,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:43,260 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:43,260 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash -281679991, now seen corresponding path program 5 times [2018-02-04 03:18:43,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:43,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:43,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:18:43,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,332 INFO L182 omatonBuilderFactory]: Interpolants [2645#true, 2646#false, 2647#(<= 10 entry_point_~len~0), 2648#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2649#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2650#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2651#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2652#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2653#(<= (+ entry_point_~i~2 5) entry_point_~len~0)] [2018-02-04 03:18:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:18:43,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:18:43,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:18:43,333 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 9 states. [2018-02-04 03:18:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:43,415 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-02-04 03:18:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:18:43,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-02-04 03:18:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:43,419 INFO L225 Difference]: With dead ends: 124 [2018-02-04 03:18:43,419 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:18:43,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:18:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:18:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-04 03:18:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:18:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2018-02-04 03:18:43,423 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 51 [2018-02-04 03:18:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:43,423 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2018-02-04 03:18:43,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:18:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2018-02-04 03:18:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:18:43,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:43,424 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:43,424 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 85033376, now seen corresponding path program 6 times [2018-02-04 03:18:43,425 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:43,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:43,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:18:43,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,496 INFO L182 omatonBuilderFactory]: Interpolants [2912#(<= 10 entry_point_~len~0), 2913#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2914#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2915#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2916#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2917#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2918#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2919#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2910#true, 2911#false] [2018-02-04 03:18:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:18:43,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:18:43,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:18:43,497 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand 10 states. [2018-02-04 03:18:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:43,591 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-02-04 03:18:43,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:18:43,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-04 03:18:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:43,593 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:18:43,593 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 03:18:43,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:18:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 03:18:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-02-04 03:18:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:18:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2018-02-04 03:18:43,597 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 55 [2018-02-04 03:18:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:43,597 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2018-02-04 03:18:43,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:18:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-02-04 03:18:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 03:18:43,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:43,598 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:43,599 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:43,599 INFO L82 PathProgramCache]: Analyzing trace with hash 819214391, now seen corresponding path program 7 times [2018-02-04 03:18:43,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:43,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:43,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:18:43,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,708 INFO L182 omatonBuilderFactory]: Interpolants [3186#true, 3187#false, 3188#(<= 10 entry_point_~len~0), 3189#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3190#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3191#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3192#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3193#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3194#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3195#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3196#(<= (+ entry_point_~i~2 3) entry_point_~len~0)] [2018-02-04 03:18:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:18:43,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:18:43,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:18:43,709 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 11 states. [2018-02-04 03:18:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:43,817 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-02-04 03:18:43,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:18:43,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-04 03:18:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:43,819 INFO L225 Difference]: With dead ends: 132 [2018-02-04 03:18:43,819 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 03:18:43,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:18:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 03:18:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-04 03:18:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 03:18:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2018-02-04 03:18:43,823 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 59 [2018-02-04 03:18:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:43,824 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2018-02-04 03:18:43,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:18:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2018-02-04 03:18:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 03:18:43,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:43,825 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:43,825 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1197749426, now seen corresponding path program 8 times [2018-02-04 03:18:43,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:43,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:43,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:18:43,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,915 INFO L182 omatonBuilderFactory]: Interpolants [3473#true, 3474#false, 3475#(<= 10 entry_point_~len~0), 3476#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3477#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3478#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3479#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3480#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3481#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3482#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3483#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3484#(<= (+ entry_point_~i~2 2) entry_point_~len~0)] [2018-02-04 03:18:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:43,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:18:43,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:18:43,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:18:43,916 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand 12 states. [2018-02-04 03:18:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:44,032 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-02-04 03:18:44,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:18:44,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-04 03:18:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:44,032 INFO L225 Difference]: With dead ends: 136 [2018-02-04 03:18:44,033 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 03:18:44,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:18:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 03:18:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-02-04 03:18:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 03:18:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2018-02-04 03:18:44,035 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 63 [2018-02-04 03:18:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:44,035 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2018-02-04 03:18:44,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:18:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2018-02-04 03:18:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 03:18:44,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:44,036 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:44,036 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:44,036 INFO L82 PathProgramCache]: Analyzing trace with hash 497416933, now seen corresponding path program 9 times [2018-02-04 03:18:44,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:44,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:44,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:44,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:18:44,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:44,138 INFO L182 omatonBuilderFactory]: Interpolants [3776#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3777#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3778#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3779#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3780#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3781#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3782#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3783#(<= (+ entry_point_~i~2 1) entry_point_~len~0), 3771#true, 3772#false, 3773#(<= 10 entry_point_~len~0), 3774#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3775#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-04 03:18:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:44,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:18:44,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:18:44,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:18:44,138 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand 13 states. [2018-02-04 03:18:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:44,266 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2018-02-04 03:18:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:18:44,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2018-02-04 03:18:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:44,267 INFO L225 Difference]: With dead ends: 138 [2018-02-04 03:18:44,267 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 03:18:44,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:18:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 03:18:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-04 03:18:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 03:18:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2018-02-04 03:18:44,271 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 67 [2018-02-04 03:18:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:44,272 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2018-02-04 03:18:44,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:18:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2018-02-04 03:18:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 03:18:44,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:44,272 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:44,272 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1940879620, now seen corresponding path program 10 times [2018-02-04 03:18:44,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:44,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 03:18:44,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:44,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:18:44,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:44,311 INFO L182 omatonBuilderFactory]: Interpolants [4080#(<= 10 entry_point_~len~0), 4081#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 4082#(<= |alloc_17_#in~len| 0), 4078#true, 4079#false] [2018-02-04 03:18:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 03:18:44,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:18:44,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:18:44,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:18:44,312 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand 5 states. [2018-02-04 03:18:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:44,336 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2018-02-04 03:18:44,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:18:44,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-02-04 03:18:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:44,337 INFO L225 Difference]: With dead ends: 163 [2018-02-04 03:18:44,337 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 03:18:44,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 03:18:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2018-02-04 03:18:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 03:18:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2018-02-04 03:18:44,342 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 71 [2018-02-04 03:18:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:44,342 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2018-02-04 03:18:44,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:18:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2018-02-04 03:18:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:18:44,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:44,342 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:44,343 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash 114739281, now seen corresponding path program 1 times [2018-02-04 03:18:44,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:44,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:18:44,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:44,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:18:44,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:44,635 INFO L182 omatonBuilderFactory]: Interpolants [4385#true, 4386#false, 4387#(<= 10 entry_point_~len~0), 4388#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4389#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4390#(and (<= 10 entry_point_~len~0) (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 4391#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4392#(and (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 44) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= (select |#valid| entry_point_~array~0.base) 1)), 4393#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 40) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4394#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 36) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4395#(and (<= (+ entry_point_~array~0.offset 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4396#(and (<= 36 (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 4397#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base))), 4398#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 4399#(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|))), 4400#(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|))))), 4401#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base)))] [2018-02-04 03:18:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:18:44,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:18:44,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:18:44,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:18:44,636 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 17 states. [2018-02-04 03:18:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:45,246 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2018-02-04 03:18:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:18:45,246 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-04 03:18:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:45,248 INFO L225 Difference]: With dead ends: 207 [2018-02-04 03:18:45,248 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 03:18:45,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:18:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 03:18:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 151. [2018-02-04 03:18:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 03:18:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2018-02-04 03:18:45,252 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 72 [2018-02-04 03:18:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:45,252 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2018-02-04 03:18:45,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:18:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2018-02-04 03:18:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:18:45,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:45,252 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:45,252 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 114739280, now seen corresponding path program 1 times [2018-02-04 03:18:45,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:45,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 03:18:45,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:45,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:18:45,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:45,357 INFO L182 omatonBuilderFactory]: Interpolants [4786#true, 4787#false, 4788#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4789#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4790#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 4791#(= 1 (select |#valid| entry_point_~array~0.base)), 4792#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 4793#(= 1 (select |#valid| alloc_17_~array.base)), 4794#(= |#valid| |old(#valid)|), 4795#(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|)), 4796#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-04 03:18:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 03:18:45,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:18:45,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:18:45,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:18:45,358 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 11 states. [2018-02-04 03:18:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:45,605 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2018-02-04 03:18:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:18:45,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-04 03:18:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:45,606 INFO L225 Difference]: With dead ends: 193 [2018-02-04 03:18:45,606 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 03:18:45,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:18:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 03:18:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146. [2018-02-04 03:18:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 03:18:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-02-04 03:18:45,609 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 72 [2018-02-04 03:18:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:45,609 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-02-04 03:18:45,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:18:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-02-04 03:18:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 03:18:45,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:45,610 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:45,610 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times [2018-02-04 03:18:45,611 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:45,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:18:45,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:45,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:18:45,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:45,640 INFO L182 omatonBuilderFactory]: Interpolants [5152#(= alloc_17_~i~0 0), 5153#(<= (+ alloc_17_~j~0 1) 0), 5150#true, 5151#false] [2018-02-04 03:18:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:18:45,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:18:45,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:18:45,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:18:45,640 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states. [2018-02-04 03:18:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:45,658 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-04 03:18:45,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:18:45,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 03:18:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:45,659 INFO L225 Difference]: With dead ends: 155 [2018-02-04 03:18:45,660 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 03:18:45,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:18:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 03:18:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-02-04 03:18:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 03:18:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-02-04 03:18:45,662 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73 [2018-02-04 03:18:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:45,663 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-02-04 03:18:45,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:18:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-02-04 03:18:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:18:45,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:45,663 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:45,663 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times [2018-02-04 03:18:45,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:45,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 03:18:45,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:45,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:18:45,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:45,812 INFO L182 omatonBuilderFactory]: Interpolants [5472#(and (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 5460#true, 5461#false, 5462#(= 0 |ldv_malloc_#t~malloc1.offset|), 5463#(= 0 |ldv_malloc_#res.offset|), 5464#(= 0 |entry_point_#t~ret10.offset|), 5465#(= entry_point_~array~0.offset 0), 5466#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5467#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5468#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5469#(= |old(#length)| |#length|), 5470#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 5471#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-04 03:18:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 03:18:45,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:18:45,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:18:45,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:18:45,812 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 13 states. [2018-02-04 03:18:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:46,050 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2018-02-04 03:18:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:18:46,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-02-04 03:18:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:46,051 INFO L225 Difference]: With dead ends: 169 [2018-02-04 03:18:46,051 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 03:18:46,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:18:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 03:18:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2018-02-04 03:18:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 03:18:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-02-04 03:18:46,054 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 81 [2018-02-04 03:18:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:46,054 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-02-04 03:18:46,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:18:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-02-04 03:18:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:18:46,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:46,054 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:46,055 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:46,055 INFO L82 PathProgramCache]: Analyzing trace with hash -600320339, now seen corresponding path program 1 times [2018-02-04 03:18:46,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:46,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:46,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:46,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:18:46,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:46,881 INFO L182 omatonBuilderFactory]: Interpolants [5824#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2))), 5825#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 5826#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5827#(and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 5828#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 5829#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 5830#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 5831#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))))), 5832#(= 0 |free_17_#t~mem9.offset|), 5809#true, 5810#false, 5811#(<= entry_point_~len~0 10), 5812#(= 0 |ldv_malloc_#t~malloc1.offset|), 5813#(= 0 |ldv_malloc_#res.offset|), 5814#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 5815#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 5816#(and (or (and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset))), 5817#(and (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10))) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 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_~i~2))))))), 5818#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 5819#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5820#(or (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= entry_point_~array~0.offset 0)) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))), 5821#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 5822#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= entry_point_~array~0.offset 0))), 5823#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0))))] [2018-02-04 03:18:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:46,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:18:46,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:18:46,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:18:46,882 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 24 states. [2018-02-04 03:18:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:47,787 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2018-02-04 03:18:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:18:47,788 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-04 03:18:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:47,789 INFO L225 Difference]: With dead ends: 192 [2018-02-04 03:18:47,789 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 03:18:47,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=320, Invalid=1750, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:18:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 03:18:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 176. [2018-02-04 03:18:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 03:18:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2018-02-04 03:18:47,797 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 82 [2018-02-04 03:18:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:47,797 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2018-02-04 03:18:47,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:18:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2018-02-04 03:18:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:18:47,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:47,800 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:47,800 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash -600320338, now seen corresponding path program 1 times [2018-02-04 03:18:47,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:47,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:48,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:48,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:18:48,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:48,735 INFO L182 omatonBuilderFactory]: Interpolants [6246#true, 6247#false, 6248#(<= entry_point_~len~0 10), 6249#(= 0 |ldv_malloc_#t~malloc1.offset|), 6250#(= 0 |ldv_malloc_#res.offset|), 6251#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 6252#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 6253#(and (or (and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset))), 6254#(and (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= 0 entry_point_~array~0.offset))) (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)))), 6255#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 6256#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6257#(or (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= entry_point_~array~0.offset 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))), 6258#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6259#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= entry_point_~array~0.offset 0))), 6260#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15)))), 6261#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11)))), 6262#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 6263#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3)))), 6264#(and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 6265#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 6266#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 6267#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 6268#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 6269#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:18:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:48,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:18:48,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:18:48,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:18:48,736 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand 24 states. [2018-02-04 03:18:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:49,362 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2018-02-04 03:18:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:18:49,362 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-04 03:18:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:49,363 INFO L225 Difference]: With dead ends: 191 [2018-02-04 03:18:49,363 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 03:18:49,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 03:18:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 03:18:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-02-04 03:18:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 03:18:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-04 03:18:49,368 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 82 [2018-02-04 03:18:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:49,368 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-04 03:18:49,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:18:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-04 03:18:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 03:18:49,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:49,370 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:49,370 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:49,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1232614021, now seen corresponding path program 1 times [2018-02-04 03:18:49,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:49,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 03:18:49,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:49,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:18:49,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:18:49,429 INFO L182 omatonBuilderFactory]: Interpolants [6678#true, 6679#false, 6680#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 6681#(not (= 0 |ldv_malloc_#res.base|)), 6682#(not (= 0 |alloc_17_#t~ret3.base|)), 6683#(not (= 0 alloc_17_~p~0.base))] [2018-02-04 03:18:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 03:18:49,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:18:49,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:18:49,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:49,430 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 6 states. [2018-02-04 03:18:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:49,454 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-04 03:18:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:18:49,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-04 03:18:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:49,456 INFO L225 Difference]: With dead ends: 155 [2018-02-04 03:18:49,456 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 03:18:49,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:18:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 03:18:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-02-04 03:18:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-04 03:18:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-02-04 03:18:49,460 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 83 [2018-02-04 03:18:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:49,460 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-02-04 03:18:49,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:18:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-02-04 03:18:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 03:18:49,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:49,461 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1] [2018-02-04 03:18:49,461 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1239415694, now seen corresponding path program 1 times [2018-02-04 03:18:49,462 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:49,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 03:18:49,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:49,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:18:49,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:18:49,514 INFO L182 omatonBuilderFactory]: Interpolants [6996#true, 6997#false, 6998#(= alloc_17_~array.base |alloc_17_#in~array.base|), 6999#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 7000#(= 1 (select |#valid| entry_point_~array~0.base)), 7001#(= 1 (select |#valid| |free_17_#in~array.base|)), 7002#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:18:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 03:18:49,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:18:49,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:18:49,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:18:49,515 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 7 states. [2018-02-04 03:18:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:49,622 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2018-02-04 03:18:49,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:18:49,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-02-04 03:18:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:49,625 INFO L225 Difference]: With dead ends: 171 [2018-02-04 03:18:49,625 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 03:18:49,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:18:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 03:18:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2018-02-04 03:18:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 03:18:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-02-04 03:18:49,630 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 84 [2018-02-04 03:18:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:49,630 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-02-04 03:18:49,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:18:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-02-04 03:18:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 03:18:49,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:49,631 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1] [2018-02-04 03:18:49,631 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1239415693, now seen corresponding path program 1 times [2018-02-04 03:18:49,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:49,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 03:18:49,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:49,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:18:49,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:18:49,686 INFO L182 omatonBuilderFactory]: Interpolants [7337#true, 7338#false, 7339#(<= 10 entry_point_~len~0), 7340#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 7341#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 7342#(<= |alloc_17_#in~len| 1)] [2018-02-04 03:18:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 03:18:49,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:18:49,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:18:49,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:49,687 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 6 states. [2018-02-04 03:18:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:49,721 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2018-02-04 03:18:49,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:18:49,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-02-04 03:18:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:49,723 INFO L225 Difference]: With dead ends: 194 [2018-02-04 03:18:49,723 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 03:18:49,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:18:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 03:18:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 162. [2018-02-04 03:18:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 03:18:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 180 transitions. [2018-02-04 03:18:49,726 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 180 transitions. Word has length 84 [2018-02-04 03:18:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:49,727 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 180 transitions. [2018-02-04 03:18:49,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:18:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 180 transitions. [2018-02-04 03:18:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 03:18:49,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:49,728 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-04 03:18:49,728 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:49,728 INFO L82 PathProgramCache]: Analyzing trace with hash 385284538, now seen corresponding path program 1 times [2018-02-04 03:18:49,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:49,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-04 03:18:50,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:50,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:18:50,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:18:50,047 INFO L182 omatonBuilderFactory]: Interpolants [7712#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7713#(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|))), 7714#(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|))))), 7715#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7716#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0)), 7717#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7718#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7719#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7701#true, 7702#false, 7703#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 7704#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7705#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 7706#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7707#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7708#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7709#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7710#(and (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 7711#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0))] [2018-02-04 03:18:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-04 03:18:50,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:18:50,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:18:50,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:18:50,048 INFO L87 Difference]: Start difference. First operand 162 states and 180 transitions. Second operand 19 states. [2018-02-04 03:18:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:50,602 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2018-02-04 03:18:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:18:50,602 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-02-04 03:18:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:50,603 INFO L225 Difference]: With dead ends: 200 [2018-02-04 03:18:50,604 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 03:18:50,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:18:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 03:18:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 161. [2018-02-04 03:18:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 03:18:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 179 transitions. [2018-02-04 03:18:50,608 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 179 transitions. Word has length 85 [2018-02-04 03:18:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:50,608 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 179 transitions. [2018-02-04 03:18:50,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:18:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 179 transitions. [2018-02-04 03:18:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:18:50,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:50,609 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:50,609 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1700760915, now seen corresponding path program 1 times [2018-02-04 03:18:50,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:50,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 03:18:50,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:50,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:18:50,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:18:50,735 INFO L182 omatonBuilderFactory]: Interpolants [8113#true, 8114#false, 8115#(= 0 |ldv_malloc_#t~malloc1.offset|), 8116#(= 0 |ldv_malloc_#res.offset|), 8117#(= 0 |entry_point_#t~ret10.offset|), 8118#(= 0 entry_point_~array~0.offset), 8119#(= 0 |alloc_17_#in~array.offset|), 8120#(= alloc_17_~array.offset 0), 8121#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))), 8122#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8123#(= |old(#length)| |#length|), 8124#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8125#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (<= 0 alloc_17_~j~0) (= alloc_17_~array.offset 0))] [2018-02-04 03:18:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 03:18:50,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:18:50,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:18:50,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:18:50,735 INFO L87 Difference]: Start difference. First operand 161 states and 179 transitions. Second operand 13 states. [2018-02-04 03:18:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:50,924 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2018-02-04 03:18:50,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:18:50,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-04 03:18:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:50,925 INFO L225 Difference]: With dead ends: 161 [2018-02-04 03:18:50,925 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 03:18:50,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:18:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 03:18:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-02-04 03:18:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 03:18:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-02-04 03:18:50,927 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 86 [2018-02-04 03:18:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:50,927 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-02-04 03:18:50,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:18:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-02-04 03:18:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:18:50,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:50,928 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:50,928 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1741617760, now seen corresponding path program 1 times [2018-02-04 03:18:50,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:50,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:18:50,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:18:50,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:18:50,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:50,957 INFO L182 omatonBuilderFactory]: Interpolants [8465#true, 8466#false, 8467#(<= 10 entry_point_~len~0), 8468#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 8469#(<= |free_17_#in~len| 0)] [2018-02-04 03:18:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:18:50,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:18:50,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:18:50,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:18:50,958 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 5 states. [2018-02-04 03:18:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:50,975 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2018-02-04 03:18:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:18:50,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-02-04 03:18:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:50,976 INFO L225 Difference]: With dead ends: 168 [2018-02-04 03:18:50,976 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 03:18:50,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:18:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 03:18:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-02-04 03:18:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 03:18:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2018-02-04 03:18:50,978 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 86 [2018-02-04 03:18:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:50,979 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2018-02-04 03:18:50,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:18:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-02-04 03:18:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 03:18:50,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:50,979 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1] [2018-02-04 03:18:50,979 INFO L371 AbstractCegarLoop]: === Iteration 32 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:50,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1183980822, now seen corresponding path program 1 times [2018-02-04 03:18:50,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:50,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 03:18:51,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:51,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:18:51,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:18:51,218 INFO L182 omatonBuilderFactory]: Interpolants [8800#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 8801#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 8802#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 8803#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 8804#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 8805#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 8806#(= 0 |alloc_17_#t~mem6.offset|), 8792#true, 8793#false, 8794#(= 0 |ldv_malloc_#t~malloc1.offset|), 8795#(= 0 |ldv_malloc_#res.offset|), 8796#(= 0 |entry_point_#t~ret10.offset|), 8797#(= 0 entry_point_~array~0.offset), 8798#(= 0 |alloc_17_#in~array.offset|), 8799#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0))] [2018-02-04 03:18:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 03:18:51,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:18:51,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:18:51,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:18:51,219 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 15 states. [2018-02-04 03:18:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:51,478 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2018-02-04 03:18:51,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:18:51,478 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-04 03:18:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:51,479 INFO L225 Difference]: With dead ends: 176 [2018-02-04 03:18:51,479 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 03:18:51,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:18:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 03:18:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2018-02-04 03:18:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:18:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2018-02-04 03:18:51,483 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 87 [2018-02-04 03:18:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:51,483 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2018-02-04 03:18:51,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:18:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2018-02-04 03:18:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 03:18:51,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:51,484 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1] [2018-02-04 03:18:51,484 INFO L371 AbstractCegarLoop]: === Iteration 33 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:51,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1183980821, now seen corresponding path program 1 times [2018-02-04 03:18:51,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:51,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 03:18:51,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:51,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:18:51,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:18:51,817 INFO L182 omatonBuilderFactory]: Interpolants [9184#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 9185#(= |#valid| |old(#valid)|), 9186#(and (= alloc_17_~array.offset 0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= alloc_17_~j~0 0)), 9187#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 9188#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 9171#true, 9172#false, 9173#(= 0 |ldv_malloc_#t~malloc1.offset|), 9174#(= 0 |ldv_malloc_#res.offset|), 9175#(= 0 |entry_point_#t~ret10.offset|), 9176#(= 0 entry_point_~array~0.offset), 9177#(= 0 |alloc_17_#in~array.offset|), 9178#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 9179#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 9180#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 9181#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 9182#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 9183#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))))] [2018-02-04 03:18:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 03:18:51,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:18:51,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:18:51,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:18:51,818 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 18 states. [2018-02-04 03:18:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:52,148 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2018-02-04 03:18:52,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:18:52,195 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-04 03:18:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:52,196 INFO L225 Difference]: With dead ends: 176 [2018-02-04 03:18:52,196 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 03:18:52,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:18:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 03:18:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2018-02-04 03:18:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 03:18:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2018-02-04 03:18:52,199 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 188 transitions. Word has length 87 [2018-02-04 03:18:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:52,199 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 188 transitions. [2018-02-04 03:18:52,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:18:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 188 transitions. [2018-02-04 03:18:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 03:18:52,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:52,200 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:52,200 INFO L371 AbstractCegarLoop]: === Iteration 34 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2053772611, now seen corresponding path program 1 times [2018-02-04 03:18:52,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:52,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:53,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:53,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:18:53,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:53,082 INFO L182 omatonBuilderFactory]: Interpolants [9558#true, 9559#false, 9560#(<= entry_point_~len~0 10), 9561#(= 0 |ldv_malloc_#t~malloc1.offset|), 9562#(= 0 |ldv_malloc_#res.offset|), 9563#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 9564#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9565#(and (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 10)) (= 0 entry_point_~array~0.offset)), 9566#(and (= 0 entry_point_~array~0.offset) (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~len~0 10))) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 1 (select |#valid| 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~2))))))), 9567#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 9568#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31)))), 9569#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2)))), 9570#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23)))), 9571#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)))), 9572#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15)))), 9573#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11)))), 9574#(and (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))) (= 0 entry_point_~array~0.offset)), 9575#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3)))), 9576#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 9577#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 9578#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9579#(= |#valid| |old(#valid)|), 9580#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 9581#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 1 (select |#valid| free_17_~array.base))), 9582#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 9583#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:18:53,082 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:53,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:18:53,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:18:53,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:18:53,083 INFO L87 Difference]: Start difference. First operand 167 states and 188 transitions. Second operand 26 states. [2018-02-04 03:18:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:53,997 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-02-04 03:18:53,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:18:53,997 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-02-04 03:18:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:53,998 INFO L225 Difference]: With dead ends: 191 [2018-02-04 03:18:53,998 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 03:18:53,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1887, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:18:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 03:18:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 175. [2018-02-04 03:18:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 03:18:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2018-02-04 03:18:54,001 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 87 [2018-02-04 03:18:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:54,001 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2018-02-04 03:18:54,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:18:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2018-02-04 03:18:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 03:18:54,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:54,001 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:54,001 INFO L371 AbstractCegarLoop]: === Iteration 35 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2053772610, now seen corresponding path program 1 times [2018-02-04 03:18:54,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:54,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 03:18:54,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:54,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:18:54,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:18:54,174 INFO L182 omatonBuilderFactory]: Interpolants [9994#true, 9995#false, 9996#(= 0 |ldv_malloc_#t~malloc1.offset|), 9997#(= 0 |ldv_malloc_#res.offset|), 9998#(= 0 |entry_point_#t~ret10.offset|), 9999#(= entry_point_~array~0.offset 0), 10000#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10001#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10002#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10003#(= |old(#length)| |#length|), 10004#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 10005#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10006#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 10007#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10008#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-04 03:18:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 03:18:54,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:18:54,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:18:54,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:18:54,177 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 15 states. [2018-02-04 03:18:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:54,426 INFO L93 Difference]: Finished difference Result 182 states and 200 transitions. [2018-02-04 03:18:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:18:54,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-04 03:18:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:54,427 INFO L225 Difference]: With dead ends: 182 [2018-02-04 03:18:54,427 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 03:18:54,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:18:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 03:18:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2018-02-04 03:18:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 03:18:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2018-02-04 03:18:54,431 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 87 [2018-02-04 03:18:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:54,431 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2018-02-04 03:18:54,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:18:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2018-02-04 03:18:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 03:18:54,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:54,432 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:54,432 INFO L371 AbstractCegarLoop]: === Iteration 36 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:54,432 INFO L82 PathProgramCache]: Analyzing trace with hash 757558551, now seen corresponding path program 1 times [2018-02-04 03:18:54,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:54,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:18:55,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:55,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:18:55,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:55,234 INFO L182 omatonBuilderFactory]: Interpolants [10380#true, 10381#false, 10382#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10383#(= 0 |ldv_malloc_#t~malloc1.offset|), 10384#(= 0 |ldv_malloc_#res.offset|), 10385#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10386#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10387#(and (<= 10 entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10388#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2)), 10389#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 10390#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 10391#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 10392#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))))), 10393#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))))), 10394#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 10395#(and (= entry_point_~array~0.offset 0) (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8))))))), 10396#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 10397#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10398#(and (= 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_~i~2 1) entry_point_~len~0))), 10399#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))), 10400#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10401#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 10402#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 10403#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10404#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:18:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:18:55,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:18:55,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:18:55,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:18:55,235 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand 25 states. [2018-02-04 03:18:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:18:57,479 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-02-04 03:18:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 03:18:57,479 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-04 03:18:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:18:57,480 INFO L225 Difference]: With dead ends: 186 [2018-02-04 03:18:57,480 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 03:18:57,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=610, Invalid=3550, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 03:18:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 03:18:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2018-02-04 03:18:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 03:18:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2018-02-04 03:18:57,483 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 88 [2018-02-04 03:18:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:18:57,483 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2018-02-04 03:18:57,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:18:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2018-02-04 03:18:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 03:18:57,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:18:57,484 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:18:57,484 INFO L371 AbstractCegarLoop]: === Iteration 37 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:18:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 757558552, now seen corresponding path program 1 times [2018-02-04 03:18:57,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:18:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:18:57,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:18:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:18:58,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:18:58,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:18:58,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:18:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:18:58,128 INFO L182 omatonBuilderFactory]: Interpolants [10848#true, 10849#false, 10850#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10851#(= 0 |ldv_malloc_#t~malloc1.offset|), 10852#(= 0 |ldv_malloc_#res.offset|), 10853#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10854#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10855#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10856#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 10857#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 10858#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 10859#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 10860#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 10861#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2)), 10862#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) 4) 7) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 10863#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)) entry_point_~array~0.offset)))), 10864#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 4 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 10865#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10866#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset))))), 10867#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 10868#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 10869#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 10870#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 10871#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10872#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:18:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:18:58,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:18:58,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:18:58,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:18:58,129 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand 25 states. [2018-02-04 03:19:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:00,478 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2018-02-04 03:19:00,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:19:00,478 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-04 03:19:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:00,479 INFO L225 Difference]: With dead ends: 185 [2018-02-04 03:19:00,479 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 03:19:00,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=582, Invalid=3200, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:19:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 03:19:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2018-02-04 03:19:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 03:19:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2018-02-04 03:19:00,483 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 88 [2018-02-04 03:19:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:00,483 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2018-02-04 03:19:00,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2018-02-04 03:19:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:19:00,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:00,484 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-04 03:19:00,485 INFO L371 AbstractCegarLoop]: === Iteration 38 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 360764299, now seen corresponding path program 1 times [2018-02-04 03:19:00,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:00,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-04 03:19:00,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:00,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:19:00,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:00,877 INFO L182 omatonBuilderFactory]: Interpolants [11309#true, 11310#false, 11311#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 11312#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11313#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 11314#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 11315#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 11316#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 11317#(= |#valid| |old(#valid)|), 11318#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 11319#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 11320#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 11321#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 11322#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 11323#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 11324#(and (= alloc_17_~array.offset 0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 1 (select |#valid| alloc_17_~array.base)))) (<= alloc_17_~j~0 0)), 11325#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))), 11326#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 11327#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:19:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-04 03:19:00,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:19:00,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:19:00,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:19:00,878 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand 19 states. [2018-02-04 03:19:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:01,266 INFO L93 Difference]: Finished difference Result 187 states and 208 transitions. [2018-02-04 03:19:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:19:01,266 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-04 03:19:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:01,267 INFO L225 Difference]: With dead ends: 187 [2018-02-04 03:19:01,267 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 03:19:01,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:19:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 03:19:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2018-02-04 03:19:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 03:19:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2018-02-04 03:19:01,269 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 89 [2018-02-04 03:19:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:01,269 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2018-02-04 03:19:01,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:19:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2018-02-04 03:19:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:19:01,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:01,270 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:01,270 INFO L371 AbstractCegarLoop]: === Iteration 39 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash -254194742, now seen corresponding path program 1 times [2018-02-04 03:19:01,271 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:01,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:19:01,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:01,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:19:01,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:01,313 INFO L182 omatonBuilderFactory]: Interpolants [11712#false, 11713#(<= 10 entry_point_~len~0), 11714#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 11715#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 11716#(<= |free_17_#in~len| 1), 11711#true] [2018-02-04 03:19:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:19:01,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:19:01,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:19:01,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:19:01,314 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand 6 states. [2018-02-04 03:19:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:01,334 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-02-04 03:19:01,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:19:01,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-02-04 03:19:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:01,335 INFO L225 Difference]: With dead ends: 199 [2018-02-04 03:19:01,335 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 03:19:01,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:19:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 03:19:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2018-02-04 03:19:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 03:19:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-02-04 03:19:01,337 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 92 [2018-02-04 03:19:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:01,337 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-02-04 03:19:01,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:19:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2018-02-04 03:19:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:19:01,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:01,338 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:01,338 INFO L371 AbstractCegarLoop]: === Iteration 40 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1924314338, now seen corresponding path program 1 times [2018-02-04 03:19:01,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:01,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 03:19:01,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:01,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:19:01,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:19:01,409 INFO L182 omatonBuilderFactory]: Interpolants [12099#true, 12100#false, 12101#(= alloc_17_~array.base |alloc_17_#in~array.base|), 12102#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 12103#(= |#valid| |old(#valid)|), 12104#(= 1 (select |#valid| entry_point_~array~0.base)), 12105#(= 1 (select |#valid| |free_17_#in~array.base|)), 12106#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:19:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 03:19:01,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:19:01,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:19:01,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:19:01,410 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand 8 states. [2018-02-04 03:19:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:01,532 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2018-02-04 03:19:01,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:19:01,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-02-04 03:19:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:01,534 INFO L225 Difference]: With dead ends: 184 [2018-02-04 03:19:01,534 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 03:19:01,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 03:19:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-02-04 03:19:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 03:19:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2018-02-04 03:19:01,537 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 94 [2018-02-04 03:19:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:01,537 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2018-02-04 03:19:01,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:19:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2018-02-04 03:19:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:19:01,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:01,538 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:01,538 INFO L371 AbstractCegarLoop]: === Iteration 41 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:01,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1924314337, now seen corresponding path program 1 times [2018-02-04 03:19:01,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:01,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-04 03:19:01,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:01,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:19:01,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:01,637 INFO L182 omatonBuilderFactory]: Interpolants [12480#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 12481#(not (= |alloc_17_#in~array.offset| 0)), 12471#true, 12472#false, 12473#(= 0 |ldv_malloc_#t~malloc1.offset|), 12474#(= 0 |ldv_malloc_#res.offset|), 12475#(= 0 |entry_point_#t~ret10.offset|), 12476#(= 0 entry_point_~array~0.offset), 12477#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 12478#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 12479#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0))] [2018-02-04 03:19:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-04 03:19:01,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:19:01,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:19:01,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:19:01,638 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand 11 states. [2018-02-04 03:19:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:01,764 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2018-02-04 03:19:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:19:01,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-04 03:19:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:01,764 INFO L225 Difference]: With dead ends: 175 [2018-02-04 03:19:01,764 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 03:19:01,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:19:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 03:19:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-04 03:19:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 03:19:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 191 transitions. [2018-02-04 03:19:01,767 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 191 transitions. Word has length 94 [2018-02-04 03:19:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:01,767 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 191 transitions. [2018-02-04 03:19:01,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:19:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 191 transitions. [2018-02-04 03:19:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 03:19:01,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:01,768 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:01,768 INFO L371 AbstractCegarLoop]: === Iteration 42 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:01,768 INFO L82 PathProgramCache]: Analyzing trace with hash 500549267, now seen corresponding path program 2 times [2018-02-04 03:19:01,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:01,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:02,168 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 40 DAG size of output 28 [2018-02-04 03:19:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:02,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:02,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:19:02,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:02,604 INFO L182 omatonBuilderFactory]: Interpolants [12864#(= 1 (select |#valid| free_17_~array.base)), 12839#true, 12840#false, 12841#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12842#(= 0 |ldv_malloc_#t~malloc1.offset|), 12843#(= 0 |ldv_malloc_#res.offset|), 12844#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 12845#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12846#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12847#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 12848#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 12849#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 12850#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 12851#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2)), 12852#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2)), 12853#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 12854#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))) (= entry_point_~array~0.offset 0)), 12855#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12856#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12857#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 12858#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 12859#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12860#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 12861#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 12862#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 12863#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base)))] [2018-02-04 03:19:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:02,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:19:02,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:19:02,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:02,605 INFO L87 Difference]: Start difference. First operand 172 states and 191 transitions. Second operand 26 states. [2018-02-04 03:19:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:05,001 INFO L93 Difference]: Finished difference Result 186 states and 203 transitions. [2018-02-04 03:19:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 03:19:05,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2018-02-04 03:19:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:05,002 INFO L225 Difference]: With dead ends: 186 [2018-02-04 03:19:05,002 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 03:19:05,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=625, Invalid=3797, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 03:19:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 03:19:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2018-02-04 03:19:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 03:19:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2018-02-04 03:19:05,005 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 93 [2018-02-04 03:19:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:05,005 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2018-02-04 03:19:05,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:19:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2018-02-04 03:19:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:19:05,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:05,006 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 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, 1, 1, 1] [2018-02-04 03:19:05,006 INFO L371 AbstractCegarLoop]: === Iteration 43 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:05,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1474927420, now seen corresponding path program 1 times [2018-02-04 03:19:05,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:05,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 03:19:05,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:05,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:19:05,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:19:05,056 INFO L182 omatonBuilderFactory]: Interpolants [13312#false, 13313#(= alloc_17_~i~0 0), 13314#(<= alloc_17_~i~0 1), 13315#(<= alloc_17_~j~0 0), 13316#(<= (+ alloc_17_~j~0 1) 0), 13311#true] [2018-02-04 03:19:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 03:19:05,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:19:05,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:19:05,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:19:05,057 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand 6 states. [2018-02-04 03:19:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:05,119 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2018-02-04 03:19:05,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:19:05,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-02-04 03:19:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:05,120 INFO L225 Difference]: With dead ends: 182 [2018-02-04 03:19:05,120 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 03:19:05,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:19:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 03:19:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2018-02-04 03:19:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 03:19:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-02-04 03:19:05,123 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 94 [2018-02-04 03:19:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:05,124 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-02-04 03:19:05,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:19:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-02-04 03:19:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:19:05,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:05,125 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:05,125 INFO L371 AbstractCegarLoop]: === Iteration 44 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1662841855, now seen corresponding path program 2 times [2018-02-04 03:19:05,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:05,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:06,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:06,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:06,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:06,037 INFO L182 omatonBuilderFactory]: Interpolants [13696#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 13697#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 13698#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 13699#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 13700#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 13701#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13702#(= 0 |free_17_#t~mem9.offset|), 13678#true, 13679#false, 13680#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13681#(= 0 |ldv_malloc_#t~malloc1.offset|), 13682#(= 0 |ldv_malloc_#res.offset|), 13683#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 13684#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13685#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 13686#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)))))), 13687#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 13688#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))) 4) 3) entry_point_~i~2)), 13689#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))))), 13690#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))))), 13691#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))), 13692#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 13693#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 13694#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 13695#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)))] [2018-02-04 03:19:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:06,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:06,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:06,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:06,037 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 25 states. [2018-02-04 03:19:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:08,092 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-02-04 03:19:08,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:19:08,093 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-04 03:19:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:08,093 INFO L225 Difference]: With dead ends: 186 [2018-02-04 03:19:08,093 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 03:19:08,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=539, Invalid=3493, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 03:19:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 03:19:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2018-02-04 03:19:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 03:19:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 192 transitions. [2018-02-04 03:19:08,097 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 192 transitions. Word has length 94 [2018-02-04 03:19:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:08,097 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 192 transitions. [2018-02-04 03:19:08,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 192 transitions. [2018-02-04 03:19:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:19:08,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:08,097 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:08,098 INFO L371 AbstractCegarLoop]: === Iteration 45 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1662841854, now seen corresponding path program 2 times [2018-02-04 03:19:08,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:08,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:08,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:08,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:08,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:08,926 INFO L182 omatonBuilderFactory]: Interpolants [14144#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 14145#(= 0 |ldv_malloc_#t~malloc1.offset|), 14146#(= 0 |ldv_malloc_#res.offset|), 14147#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 14148#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14149#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14150#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 14151#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)))), 14152#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 14153#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 14154#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 14155#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 14156#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 14157#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset))))), 14158#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 14159#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))))), 14160#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 14161#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 14162#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 14163#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 14164#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 14165#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 14166#(= |free_17_#t~mem9.base| 0), 14142#true, 14143#false] [2018-02-04 03:19:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:08,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:08,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:08,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:08,926 INFO L87 Difference]: Start difference. First operand 174 states and 192 transitions. Second operand 25 states. [2018-02-04 03:19:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:10,912 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-02-04 03:19:10,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 03:19:10,912 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-04 03:19:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:10,913 INFO L225 Difference]: With dead ends: 185 [2018-02-04 03:19:10,913 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 03:19:10,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=501, Invalid=3039, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 03:19:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 03:19:10,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 174. [2018-02-04 03:19:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 03:19:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-02-04 03:19:10,916 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 94 [2018-02-04 03:19:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:10,917 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-02-04 03:19:10,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-02-04 03:19:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 03:19:10,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:10,917 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:10,918 INFO L371 AbstractCegarLoop]: === Iteration 46 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:10,918 INFO L82 PathProgramCache]: Analyzing trace with hash -8536178, now seen corresponding path program 1 times [2018-02-04 03:19:10,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:10,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:19:10,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:10,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:19:10,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:10,977 INFO L182 omatonBuilderFactory]: Interpolants [14597#true, 14598#false, 14599#(<= 10 entry_point_~len~0), 14600#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 14601#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 14602#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 14603#(<= |free_17_#in~len| 2)] [2018-02-04 03:19:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:19:10,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:19:10,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:19:10,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:19:10,977 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 7 states. [2018-02-04 03:19:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:11,022 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2018-02-04 03:19:11,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:19:11,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-02-04 03:19:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:11,023 INFO L225 Difference]: With dead ends: 201 [2018-02-04 03:19:11,024 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 03:19:11,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:19:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 03:19:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2018-02-04 03:19:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 03:19:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2018-02-04 03:19:11,027 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 95 [2018-02-04 03:19:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:11,027 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2018-02-04 03:19:11,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:19:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2018-02-04 03:19:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 03:19:11,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:11,028 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:11,028 INFO L371 AbstractCegarLoop]: === Iteration 47 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:11,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2117886044, now seen corresponding path program 2 times [2018-02-04 03:19:11,029 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:11,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-04 03:19:11,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:11,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:19:11,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:19:11,095 INFO L182 omatonBuilderFactory]: Interpolants [14992#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 14993#(<= |alloc_17_#in~len| 2), 14987#true, 14988#false, 14989#(<= 10 entry_point_~len~0), 14990#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 14991#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1))] [2018-02-04 03:19:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-04 03:19:11,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:19:11,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:19:11,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:19:11,096 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand 7 states. [2018-02-04 03:19:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:11,142 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2018-02-04 03:19:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:19:11,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-02-04 03:19:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:11,144 INFO L225 Difference]: With dead ends: 215 [2018-02-04 03:19:11,144 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 03:19:11,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:19:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 03:19:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2018-02-04 03:19:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 03:19:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2018-02-04 03:19:11,150 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 97 [2018-02-04 03:19:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:11,150 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2018-02-04 03:19:11,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:19:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2018-02-04 03:19:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:19:11,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:11,151 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-04 03:19:11,151 INFO L371 AbstractCegarLoop]: === Iteration 48 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -711355807, now seen corresponding path program 2 times [2018-02-04 03:19:11,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:11,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-04 03:19:11,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:11,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:19:11,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:19:11,545 INFO L182 omatonBuilderFactory]: Interpolants [15397#true, 15398#false, 15399#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15400#(= 0 |ldv_malloc_#t~malloc1.offset|), 15401#(= 0 |ldv_malloc_#res.offset|), 15402#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15403#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15404#(= entry_point_~array~0.offset 0), 15405#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 15406#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))), 15407#(= 0 |alloc_17_#in~array.offset|), 15408#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15409#(= alloc_17_~array.offset 0), 15410#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 15411#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 15412#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (* 4 alloc_17_~i~0)))), 15413#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 15414#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 15415#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-04 03:19:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-04 03:19:11,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:19:11,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:19:11,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:19:11,546 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand 19 states. [2018-02-04 03:19:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:11,783 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2018-02-04 03:19:11,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:19:11,783 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-04 03:19:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:11,784 INFO L225 Difference]: With dead ends: 192 [2018-02-04 03:19:11,784 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 03:19:11,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:19:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 03:19:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2018-02-04 03:19:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 03:19:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 209 transitions. [2018-02-04 03:19:11,786 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 209 transitions. Word has length 100 [2018-02-04 03:19:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:11,787 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 209 transitions. [2018-02-04 03:19:11,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:19:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 209 transitions. [2018-02-04 03:19:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:19:11,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:11,787 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-04 03:19:11,787 INFO L371 AbstractCegarLoop]: === Iteration 49 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash -711355806, now seen corresponding path program 2 times [2018-02-04 03:19:11,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:11,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-04 03:19:12,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:12,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:19:12,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:19:12,138 INFO L182 omatonBuilderFactory]: Interpolants [15840#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 15841#(= |#valid| |old(#valid)|), 15842#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 15843#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 15822#true, 15823#false, 15824#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15825#(= 0 |ldv_malloc_#t~malloc1.offset|), 15826#(= 0 |ldv_malloc_#res.offset|), 15827#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15828#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15829#(= entry_point_~array~0.offset 0), 15830#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 15831#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))), 15832#(= 0 |alloc_17_#in~array.offset|), 15833#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15834#(= alloc_17_~array.offset 0), 15835#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 15836#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 15837#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 15838#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 15839#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))))] [2018-02-04 03:19:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-04 03:19:12,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:19:12,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:19:12,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:19:12,139 INFO L87 Difference]: Start difference. First operand 188 states and 209 transitions. Second operand 22 states. [2018-02-04 03:19:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:12,464 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2018-02-04 03:19:12,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:19:12,465 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-04 03:19:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:12,465 INFO L225 Difference]: With dead ends: 193 [2018-02-04 03:19:12,465 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 03:19:12,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:19:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 03:19:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2018-02-04 03:19:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 03:19:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2018-02-04 03:19:12,468 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 100 [2018-02-04 03:19:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:12,468 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2018-02-04 03:19:12,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:19:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2018-02-04 03:19:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:19:12,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:12,469 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:12,469 INFO L371 AbstractCegarLoop]: === Iteration 50 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2012932585, now seen corresponding path program 3 times [2018-02-04 03:19:12,470 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:12,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 217 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:13,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:13,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:19:13,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:13,197 INFO L182 omatonBuilderFactory]: Interpolants [16264#true, 16265#false, 16266#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 16267#(= 0 |ldv_malloc_#t~malloc1.offset|), 16268#(= 0 |ldv_malloc_#res.offset|), 16269#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 16270#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16271#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16272#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 16273#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 16274#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16275#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 16276#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 16277#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 16278#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16279#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16280#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 16281#(and (or (<= (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 16282#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 16283#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 16284#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 16285#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 16286#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 16287#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 16288#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 16289#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:19:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 217 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:13,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:19:13,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:19:13,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:13,198 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand 26 states. [2018-02-04 03:19:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:15,159 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-02-04 03:19:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 03:19:15,159 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-04 03:19:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:15,160 INFO L225 Difference]: With dead ends: 202 [2018-02-04 03:19:15,160 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 03:19:15,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=554, Invalid=3736, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 03:19:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 03:19:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 193. [2018-02-04 03:19:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 03:19:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2018-02-04 03:19:15,163 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 99 [2018-02-04 03:19:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:15,163 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2018-02-04 03:19:15,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:19:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2018-02-04 03:19:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 03:19:15,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:15,163 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:15,163 INFO L371 AbstractCegarLoop]: === Iteration 51 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1962001838, now seen corresponding path program 1 times [2018-02-04 03:19:15,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:15,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 03:19:15,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:15,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:19:15,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:15,293 INFO L182 omatonBuilderFactory]: Interpolants [16768#(= 0 |ldv_malloc_#t~malloc1.offset|), 16769#(= 0 |ldv_malloc_#res.offset|), 16770#(= 0 |entry_point_#t~ret10.offset|), 16771#(= 0 entry_point_~array~0.offset), 16772#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 16773#(and (or (<= 0 alloc_17_~j~0) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 16774#(and (or (not (= alloc_17_~array.offset 0)) (<= (+ alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 16775#(or (<= 4 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 16776#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 16777#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 16778#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 16766#true, 16767#false] [2018-02-04 03:19:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 03:19:15,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:19:15,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:19:15,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:15,294 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand 13 states. [2018-02-04 03:19:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:15,401 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2018-02-04 03:19:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:19:15,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-02-04 03:19:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:15,402 INFO L225 Difference]: With dead ends: 202 [2018-02-04 03:19:15,402 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 03:19:15,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:19:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 03:19:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 193. [2018-02-04 03:19:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 03:19:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-02-04 03:19:15,405 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 101 [2018-02-04 03:19:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:15,405 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-02-04 03:19:15,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:19:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-02-04 03:19:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:19:15,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:15,406 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:15,407 INFO L371 AbstractCegarLoop]: === Iteration 52 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2023599253, now seen corresponding path program 3 times [2018-02-04 03:19:15,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:15,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 03:19:16,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:16,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:16,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:16,255 INFO L182 omatonBuilderFactory]: Interpolants [17180#true, 17181#false, 17182#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17183#(= 0 |ldv_malloc_#t~malloc1.offset|), 17184#(= 0 |ldv_malloc_#res.offset|), 17185#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17186#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17187#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 40 (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17188#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) 4))) 4) 1) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) 4))))), 17189#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) 4)))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) 4))) 4) 2) entry_point_~i~2)), 17190#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) 4)))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) 4))) 4) 3) entry_point_~i~2)), 17191#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) 4)))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) 4))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 17192#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) 4))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) 4)))) (= entry_point_~array~0.offset 0)), 17193#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) 4)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17194#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17195#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17196#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 17197#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (= entry_point_~array~0.offset 0)), 17198#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 17199#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ 8 4)))), 17200#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ 8 4))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 17201#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)) 4)))), 17202#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))), 17203#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 17204#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:19:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 03:19:16,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:16,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:16,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:16,256 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 25 states. [2018-02-04 03:19:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:18,171 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-02-04 03:19:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 03:19:18,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-04 03:19:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:18,173 INFO L225 Difference]: With dead ends: 206 [2018-02-04 03:19:18,173 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 03:19:18,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=477, Invalid=3429, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 03:19:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 03:19:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2018-02-04 03:19:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 03:19:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2018-02-04 03:19:18,177 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 100 [2018-02-04 03:19:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:18,177 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2018-02-04 03:19:18,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2018-02-04 03:19:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:19:18,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:18,178 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:18,178 INFO L371 AbstractCegarLoop]: === Iteration 53 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2023599252, now seen corresponding path program 3 times [2018-02-04 03:19:18,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:18,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 03:19:19,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:19,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:19,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:19,001 INFO L182 omatonBuilderFactory]: Interpolants [17682#true, 17683#false, 17684#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17685#(= 0 |ldv_malloc_#t~malloc1.offset|), 17686#(= 0 |ldv_malloc_#res.offset|), 17687#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17688#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17689#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17690#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 17691#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)))) 4) 2) entry_point_~i~2)), 17692#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 17693#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2)), 17694#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))))), 17695#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= 0 entry_point_~array~0.offset)), 17696#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))), 17697#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 17698#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 17699#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))), 17700#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 17701#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 17702#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 17703#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 17704#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 17705#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 17706#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:19:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 03:19:19,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:19,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:19,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:19,001 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand 25 states. [2018-02-04 03:19:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:20,671 INFO L93 Difference]: Finished difference Result 205 states and 222 transitions. [2018-02-04 03:19:20,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:19:20,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-04 03:19:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:20,672 INFO L225 Difference]: With dead ends: 205 [2018-02-04 03:19:20,672 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 03:19:20,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=434, Invalid=2872, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:19:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 03:19:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2018-02-04 03:19:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 03:19:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 214 transitions. [2018-02-04 03:19:20,675 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 214 transitions. Word has length 100 [2018-02-04 03:19:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:20,675 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 214 transitions. [2018-02-04 03:19:20,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 214 transitions. [2018-02-04 03:19:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:19:20,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:20,675 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1] [2018-02-04 03:19:20,675 INFO L371 AbstractCegarLoop]: === Iteration 54 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash -713129662, now seen corresponding path program 2 times [2018-02-04 03:19:20,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:20,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:19:21,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:21,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:19:21,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:21,002 INFO L182 omatonBuilderFactory]: Interpolants [18176#(= 0 |ldv_malloc_#t~malloc1.offset|), 18177#(= 0 |ldv_malloc_#res.offset|), 18178#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 18179#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 18180#(= entry_point_~array~0.offset 0), 18181#(and (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) 4)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 18182#(and (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~len~0) (* 4 entry_point_~i~2))) (= entry_point_~array~0.offset 0)), 18183#(= 0 |alloc_17_#in~array.offset|), 18184#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 18185#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18186#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18187#(= |#valid| |old(#valid)|), 18188#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 18189#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 18190#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 18191#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 18192#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 18193#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 18194#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18195#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 18196#(= 1 (select |#valid| alloc_17_~array.base)), 18173#true, 18174#false, 18175#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10))] [2018-02-04 03:19:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:19:21,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:19:21,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:19:21,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:19:21,003 INFO L87 Difference]: Start difference. First operand 194 states and 214 transitions. Second operand 24 states. [2018-02-04 03:19:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:21,457 INFO L93 Difference]: Finished difference Result 210 states and 229 transitions. [2018-02-04 03:19:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:19:21,457 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2018-02-04 03:19:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:21,458 INFO L225 Difference]: With dead ends: 210 [2018-02-04 03:19:21,458 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 03:19:21,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:19:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 03:19:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2018-02-04 03:19:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 03:19:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-02-04 03:19:21,460 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 102 [2018-02-04 03:19:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:21,460 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-02-04 03:19:21,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:19:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-02-04 03:19:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:19:21,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:21,461 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:21,461 INFO L371 AbstractCegarLoop]: === Iteration 55 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:21,461 INFO L82 PathProgramCache]: Analyzing trace with hash 692514855, now seen corresponding path program 1 times [2018-02-04 03:19:21,462 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:21,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 03:19:21,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:21,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:19:21,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:19:21,999 INFO L182 omatonBuilderFactory]: Interpolants [18656#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 18657#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))))), 18658#(or (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))) (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 18659#(or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18660#(or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18661#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18662#(or (<= 1 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18663#(or (<= 0 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18664#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18665#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 18666#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 18667#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 18668#(= 0 |free_17_#t~mem9.offset|), 18648#true, 18649#false, 18650#(= 0 |ldv_malloc_#t~malloc1.offset|), 18651#(= 0 |ldv_malloc_#res.offset|), 18652#(= 0 |entry_point_#t~ret10.offset|), 18653#(= 0 entry_point_~array~0.offset), 18654#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 18655#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= 0 |alloc_17_#t~ret3.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))))] [2018-02-04 03:19:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 03:19:21,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:19:21,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:19:21,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:19:21,999 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand 21 states. [2018-02-04 03:19:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:22,364 INFO L93 Difference]: Finished difference Result 233 states and 258 transitions. [2018-02-04 03:19:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:19:22,365 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-02-04 03:19:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:22,365 INFO L225 Difference]: With dead ends: 233 [2018-02-04 03:19:22,365 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 03:19:22,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:19:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 03:19:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2018-02-04 03:19:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-04 03:19:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 254 transitions. [2018-02-04 03:19:22,367 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 254 transitions. Word has length 102 [2018-02-04 03:19:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:22,367 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 254 transitions. [2018-02-04 03:19:22,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:19:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 254 transitions. [2018-02-04 03:19:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:19:22,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:22,368 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:22,368 INFO L371 AbstractCegarLoop]: === Iteration 56 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash 692514856, now seen corresponding path program 1 times [2018-02-04 03:19:22,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:22,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 03:19:22,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:22,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:19:22,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:22,596 INFO L182 omatonBuilderFactory]: Interpolants [19143#true, 19144#false, 19145#(= 0 |ldv_malloc_#t~malloc1.offset|), 19146#(= 0 |ldv_malloc_#res.offset|), 19147#(= 0 |entry_point_#t~ret10.offset|), 19148#(= 0 entry_point_~array~0.offset), 19149#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19150#(and (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19151#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19152#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 19153#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 19154#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 19155#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 19156#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 19157#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 19158#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:19:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 03:19:22,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:19:22,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:19:22,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:19:22,596 INFO L87 Difference]: Start difference. First operand 224 states and 254 transitions. Second operand 16 states. [2018-02-04 03:19:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:22,818 INFO L93 Difference]: Finished difference Result 260 states and 294 transitions. [2018-02-04 03:19:22,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:19:22,819 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-02-04 03:19:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:22,819 INFO L225 Difference]: With dead ends: 260 [2018-02-04 03:19:22,819 INFO L226 Difference]: Without dead ends: 260 [2018-02-04 03:19:22,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:19:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-04 03:19:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2018-02-04 03:19:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 03:19:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 290 transitions. [2018-02-04 03:19:22,822 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 290 transitions. Word has length 102 [2018-02-04 03:19:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:22,822 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 290 transitions. [2018-02-04 03:19:22,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:19:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 290 transitions. [2018-02-04 03:19:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 03:19:22,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:22,822 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:22,822 INFO L371 AbstractCegarLoop]: === Iteration 57 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1692886372, now seen corresponding path program 2 times [2018-02-04 03:19:22,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:22,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:19:22,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:22,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:19:22,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:22,874 INFO L182 omatonBuilderFactory]: Interpolants [19684#true, 19685#false, 19686#(<= 10 entry_point_~len~0), 19687#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 19688#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 19689#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 19690#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 19691#(<= |free_17_#in~len| 3)] [2018-02-04 03:19:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:19:22,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:19:22,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:19:22,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:19:22,874 INFO L87 Difference]: Start difference. First operand 251 states and 290 transitions. Second operand 8 states. [2018-02-04 03:19:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:22,919 INFO L93 Difference]: Finished difference Result 305 states and 353 transitions. [2018-02-04 03:19:22,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:19:22,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-02-04 03:19:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:22,920 INFO L225 Difference]: With dead ends: 305 [2018-02-04 03:19:22,920 INFO L226 Difference]: Without dead ends: 297 [2018-02-04 03:19:22,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:19:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-02-04 03:19:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 269. [2018-02-04 03:19:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 03:19:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 319 transitions. [2018-02-04 03:19:22,923 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 319 transitions. Word has length 101 [2018-02-04 03:19:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:22,924 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 319 transitions. [2018-02-04 03:19:22,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:19:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 319 transitions. [2018-02-04 03:19:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 03:19:22,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:22,925 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:22,925 INFO L371 AbstractCegarLoop]: === Iteration 58 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:22,925 INFO L82 PathProgramCache]: Analyzing trace with hash 567391423, now seen corresponding path program 4 times [2018-02-04 03:19:22,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:22,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 226 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 03:19:23,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:23,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:19:23,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:23,656 INFO L182 omatonBuilderFactory]: Interpolants [20288#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 20289#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 20290#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 20291#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 20292#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 20293#(= 1 (select |#valid| free_17_~array.base)), 20268#true, 20269#false, 20270#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 20271#(= 0 |ldv_malloc_#t~malloc1.offset|), 20272#(= 0 |ldv_malloc_#res.offset|), 20273#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 20274#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 20275#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 20276#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 20277#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)))) 4) 2) entry_point_~i~2)), 20278#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 20279#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2)), 20280#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))))), 20281#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 20282#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 20283#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 20284#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 20285#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))), 20286#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 20287#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|))] [2018-02-04 03:19:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 226 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 03:19:23,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:19:23,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:19:23,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:23,657 INFO L87 Difference]: Start difference. First operand 269 states and 319 transitions. Second operand 26 states. [2018-02-04 03:19:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:25,370 INFO L93 Difference]: Finished difference Result 283 states and 331 transitions. [2018-02-04 03:19:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:19:25,370 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-02-04 03:19:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:25,371 INFO L225 Difference]: With dead ends: 283 [2018-02-04 03:19:25,371 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 03:19:25,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=492, Invalid=3668, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 03:19:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 03:19:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 274. [2018-02-04 03:19:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 03:19:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 325 transitions. [2018-02-04 03:19:25,373 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 325 transitions. Word has length 105 [2018-02-04 03:19:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:25,373 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 325 transitions. [2018-02-04 03:19:25,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:19:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 325 transitions. [2018-02-04 03:19:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 03:19:25,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:25,374 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1] [2018-02-04 03:19:25,374 INFO L371 AbstractCegarLoop]: === Iteration 59 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:25,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2092361700, now seen corresponding path program 1 times [2018-02-04 03:19:25,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:25,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-04 03:19:25,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:25,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:19:25,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:19:25,700 INFO L182 omatonBuilderFactory]: Interpolants [20930#true, 20931#false, 20932#(= 0 |ldv_malloc_#t~malloc1.offset|), 20933#(= 0 |ldv_malloc_#res.offset|), 20934#(= 0 |entry_point_#t~ret10.offset|), 20935#(= 0 entry_point_~array~0.offset), 20936#(= 0 |alloc_17_#in~array.offset|), 20937#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 20938#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 20939#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 20940#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 20941#(and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 20942#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0)), 20943#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))), 20944#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 20945#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 20946#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 20947#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-04 03:19:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-04 03:19:25,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:19:25,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:19:25,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:19:25,700 INFO L87 Difference]: Start difference. First operand 274 states and 325 transitions. Second operand 18 states. [2018-02-04 03:19:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:26,122 INFO L93 Difference]: Finished difference Result 301 states and 355 transitions. [2018-02-04 03:19:26,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:19:26,122 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-02-04 03:19:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:26,123 INFO L225 Difference]: With dead ends: 301 [2018-02-04 03:19:26,123 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 03:19:26,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:19:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 03:19:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 291. [2018-02-04 03:19:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-04 03:19:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 347 transitions. [2018-02-04 03:19:26,126 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 347 transitions. Word has length 107 [2018-02-04 03:19:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:26,126 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 347 transitions. [2018-02-04 03:19:26,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:19:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 347 transitions. [2018-02-04 03:19:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 03:19:26,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:26,127 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1] [2018-02-04 03:19:26,127 INFO L371 AbstractCegarLoop]: === Iteration 60 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2092361701, now seen corresponding path program 2 times [2018-02-04 03:19:26,127 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:26,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 13 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:19:27,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:27,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:19:27,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:27,192 INFO L182 omatonBuilderFactory]: Interpolants [21574#true, 21575#false, 21576#(= 0 (select |#valid| 0)), 21577#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10)), 21578#(= (select |old(#valid)| 0) (select |#valid| 0)), 21579#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 21580#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 21581#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 21582#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 21583#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 21584#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0))) (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) 4)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 21585#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0)))), 21586#(and (= 0 (select |#valid| 0)) (= 0 |alloc_17_#in~array.offset|)), 21587#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 21588#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 21589#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 21590#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 21591#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |#valid| 0))), 21592#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= 0 (select |#valid| 0))), 21593#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 21594#(= |#valid| |old(#valid)|), 21595#(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)), 21596#(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|))))), 21597#(and (= alloc_17_~array.offset 0) (or (and (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (not (= 0 |alloc_17_#t~ret3.base|))) (<= (* 4 alloc_17_~i~0) 3))), 21598#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 1) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (not (= 0 alloc_17_~p~0.base)) (<= (* 4 alloc_17_~i~0) 3))), 21599#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (<= (* 4 alloc_17_~i~0) 3) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4)))) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4)), 21600#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7)) (<= (* 4 alloc_17_~i~0) 8) (or (<= (* 4 alloc_17_~i~0) 7) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))))), 21601#(and (= alloc_17_~array.offset 0) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3))), 21602#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= |alloc_17_#t~mem6.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (or (not (= 1 (select |#valid| |alloc_17_#t~mem6.base|))) (and (<= alloc_17_~j~0 1) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))))))), 21603#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 1)))), 21604#(and (= alloc_17_~array.offset 0) (or (and (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0))), 21605#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 21606#(= 1 (select |#valid| |alloc_17_#t~mem6.base|))] [2018-02-04 03:19:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 13 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:19:27,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:19:27,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:19:27,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:19:27,192 INFO L87 Difference]: Start difference. First operand 291 states and 347 transitions. Second operand 33 states. [2018-02-04 03:19:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:28,514 INFO L93 Difference]: Finished difference Result 301 states and 353 transitions. [2018-02-04 03:19:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:19:28,514 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2018-02-04 03:19:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:28,515 INFO L225 Difference]: With dead ends: 301 [2018-02-04 03:19:28,515 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 03:19:28,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=564, Invalid=3726, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 03:19:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 03:19:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 291. [2018-02-04 03:19:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-04 03:19:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 346 transitions. [2018-02-04 03:19:28,518 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 346 transitions. Word has length 107 [2018-02-04 03:19:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:28,518 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 346 transitions. [2018-02-04 03:19:28,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:19:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 346 transitions. [2018-02-04 03:19:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 03:19:28,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:28,519 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:28,519 INFO L371 AbstractCegarLoop]: === Iteration 61 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:28,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2093109885, now seen corresponding path program 1 times [2018-02-04 03:19:28,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:28,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 03:19:28,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:28,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:19:28,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:28,815 INFO L182 omatonBuilderFactory]: Interpolants [22272#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 22273#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 22274#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 22275#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 22276#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 22277#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) entry_point_~array~0.base))), 22278#(and (= 0 |free_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|)) (= 1 (select |#valid| |free_17_#in~array.base|))), 22279#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 22280#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 22281#(= 1 (select |#valid| free_17_~array.base)), 22265#true, 22266#false, 22267#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 22268#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 22269#(and (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 22270#(and (= 0 entry_point_~array~0.offset) (not (= 0 entry_point_~array~0.base))), 22271#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))] [2018-02-04 03:19:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 03:19:28,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:19:28,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:19:28,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:19:28,816 INFO L87 Difference]: Start difference. First operand 291 states and 346 transitions. Second operand 17 states. [2018-02-04 03:19:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:29,086 INFO L93 Difference]: Finished difference Result 293 states and 344 transitions. [2018-02-04 03:19:29,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:19:29,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-02-04 03:19:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:29,088 INFO L225 Difference]: With dead ends: 293 [2018-02-04 03:19:29,088 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 03:19:29,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 03:19:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-02-04 03:19:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-04 03:19:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 344 transitions. [2018-02-04 03:19:29,090 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 344 transitions. Word has length 107 [2018-02-04 03:19:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:29,090 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 344 transitions. [2018-02-04 03:19:29,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:19:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 344 transitions. [2018-02-04 03:19:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 03:19:29,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:29,091 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:29,091 INFO L371 AbstractCegarLoop]: === Iteration 62 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2093109884, now seen corresponding path program 1 times [2018-02-04 03:19:29,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:29,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-04 03:19:29,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:29,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:19:29,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:29,393 INFO L182 omatonBuilderFactory]: Interpolants [22884#true, 22885#false, 22886#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 22887#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 22888#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 22889#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22890#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22891#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22892#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22893#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 22894#(and (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 22895#(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|))), 22896#(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|))))), 22897#(and (or (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= 0 (select |old(#valid)| alloc_17_~array.base))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 22898#(= |old(#length)| |#length|), 22899#(or (= 0 (select |old(#valid)| |alloc_17_#in~array.base|)) (= (select |old(#length)| |alloc_17_#in~array.base|) (select |#length| |alloc_17_#in~array.base|))), 22900#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 22901#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 22902#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 22903#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 22904#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 22905#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-04 03:19:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-04 03:19:29,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:19:29,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:19:29,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:19:29,394 INFO L87 Difference]: Start difference. First operand 291 states and 344 transitions. Second operand 22 states. [2018-02-04 03:19:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:29,906 INFO L93 Difference]: Finished difference Result 306 states and 350 transitions. [2018-02-04 03:19:29,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:19:29,907 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-02-04 03:19:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:29,908 INFO L225 Difference]: With dead ends: 306 [2018-02-04 03:19:29,908 INFO L226 Difference]: Without dead ends: 306 [2018-02-04 03:19:29,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:19:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-04 03:19:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 291. [2018-02-04 03:19:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-04 03:19:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 341 transitions. [2018-02-04 03:19:29,910 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 341 transitions. Word has length 107 [2018-02-04 03:19:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:29,911 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 341 transitions. [2018-02-04 03:19:29,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:19:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 341 transitions. [2018-02-04 03:19:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 03:19:29,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:29,911 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:29,911 INFO L371 AbstractCegarLoop]: === Iteration 63 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:29,911 INFO L82 PathProgramCache]: Analyzing trace with hash 409264981, now seen corresponding path program 4 times [2018-02-04 03:19:29,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:29,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 03:19:30,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:30,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:30,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:30,596 INFO L182 omatonBuilderFactory]: Interpolants [23552#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 16)) (= free_17_~array.offset 0)), 23553#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12)))) (= free_17_~array.offset 0)), 23554#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 23555#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 23556#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 23557#(= 0 |free_17_#t~mem9.offset|), 23533#true, 23534#false, 23535#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 23536#(= 0 |ldv_malloc_#t~malloc1.offset|), 23537#(= 0 |ldv_malloc_#res.offset|), 23538#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 23539#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 23540#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 23541#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 23542#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 23543#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 23544#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 23545#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23546#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 16 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))) (= 0 entry_point_~array~0.offset)), 23547#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23548#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 23549#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))), 23550#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 23551#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|))] [2018-02-04 03:19:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 03:19:30,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:30,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:30,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:30,596 INFO L87 Difference]: Start difference. First operand 291 states and 341 transitions. Second operand 25 states. [2018-02-04 03:19:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:32,229 INFO L93 Difference]: Finished difference Result 304 states and 351 transitions. [2018-02-04 03:19:32,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:19:32,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-02-04 03:19:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:32,230 INFO L225 Difference]: With dead ends: 304 [2018-02-04 03:19:32,230 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 03:19:32,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:19:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 03:19:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2018-02-04 03:19:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 03:19:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 343 transitions. [2018-02-04 03:19:32,232 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 343 transitions. Word has length 106 [2018-02-04 03:19:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:32,232 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 343 transitions. [2018-02-04 03:19:32,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 343 transitions. [2018-02-04 03:19:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 03:19:32,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:32,233 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:32,233 INFO L371 AbstractCegarLoop]: === Iteration 64 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash 409264982, now seen corresponding path program 4 times [2018-02-04 03:19:32,234 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:32,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 03:19:32,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:32,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:32,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:32,852 INFO L182 omatonBuilderFactory]: Interpolants [24229#true, 24230#false, 24231#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 24232#(= 0 |ldv_malloc_#t~malloc1.offset|), 24233#(= 0 |ldv_malloc_#res.offset|), 24234#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 24235#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 24236#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 24237#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 24238#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 24239#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 24240#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24))) (- entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 24241#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 24242#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 16)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 24243#(and (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 24244#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 24245#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (= entry_point_~array~0.offset 0)), 24246#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 24247#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 24248#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 24249#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12)))) (= free_17_~array.offset 0)), 24250#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 24251#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 24252#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 24253#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:19:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 03:19:32,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:32,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:32,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:32,853 INFO L87 Difference]: Start difference. First operand 292 states and 343 transitions. Second operand 25 states. [2018-02-04 03:19:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:34,344 INFO L93 Difference]: Finished difference Result 303 states and 350 transitions. [2018-02-04 03:19:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:19:34,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-02-04 03:19:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:34,345 INFO L225 Difference]: With dead ends: 303 [2018-02-04 03:19:34,345 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 03:19:34,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=371, Invalid=2709, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:19:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 03:19:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-02-04 03:19:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 03:19:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 342 transitions. [2018-02-04 03:19:34,348 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 342 transitions. Word has length 106 [2018-02-04 03:19:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:34,348 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 342 transitions. [2018-02-04 03:19:34,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 342 transitions. [2018-02-04 03:19:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 03:19:34,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:34,349 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:34,349 INFO L371 AbstractCegarLoop]: === Iteration 65 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -461896943, now seen corresponding path program 1 times [2018-02-04 03:19:34,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:34,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:35,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:35,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 03:19:35,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:35,786 INFO L182 omatonBuilderFactory]: Interpolants [24912#true, 24913#false, 24914#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 24915#(= 0 |ldv_malloc_#t~malloc1.offset|), 24916#(= 0 |ldv_malloc_#res.offset|), 24917#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 24918#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 24919#(and (<= 10 entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 24920#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 24921#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 24922#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 24923#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 24924#(and (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)))), 24925#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 6) entry_point_~i~2)), 24926#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 24927#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 24928#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 4 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))) (= entry_point_~array~0.offset 0)), 24929#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 24930#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 24931#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 24932#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 24933#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24934#(and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24935#(and (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24936#(or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 24937#(or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 24938#(and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24939#(and (or (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24940#(and (or (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24941#(and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24942#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 24943#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 24944#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 24945#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:19:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:35,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 03:19:35,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 03:19:35,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:19:35,787 INFO L87 Difference]: Start difference. First operand 292 states and 342 transitions. Second operand 34 states. [2018-02-04 03:19:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:39,373 INFO L93 Difference]: Finished difference Result 304 states and 349 transitions. [2018-02-04 03:19:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 03:19:39,373 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2018-02-04 03:19:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:39,374 INFO L225 Difference]: With dead ends: 304 [2018-02-04 03:19:39,374 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 03:19:39,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=749, Invalid=5571, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 03:19:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 03:19:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2018-02-04 03:19:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 03:19:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 341 transitions. [2018-02-04 03:19:39,379 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 341 transitions. Word has length 108 [2018-02-04 03:19:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:39,379 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 341 transitions. [2018-02-04 03:19:39,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 03:19:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 341 transitions. [2018-02-04 03:19:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 03:19:39,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:39,381 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:39,381 INFO L371 AbstractCegarLoop]: === Iteration 66 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash -461896942, now seen corresponding path program 1 times [2018-02-04 03:19:39,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:39,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:40,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:40,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:19:40,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:40,611 INFO L182 omatonBuilderFactory]: Interpolants [25664#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 25665#(= |free_17_#t~mem9.base| 0), 25634#true, 25635#false, 25636#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 25637#(= 0 |ldv_malloc_#t~malloc1.offset|), 25638#(= 0 |ldv_malloc_#res.offset|), 25639#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 25640#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 25641#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 25642#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 25643#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 25644#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25645#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 25646#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2)), 25647#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2)), 25648#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25649#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))), 25650#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 25651#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 25652#(and (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))) (= entry_point_~array~0.offset 0)), 25653#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 25654#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 25655#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25656#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25657#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25658#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25659#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 25660#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0))), 25661#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 25662#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 25663#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-04 03:19:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:40,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:19:40,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:19:40,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:19:40,611 INFO L87 Difference]: Start difference. First operand 292 states and 341 transitions. Second operand 32 states. [2018-02-04 03:19:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:44,017 INFO L93 Difference]: Finished difference Result 303 states and 348 transitions. [2018-02-04 03:19:44,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 03:19:44,018 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 108 [2018-02-04 03:19:44,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:44,019 INFO L225 Difference]: With dead ends: 303 [2018-02-04 03:19:44,019 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 03:19:44,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=684, Invalid=4572, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 03:19:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 03:19:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-02-04 03:19:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 03:19:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 340 transitions. [2018-02-04 03:19:44,023 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 340 transitions. Word has length 108 [2018-02-04 03:19:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:44,024 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 340 transitions. [2018-02-04 03:19:44,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:19:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 340 transitions. [2018-02-04 03:19:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 03:19:44,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:44,025 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:44,025 INFO L371 AbstractCegarLoop]: === Iteration 67 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash -197733702, now seen corresponding path program 3 times [2018-02-04 03:19:44,026 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:44,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:19:44,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:44,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:19:44,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:44,120 INFO L182 omatonBuilderFactory]: Interpolants [26343#true, 26344#false, 26345#(<= 10 entry_point_~len~0), 26346#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 26347#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 26348#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 26349#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 26350#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 4)), 26351#(<= |free_17_#in~len| 4)] [2018-02-04 03:19:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:19:44,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:19:44,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:19:44,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:19:44,121 INFO L87 Difference]: Start difference. First operand 292 states and 340 transitions. Second operand 9 states. [2018-02-04 03:19:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:44,154 INFO L93 Difference]: Finished difference Result 350 states and 401 transitions. [2018-02-04 03:19:44,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:19:44,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2018-02-04 03:19:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:44,155 INFO L225 Difference]: With dead ends: 350 [2018-02-04 03:19:44,155 INFO L226 Difference]: Without dead ends: 342 [2018-02-04 03:19:44,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:19:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-04 03:19:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 310. [2018-02-04 03:19:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-04 03:19:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 368 transitions. [2018-02-04 03:19:44,158 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 368 transitions. Word has length 107 [2018-02-04 03:19:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:44,158 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 368 transitions. [2018-02-04 03:19:44,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:19:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 368 transitions. [2018-02-04 03:19:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 03:19:44,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:44,159 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 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, 1] [2018-02-04 03:19:44,159 INFO L371 AbstractCegarLoop]: === Iteration 68 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash 714899973, now seen corresponding path program 1 times [2018-02-04 03:19:44,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:44,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-04 03:19:44,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:44,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:19:44,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:44,945 INFO L182 omatonBuilderFactory]: Interpolants [27014#true, 27015#false, 27016#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 27017#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 27018#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 27019#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|) (= 1 (select |#valid| |entry_point_#t~ret10.base|))), 27020#(and (= 1 (select |#valid| entry_point_~array~0.base)) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 27021#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 27022#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (or (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 27023#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= (* 4 entry_point_~len~0) (* 4 entry_point_~i~2))))), 27024#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 27025#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 27026#(= |#valid| |old(#valid)|), 27027#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 27028#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 27029#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 27030#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 27031#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 27032#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (and (<= (* 4 alloc_17_~i~0) 4) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 27033#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (and (<= (* 4 alloc_17_~i~0) 8) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 27034#(and (= alloc_17_~array.offset 0) (or (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3)) (<= alloc_17_~j~0 1)), 27035#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 1) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))), 27036#(and (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0)) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 0)), 27037#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| alloc_17_~array.base))), 27038#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 27039#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:19:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-04 03:19:44,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:19:44,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:19:44,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:44,946 INFO L87 Difference]: Start difference. First operand 310 states and 368 transitions. Second operand 26 states. [2018-02-04 03:19:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:45,515 INFO L93 Difference]: Finished difference Result 319 states and 374 transitions. [2018-02-04 03:19:45,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:19:45,515 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-02-04 03:19:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:45,516 INFO L225 Difference]: With dead ends: 319 [2018-02-04 03:19:45,516 INFO L226 Difference]: Without dead ends: 319 [2018-02-04 03:19:45,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=1658, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 03:19:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-04 03:19:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 306. [2018-02-04 03:19:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-04 03:19:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 363 transitions. [2018-02-04 03:19:45,518 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 363 transitions. Word has length 109 [2018-02-04 03:19:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:45,519 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 363 transitions. [2018-02-04 03:19:45,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:19:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 363 transitions. [2018-02-04 03:19:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:19:45,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:45,519 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:45,519 INFO L371 AbstractCegarLoop]: === Iteration 69 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:45,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2011462498, now seen corresponding path program 1 times [2018-02-04 03:19:45,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:45,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-04 03:19:45,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:45,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:19:45,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 03:19:45,564 INFO L182 omatonBuilderFactory]: Interpolants [27701#true, 27702#false, 27703#(<= 10 entry_point_~len~0), 27704#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 27705#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 27706#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 27707#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 27708#(<= |alloc_17_#in~len| 3)] [2018-02-04 03:19:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-04 03:19:45,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:19:45,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:19:45,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:19:45,565 INFO L87 Difference]: Start difference. First operand 306 states and 363 transitions. Second operand 8 states. [2018-02-04 03:19:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:45,605 INFO L93 Difference]: Finished difference Result 345 states and 405 transitions. [2018-02-04 03:19:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:19:45,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-02-04 03:19:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:45,606 INFO L225 Difference]: With dead ends: 345 [2018-02-04 03:19:45,606 INFO L226 Difference]: Without dead ends: 342 [2018-02-04 03:19:45,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:19:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-04 03:19:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 312. [2018-02-04 03:19:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 03:19:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 369 transitions. [2018-02-04 03:19:45,609 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 369 transitions. Word has length 111 [2018-02-04 03:19:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:45,609 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 369 transitions. [2018-02-04 03:19:45,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:19:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 369 transitions. [2018-02-04 03:19:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:19:45,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:45,610 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:45,610 INFO L371 AbstractCegarLoop]: === Iteration 70 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1985906453, now seen corresponding path program 5 times [2018-02-04 03:19:45,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:45,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 03:19:46,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:46,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:19:46,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:46,257 INFO L182 omatonBuilderFactory]: Interpolants [28368#true, 28369#false, 28370#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 28371#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 28372#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 28373#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 28374#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 28375#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) entry_point_~array~0.base))), 28376#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 28377#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 28378#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 28379#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 28380#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 28381#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)))), 28382#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 28383#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base))) (= entry_point_~array~0.offset 0)), 28384#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 28385#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 28386#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16) |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 28387#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 16) free_17_~array.base))), 28388#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12))) free_17_~array.base)) (= free_17_~array.offset 0)), 28389#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))) free_17_~array.base)) (= free_17_~array.offset 0)), 28390#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))) free_17_~array.base)) (= free_17_~array.offset 0)), 28391#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))) free_17_~array.base)) (= free_17_~array.offset 0)), 28392#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 28393#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:19:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 03:19:46,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:19:46,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:19:46,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:46,257 INFO L87 Difference]: Start difference. First operand 312 states and 369 transitions. Second operand 26 states. [2018-02-04 03:19:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:48,227 INFO L93 Difference]: Finished difference Result 326 states and 381 transitions. [2018-02-04 03:19:48,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:19:48,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2018-02-04 03:19:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:48,228 INFO L225 Difference]: With dead ends: 326 [2018-02-04 03:19:48,228 INFO L226 Difference]: Without dead ends: 326 [2018-02-04 03:19:48,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=445, Invalid=3715, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 03:19:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-04 03:19:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 317. [2018-02-04 03:19:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-04 03:19:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 375 transitions. [2018-02-04 03:19:48,231 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 375 transitions. Word has length 111 [2018-02-04 03:19:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:48,231 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 375 transitions. [2018-02-04 03:19:48,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:19:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 375 transitions. [2018-02-04 03:19:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 03:19:48,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:48,232 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:48,232 INFO L371 AbstractCegarLoop]: === Iteration 71 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1698028761, now seen corresponding path program 2 times [2018-02-04 03:19:48,232 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:48,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 1 proven. 220 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:49,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:49,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 03:19:49,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:49,810 INFO L182 omatonBuilderFactory]: Interpolants [29120#(= 0 |ldv_malloc_#res.offset|), 29121#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 29122#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 29123#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 29124#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 29125#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 29126#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 29127#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 29128#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2)), 29129#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2)), 29130#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 29131#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))) (= 0 entry_point_~array~0.offset)), 29132#(and (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 29133#(and (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 29134#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 29135#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 29136#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 29137#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29138#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29139#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29140#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29141#(and (or (and (<= 0 alloc_17_~j~0) (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29142#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= 1 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 29143#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= 0 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 29144#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 29145#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 29146#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 29147#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= 1 (select |#valid| free_17_~array.base)) (= free_17_~array.offset 0)), 29148#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= |free_17_#t~mem9.base| 0) (= free_17_~i~1 0) (= 1 (select |#valid| free_17_~array.base)) (= free_17_~array.offset 0)), 29149#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~i~1 0) (= 1 (select |#valid| free_17_~array.base)) (= free_17_~array.offset 0)), 29150#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 1 (select |#valid| free_17_~array.base)) (= free_17_~array.offset 0)), 29151#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 29152#(= 1 (select |#valid| free_17_~array.base)), 29116#true, 29117#false, 29118#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 29119#(= 0 |ldv_malloc_#t~malloc1.offset|)] [2018-02-04 03:19:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 1 proven. 220 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:49,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 03:19:49,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 03:19:49,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1235, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:19:49,810 INFO L87 Difference]: Start difference. First operand 317 states and 375 transitions. Second operand 37 states. [2018-02-04 03:19:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:53,745 INFO L93 Difference]: Finished difference Result 327 states and 382 transitions. [2018-02-04 03:19:53,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 03:19:53,745 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2018-02-04 03:19:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:53,746 INFO L225 Difference]: With dead ends: 327 [2018-02-04 03:19:53,746 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 03:19:53,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=714, Invalid=6258, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 03:19:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 03:19:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2018-02-04 03:19:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-04 03:19:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 374 transitions. [2018-02-04 03:19:53,749 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 374 transitions. Word has length 113 [2018-02-04 03:19:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:53,749 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 374 transitions. [2018-02-04 03:19:53,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 03:19:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 374 transitions. [2018-02-04 03:19:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 03:19:53,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:53,749 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:53,749 INFO L371 AbstractCegarLoop]: === Iteration 72 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1433557951, now seen corresponding path program 5 times [2018-02-04 03:19:53,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:53,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 5 proven. 222 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:19:54,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:54,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:54,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:54,283 INFO L182 omatonBuilderFactory]: Interpolants [29891#true, 29892#false, 29893#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 29894#(= 0 |ldv_malloc_#t~malloc1.offset|), 29895#(= 0 |ldv_malloc_#res.offset|), 29896#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 29897#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 29898#(and (<= 40 (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 29899#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)))) 4) 1) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)))))), 29900#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 29901#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))) 4) 3) entry_point_~i~2)), 29902#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 29903#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 20)))) (= entry_point_~array~0.offset 0)), 29904#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 29905#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 29906#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (= entry_point_~array~0.offset 0)), 29907#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 29908#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 20))), 29909#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 20)) (= free_17_~array.offset 0)), 29910#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 16))))), 29911#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 29912#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 29913#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 29914#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 29915#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:19:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 5 proven. 222 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:19:54,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:54,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:54,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:54,284 INFO L87 Difference]: Start difference. First operand 317 states and 374 transitions. Second operand 25 states. [2018-02-04 03:19:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:55,722 INFO L93 Difference]: Finished difference Result 330 states and 384 transitions. [2018-02-04 03:19:55,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 03:19:55,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-04 03:19:55,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:55,723 INFO L225 Difference]: With dead ends: 330 [2018-02-04 03:19:55,723 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 03:19:55,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=375, Invalid=3285, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 03:19:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 03:19:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 318. [2018-02-04 03:19:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-04 03:19:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 376 transitions. [2018-02-04 03:19:55,725 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 376 transitions. Word has length 112 [2018-02-04 03:19:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:55,725 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 376 transitions. [2018-02-04 03:19:55,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 376 transitions. [2018-02-04 03:19:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 03:19:55,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:55,726 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:55,726 INFO L371 AbstractCegarLoop]: === Iteration 73 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1433557952, now seen corresponding path program 5 times [2018-02-04 03:19:55,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:55,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 5 proven. 222 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:19:56,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:56,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:56,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:56,219 INFO L182 omatonBuilderFactory]: Interpolants [30656#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 16))))), 30657#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 30658#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 30659#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 30660#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 30661#(= |free_17_#t~mem9.base| 0), 30637#true, 30638#false, 30639#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 30640#(= 0 |ldv_malloc_#t~malloc1.offset|), 30641#(= 0 |ldv_malloc_#res.offset|), 30642#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 30643#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 30644#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 30645#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)))))), 30646#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 30647#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))))), 30648#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 30649#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 20))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 30650#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 30651#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 30652#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (= entry_point_~array~0.offset 0)), 30653#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 30654#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 20))), 30655#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 20)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-04 03:19:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 5 proven. 222 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:19:56,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:56,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:56,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:56,219 INFO L87 Difference]: Start difference. First operand 318 states and 376 transitions. Second operand 25 states. [2018-02-04 03:19:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:57,483 INFO L93 Difference]: Finished difference Result 329 states and 383 transitions. [2018-02-04 03:19:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:19:57,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-04 03:19:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:57,484 INFO L225 Difference]: With dead ends: 329 [2018-02-04 03:19:57,484 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 03:19:57,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=317, Invalid=2545, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 03:19:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 03:19:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 318. [2018-02-04 03:19:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-04 03:19:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 375 transitions. [2018-02-04 03:19:57,487 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 375 transitions. Word has length 112 [2018-02-04 03:19:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:57,487 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 375 transitions. [2018-02-04 03:19:57,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 375 transitions. [2018-02-04 03:19:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-04 03:19:57,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:57,487 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:57,487 INFO L371 AbstractCegarLoop]: === Iteration 74 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:57,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1664451536, now seen corresponding path program 2 times [2018-02-04 03:19:57,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:57,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-02-04 03:19:57,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:57,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:19:57,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:19:57,639 INFO L182 omatonBuilderFactory]: Interpolants [31368#true, 31369#false, 31370#(= 0 |ldv_malloc_#t~malloc1.offset|), 31371#(= 0 |ldv_malloc_#res.offset|), 31372#(= 0 |entry_point_#t~ret10.offset|), 31373#(= 0 entry_point_~array~0.offset), 31374#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 31375#(and (or (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 31376#(and (or (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 31377#(and (or (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 31378#(and (or (not (= alloc_17_~array.offset 0)) (<= 4 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 31379#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 31380#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 31381#(not (= |alloc_17_#in~array.offset| 0))] [2018-02-04 03:19:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-02-04 03:19:57,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:19:57,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:19:57,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:19:57,640 INFO L87 Difference]: Start difference. First operand 318 states and 375 transitions. Second operand 14 states. [2018-02-04 03:19:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:57,791 INFO L93 Difference]: Finished difference Result 331 states and 389 transitions. [2018-02-04 03:19:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:19:57,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-02-04 03:19:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:57,792 INFO L225 Difference]: With dead ends: 331 [2018-02-04 03:19:57,792 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 03:19:57,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:19:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 03:19:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-04 03:19:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 03:19:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 385 transitions. [2018-02-04 03:19:57,794 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 385 transitions. Word has length 115 [2018-02-04 03:19:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:57,794 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 385 transitions. [2018-02-04 03:19:57,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:19:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 385 transitions. [2018-02-04 03:19:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 03:19:57,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:57,795 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:57,795 INFO L371 AbstractCegarLoop]: === Iteration 75 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1099284091, now seen corresponding path program 2 times [2018-02-04 03:19:57,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:57,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 214 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:19:59,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:59,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:19:59,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:59,135 INFO L182 omatonBuilderFactory]: Interpolants [32064#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))), 32065#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (= entry_point_~array~0.offset 0)) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 32066#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 32067#(or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~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_~len~0) (+ (* 4 entry_point_~i~2) 12)))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 32068#(or (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 32069#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 32070#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 32071#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= alloc_17_~array.offset 0)))), 32072#(and (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 32073#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 32074#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 32075#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (<= 0 alloc_17_~j~0) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 32076#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= 1 (* 4 alloc_17_~j~0)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= 1 (* 4 alloc_17_~j~0)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 32077#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (<= 0 (+ (* 4 alloc_17_~j~0) 3)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= 0 (+ (* 4 alloc_17_~j~0) 3)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 32078#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 32079#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 32080#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 32081#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 32082#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 32083#(= 0 |free_17_#t~mem9.offset|), 32051#true, 32052#false, 32053#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 32054#(= 0 |ldv_malloc_#t~malloc1.offset|), 32055#(= 0 |ldv_malloc_#res.offset|), 32056#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 32057#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 32058#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 32059#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)))))), 32060#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 32061#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))) 4) 3) entry_point_~i~2)), 32062#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)))))), 32063#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))))] [2018-02-04 03:19:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 214 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:19:59,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:19:59,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:19:59,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:19:59,136 INFO L87 Difference]: Start difference. First operand 328 states and 385 transitions. Second operand 33 states. [2018-02-04 03:20:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:02,216 INFO L93 Difference]: Finished difference Result 340 states and 392 transitions. [2018-02-04 03:20:02,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 03:20:02,216 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 114 [2018-02-04 03:20:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:02,217 INFO L225 Difference]: With dead ends: 340 [2018-02-04 03:20:02,217 INFO L226 Difference]: Without dead ends: 340 [2018-02-04 03:20:02,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=674, Invalid=5178, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 03:20:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-04 03:20:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 328. [2018-02-04 03:20:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 03:20:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 384 transitions. [2018-02-04 03:20:02,219 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 384 transitions. Word has length 114 [2018-02-04 03:20:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:02,220 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 384 transitions. [2018-02-04 03:20:02,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:20:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 384 transitions. [2018-02-04 03:20:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 03:20:02,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:02,220 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:02,220 INFO L371 AbstractCegarLoop]: === Iteration 76 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1099284092, now seen corresponding path program 2 times [2018-02-04 03:20:02,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:02,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 214 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:20:03,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:03,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:20:03,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:03,835 INFO L182 omatonBuilderFactory]: Interpolants [32840#true, 32841#false, 32842#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 32843#(= 0 |ldv_malloc_#t~malloc1.offset|), 32844#(= 0 |ldv_malloc_#res.offset|), 32845#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 32846#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 32847#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 32848#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 32849#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)))), 32850#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 32851#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 32852#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 32853#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 32854#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 32855#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 32856#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)))))), 32857#(and (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 32858#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 32859#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 32860#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 32861#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 32862#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 32863#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 32864#(and (or (and (<= 0 alloc_17_~j~0) (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 32865#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= 1 (* 4 alloc_17_~j~0)) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0)) (<= 1 (* 4 alloc_17_~j~0))))), 32866#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (<= 0 (+ (* 4 alloc_17_~j~0) 3))) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= 0 (+ (* 4 alloc_17_~j~0) 3))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))), 32867#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 32868#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 32869#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 32870#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 32871#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 32872#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:20:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 214 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:20:03,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:20:03,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:20:03,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:20:03,835 INFO L87 Difference]: Start difference. First operand 328 states and 384 transitions. Second operand 33 states. [2018-02-04 03:20:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:06,880 INFO L93 Difference]: Finished difference Result 339 states and 391 transitions. [2018-02-04 03:20:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 03:20:06,880 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 114 [2018-02-04 03:20:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:06,881 INFO L225 Difference]: With dead ends: 339 [2018-02-04 03:20:06,881 INFO L226 Difference]: Without dead ends: 339 [2018-02-04 03:20:06,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=620, Invalid=4636, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 03:20:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-04 03:20:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-02-04 03:20:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 03:20:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 383 transitions. [2018-02-04 03:20:06,884 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 383 transitions. Word has length 114 [2018-02-04 03:20:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:06,885 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 383 transitions. [2018-02-04 03:20:06,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:20:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 383 transitions. [2018-02-04 03:20:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 03:20:06,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:06,885 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:06,885 INFO L371 AbstractCegarLoop]: === Iteration 77 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1490577296, now seen corresponding path program 4 times [2018-02-04 03:20:06,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:06,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:20:06,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:06,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:20:06,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:06,951 INFO L182 omatonBuilderFactory]: Interpolants [33620#true, 33621#false, 33622#(<= 10 entry_point_~len~0), 33623#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 33624#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 33625#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 33626#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 33627#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 4)), 33628#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 5)), 33629#(<= |free_17_#in~len| 5)] [2018-02-04 03:20:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:20:06,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:20:06,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:20:06,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:20:06,952 INFO L87 Difference]: Start difference. First operand 328 states and 383 transitions. Second operand 10 states. [2018-02-04 03:20:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:06,983 INFO L93 Difference]: Finished difference Result 390 states and 444 transitions. [2018-02-04 03:20:06,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:20:06,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-02-04 03:20:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:06,985 INFO L225 Difference]: With dead ends: 390 [2018-02-04 03:20:06,985 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 03:20:06,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:20:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 03:20:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 346. [2018-02-04 03:20:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-04 03:20:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 411 transitions. [2018-02-04 03:20:06,987 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 411 transitions. Word has length 113 [2018-02-04 03:20:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:06,987 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 411 transitions. [2018-02-04 03:20:06,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:20:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 411 transitions. [2018-02-04 03:20:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 03:20:06,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:06,988 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 7, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:06,988 INFO L371 AbstractCegarLoop]: === Iteration 78 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:06,988 INFO L82 PathProgramCache]: Analyzing trace with hash -740441877, now seen corresponding path program 6 times [2018-02-04 03:20:06,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:07,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:20:07,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:07,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:20:07,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:07,654 INFO L182 omatonBuilderFactory]: Interpolants [34368#true, 34369#false, 34370#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 34371#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 34372#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 34373#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 34374#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 34375#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) entry_point_~array~0.base))), 34376#(and (= 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~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 34377#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 34378#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 34379#(and (= 0 entry_point_~array~0.offset) (or (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 34380#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 20 entry_point_~array~0.offset)) entry_point_~array~0.base))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= 0 entry_point_~array~0.offset)), 34381#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 20 entry_point_~array~0.offset)) entry_point_~array~0.base))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 34382#(and (= 0 entry_point_~array~0.offset) (or (<= (+ entry_point_~i~2 1) entry_point_~len~0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 20 entry_point_~array~0.offset)) entry_point_~array~0.base)))), 34383#(and (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 20 entry_point_~array~0.offset)) entry_point_~array~0.base))), 34384#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 34385#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 20) |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 34386#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 20) free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 34387#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 16))) free_17_~array.base)) (= free_17_~array.offset 0)), 34388#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12))) free_17_~array.base)) (= free_17_~array.offset 0)), 34389#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))) free_17_~array.base)) (= free_17_~array.offset 0)), 34390#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4))) free_17_~array.base)) (= free_17_~array.offset 0)), 34391#(not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)), 34392#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 34393#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:20:07,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:20:07,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:20:07,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:20:07,655 INFO L87 Difference]: Start difference. First operand 346 states and 411 transitions. Second operand 26 states. [2018-02-04 03:20:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:09,213 INFO L93 Difference]: Finished difference Result 360 states and 423 transitions. [2018-02-04 03:20:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 03:20:09,214 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-04 03:20:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:09,214 INFO L225 Difference]: With dead ends: 360 [2018-02-04 03:20:09,214 INFO L226 Difference]: Without dead ends: 360 [2018-02-04 03:20:09,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=405, Invalid=3627, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 03:20:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-02-04 03:20:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 351. [2018-02-04 03:20:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-04 03:20:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 417 transitions. [2018-02-04 03:20:09,217 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 417 transitions. Word has length 117 [2018-02-04 03:20:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:09,217 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 417 transitions. [2018-02-04 03:20:09,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:20:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 417 transitions. [2018-02-04 03:20:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 03:20:09,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:09,218 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1] [2018-02-04 03:20:09,218 INFO L371 AbstractCegarLoop]: === Iteration 79 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1078932955, now seen corresponding path program 2 times [2018-02-04 03:20:09,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:09,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 35 proven. 137 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-02-04 03:20:09,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:09,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:20:09,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:20:09,736 INFO L182 omatonBuilderFactory]: Interpolants [35200#(and (= alloc_17_~array.offset 0) (or (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))))), 35201#(and (= alloc_17_~array.offset 0) (or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4)))))), 35202#(and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4)))) (= alloc_17_~array.offset 0)), 35203#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 35204#(= 0 |alloc_17_#t~mem6.offset|), 35182#true, 35183#false, 35184#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 35185#(= 0 |ldv_malloc_#t~malloc1.offset|), 35186#(= 0 |ldv_malloc_#res.offset|), 35187#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 35188#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 35189#(= entry_point_~array~0.offset 0), 35190#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 35191#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 35192#(= 0 |alloc_17_#in~array.offset|), 35193#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 35194#(= alloc_17_~array.offset 0), 35195#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 35196#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 35197#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.offset 0)), 35198#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 35199#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8)))))] [2018-02-04 03:20:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 35 proven. 137 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-02-04 03:20:09,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:20:09,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:20:09,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:20:09,736 INFO L87 Difference]: Start difference. First operand 351 states and 417 transitions. Second operand 23 states. [2018-02-04 03:20:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:10,112 INFO L93 Difference]: Finished difference Result 361 states and 427 transitions. [2018-02-04 03:20:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:20:10,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 120 [2018-02-04 03:20:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:10,113 INFO L225 Difference]: With dead ends: 361 [2018-02-04 03:20:10,113 INFO L226 Difference]: Without dead ends: 361 [2018-02-04 03:20:10,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 12 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=1557, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:20:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-04 03:20:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 353. [2018-02-04 03:20:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-04 03:20:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 420 transitions. [2018-02-04 03:20:10,115 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 420 transitions. Word has length 120 [2018-02-04 03:20:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:10,115 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 420 transitions. [2018-02-04 03:20:10,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:20:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 420 transitions. [2018-02-04 03:20:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 03:20:10,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:10,116 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1] [2018-02-04 03:20:10,116 INFO L371 AbstractCegarLoop]: === Iteration 80 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1078932956, now seen corresponding path program 3 times [2018-02-04 03:20:10,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:10,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 58 proven. 139 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-02-04 03:20:10,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:10,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 03:20:10,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 03:20:10,899 INFO L182 omatonBuilderFactory]: Interpolants [35968#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 35969#(= 0 |alloc_17_#in~array.offset|), 35970#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 35971#(= alloc_17_~array.offset 0), 35972#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 35973#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 35974#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 35975#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 35976#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 35977#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 35978#(= |#valid| |old(#valid)|), 35979#(and (not (= 0 |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|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 35980#(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|))))), 35981#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0) (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 |alloc_17_#t~ret3.base|))), 35982#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 alloc_17_~p~0.base)) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 35983#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 35984#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 35985#(and (= alloc_17_~array.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 35986#(and (= alloc_17_~array.offset 0) (not (= 0 |alloc_17_#t~mem6.base|)) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 35987#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 35988#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 35989#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 35959#true, 35960#false, 35961#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 35962#(= 0 |ldv_malloc_#t~malloc1.offset|), 35963#(= 0 |ldv_malloc_#res.offset|), 35964#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 35965#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 35966#(= entry_point_~array~0.offset 0), 35967#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0))] [2018-02-04 03:20:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 58 proven. 139 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-02-04 03:20:10,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 03:20:10,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 03:20:10,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:20:10,899 INFO L87 Difference]: Start difference. First operand 353 states and 420 transitions. Second operand 31 states. [2018-02-04 03:20:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:11,695 INFO L93 Difference]: Finished difference Result 357 states and 421 transitions. [2018-02-04 03:20:11,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 03:20:11,695 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 120 [2018-02-04 03:20:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:11,696 INFO L225 Difference]: With dead ends: 357 [2018-02-04 03:20:11,696 INFO L226 Difference]: Without dead ends: 357 [2018-02-04 03:20:11,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=3411, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:20:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-04 03:20:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2018-02-04 03:20:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-04 03:20:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 419 transitions. [2018-02-04 03:20:11,698 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 419 transitions. Word has length 120 [2018-02-04 03:20:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:11,699 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 419 transitions. [2018-02-04 03:20:11,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 03:20:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 419 transitions. [2018-02-04 03:20:11,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 03:20:11,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:11,699 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:11,699 INFO L371 AbstractCegarLoop]: === Iteration 81 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash -144264273, now seen corresponding path program 3 times [2018-02-04 03:20:11,700 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:11,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 5 proven. 226 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 03:20:13,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:13,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 03:20:13,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:13,140 INFO L182 omatonBuilderFactory]: Interpolants [36763#true, 36764#false, 36765#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 36766#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 36767#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 36768#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 36769#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 36770#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) entry_point_~array~0.base))), 36771#(and (= 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~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 36772#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 36773#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 36774#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= 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~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 36775#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 36776#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 36777#(or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) entry_point_~array~0.base)))), 36778#(or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) entry_point_~array~0.base))) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 36779#(or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) entry_point_~array~0.base)))), 36780#(or (and (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)) entry_point_~array~0.base))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 36781#(and (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)) entry_point_~array~0.base))), 36782#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 36783#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 36784#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 36785#(not (= 0 |ldv_malloc_#res.base|)), 36786#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (and (not (= 0 |alloc_17_#t~ret3.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 36787#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (not (= 0 alloc_17_~p~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 36788#(and (or (and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 36789#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 36790#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 36791#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 36792#(or (<= 0 alloc_17_~j~0) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0))), 36793#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 36794#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8) |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 36795#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 8) free_17_~array.base)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 36796#(not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))) free_17_~array.base)), 36797#(not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)), 36798#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 36799#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 5 proven. 226 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 03:20:13,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 03:20:13,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 03:20:13,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:20:13,140 INFO L87 Difference]: Start difference. First operand 353 states and 419 transitions. Second operand 37 states. [2018-02-04 03:20:16,435 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 68 DAG size of output 62 [2018-02-04 03:20:16,739 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 74 DAG size of output 67 [2018-02-04 03:20:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:17,102 INFO L93 Difference]: Finished difference Result 373 states and 435 transitions. [2018-02-04 03:20:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 03:20:17,102 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 119 [2018-02-04 03:20:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:17,103 INFO L225 Difference]: With dead ends: 373 [2018-02-04 03:20:17,103 INFO L226 Difference]: Without dead ends: 373 [2018-02-04 03:20:17,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 10 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=751, Invalid=6905, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 03:20:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-04 03:20:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 353. [2018-02-04 03:20:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-04 03:20:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 418 transitions. [2018-02-04 03:20:17,105 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 418 transitions. Word has length 119 [2018-02-04 03:20:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:17,106 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 418 transitions. [2018-02-04 03:20:17,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 03:20:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 418 transitions. [2018-02-04 03:20:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:20:17,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:17,106 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 7, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:17,106 INFO L371 AbstractCegarLoop]: === Iteration 82 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:17,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1478861655, now seen corresponding path program 6 times [2018-02-04 03:20:17,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:17,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 6 proven. 232 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:20:17,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:17,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:20:17,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:17,625 INFO L182 omatonBuilderFactory]: Interpolants [37632#(= 0 |ldv_malloc_#t~malloc1.offset|), 37633#(= 0 |ldv_malloc_#res.offset|), 37634#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 37635#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 37636#(and (<= 10 entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 37637#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 37638#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 37639#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 37640#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))))), 37641#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 37642#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 37643#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 24 entry_point_~array~0.offset)))), 37644#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 37645#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 24))), 37646#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 24))), 37647#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 20))) (= free_17_~array.offset 0)), 37648#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 37649#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 12)))), 37650#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 37651#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 37652#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 37653#(= 0 |free_17_#t~mem9.offset|), 37629#true, 37630#false, 37631#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10))] [2018-02-04 03:20:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 6 proven. 232 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:20:17,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:20:17,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:20:17,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:17,625 INFO L87 Difference]: Start difference. First operand 353 states and 418 transitions. Second operand 25 states. [2018-02-04 03:20:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:19,093 INFO L93 Difference]: Finished difference Result 366 states and 428 transitions. [2018-02-04 03:20:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 03:20:19,094 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 118 [2018-02-04 03:20:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:19,094 INFO L225 Difference]: With dead ends: 366 [2018-02-04 03:20:19,095 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 03:20:19,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=340, Invalid=3200, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 03:20:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 03:20:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 354. [2018-02-04 03:20:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 03:20:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 420 transitions. [2018-02-04 03:20:19,097 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 420 transitions. Word has length 118 [2018-02-04 03:20:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:19,097 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 420 transitions. [2018-02-04 03:20:19,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:20:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 420 transitions. [2018-02-04 03:20:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-04 03:20:19,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:19,098 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 7, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:19,098 INFO L371 AbstractCegarLoop]: === Iteration 83 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1478861654, now seen corresponding path program 6 times [2018-02-04 03:20:19,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:19,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 6 proven. 232 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:20:19,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:19,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:20:19,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:19,576 INFO L182 omatonBuilderFactory]: Interpolants [38464#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 38465#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 12))) (= free_17_~array.offset 0)), 38466#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 38467#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 38468#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 38469#(= |free_17_#t~mem9.base| 0), 38445#true, 38446#false, 38447#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 38448#(= 0 |ldv_malloc_#t~malloc1.offset|), 38449#(= 0 |ldv_malloc_#res.offset|), 38450#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 38451#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 38452#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 38453#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 38454#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 38455#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))))), 38456#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 38457#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28))))))), 38458#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24))))))), 38459#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 24)))), 38460#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 38461#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 24)) (= 0 |free_17_#in~array.offset|)), 38462#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 24)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 38463#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 20))) (= free_17_~array.offset 0))] [2018-02-04 03:20:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 6 proven. 232 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:20:19,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:20:19,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:20:19,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:19,576 INFO L87 Difference]: Start difference. First operand 354 states and 420 transitions. Second operand 25 states. [2018-02-04 03:20:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:20,744 INFO L93 Difference]: Finished difference Result 365 states and 427 transitions. [2018-02-04 03:20:20,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:20:20,744 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 118 [2018-02-04 03:20:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:20,745 INFO L225 Difference]: With dead ends: 365 [2018-02-04 03:20:20,745 INFO L226 Difference]: Without dead ends: 365 [2018-02-04 03:20:20,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 03:20:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-04 03:20:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 354. [2018-02-04 03:20:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 03:20:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 419 transitions. [2018-02-04 03:20:20,748 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 419 transitions. Word has length 118 [2018-02-04 03:20:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:20,748 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 419 transitions. [2018-02-04 03:20:20,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:20:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 419 transitions. [2018-02-04 03:20:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 03:20:20,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:20,749 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:20,749 INFO L371 AbstractCegarLoop]: === Iteration 84 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -177225115, now seen corresponding path program 3 times [2018-02-04 03:20:20,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:20,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 3 proven. 218 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:20:21,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:21,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:20:21,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:21,727 INFO L182 omatonBuilderFactory]: Interpolants [39244#true, 39245#false, 39246#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 39247#(= 0 |ldv_malloc_#t~malloc1.offset|), 39248#(= 0 |ldv_malloc_#res.offset|), 39249#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 39250#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 39251#(and (<= 10 entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 39252#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 39253#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 39254#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 39255#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 39256#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2)), 39257#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 39258#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 12 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 39259#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))) (= entry_point_~array~0.offset 0)), 39260#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 39261#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 39262#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 39263#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= alloc_17_~array.offset 0)))), 39264#(and (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 39265#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 39266#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 39267#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 39268#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 39269#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 39270#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 12))), 39271#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 39272#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 39273#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 39274#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 39275#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:20:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 3 proven. 218 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:20:21,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:20:21,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:20:21,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:20:21,728 INFO L87 Difference]: Start difference. First operand 354 states and 419 transitions. Second operand 32 states. [2018-02-04 03:20:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:24,157 INFO L93 Difference]: Finished difference Result 366 states and 426 transitions. [2018-02-04 03:20:24,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 03:20:24,157 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 120 [2018-02-04 03:20:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:24,158 INFO L225 Difference]: With dead ends: 366 [2018-02-04 03:20:24,158 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 03:20:24,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=608, Invalid=4794, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 03:20:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 03:20:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 354. [2018-02-04 03:20:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 03:20:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 418 transitions. [2018-02-04 03:20:24,160 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 418 transitions. Word has length 120 [2018-02-04 03:20:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:24,160 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 418 transitions. [2018-02-04 03:20:24,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:20:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 418 transitions. [2018-02-04 03:20:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 03:20:24,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:24,161 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:24,161 INFO L371 AbstractCegarLoop]: === Iteration 85 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -177225114, now seen corresponding path program 3 times [2018-02-04 03:20:24,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:24,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 3 proven. 218 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:20:25,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:25,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:20:25,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:25,112 INFO L182 omatonBuilderFactory]: Interpolants [40080#true, 40081#false, 40082#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 40083#(= 0 |ldv_malloc_#t~malloc1.offset|), 40084#(= 0 |ldv_malloc_#res.offset|), 40085#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 40086#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 40087#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 40088#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 40089#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset)))), 40090#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 40091#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 40092#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2)), 40093#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 40094#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 12 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 40095#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 40096#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 40097#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset)))), 40098#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 40099#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 40100#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 40101#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 40102#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 40103#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 40104#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0))), 40105#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 40106#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 40107#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 40108#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 40109#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 40110#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 40111#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:20:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 3 proven. 218 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:20:25,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:20:25,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:20:25,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:20:25,113 INFO L87 Difference]: Start difference. First operand 354 states and 418 transitions. Second operand 32 states. [2018-02-04 03:20:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:27,676 INFO L93 Difference]: Finished difference Result 365 states and 425 transitions. [2018-02-04 03:20:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 03:20:27,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 120 [2018-02-04 03:20:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:27,677 INFO L225 Difference]: With dead ends: 365 [2018-02-04 03:20:27,677 INFO L226 Difference]: Without dead ends: 365 [2018-02-04 03:20:27,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=545, Invalid=4147, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 03:20:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-04 03:20:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 354. [2018-02-04 03:20:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 03:20:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 417 transitions. [2018-02-04 03:20:27,680 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 417 transitions. Word has length 120 [2018-02-04 03:20:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:27,681 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 417 transitions. [2018-02-04 03:20:27,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:20:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 417 transitions. [2018-02-04 03:20:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 03:20:27,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:27,681 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:27,682 INFO L371 AbstractCegarLoop]: === Iteration 86 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1399882726, now seen corresponding path program 5 times [2018-02-04 03:20:27,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:27,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:20:27,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:27,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:20:27,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:27,745 INFO L182 omatonBuilderFactory]: Interpolants [40912#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 4)), 40913#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 5)), 40914#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 6)), 40915#(<= |free_17_#in~len| 6), 40905#true, 40906#false, 40907#(<= 10 entry_point_~len~0), 40908#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 40909#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 40910#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 40911#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3))] [2018-02-04 03:20:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:20:27,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:20:27,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:20:27,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:20:27,745 INFO L87 Difference]: Start difference. First operand 354 states and 417 transitions. Second operand 11 states. [2018-02-04 03:20:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:27,776 INFO L93 Difference]: Finished difference Result 420 states and 478 transitions. [2018-02-04 03:20:27,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:20:27,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 119 [2018-02-04 03:20:27,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:27,777 INFO L225 Difference]: With dead ends: 420 [2018-02-04 03:20:27,777 INFO L226 Difference]: Without dead ends: 412 [2018-02-04 03:20:27,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:20:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-04 03:20:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 372. [2018-02-04 03:20:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-04 03:20:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 445 transitions. [2018-02-04 03:20:27,780 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 445 transitions. Word has length 119 [2018-02-04 03:20:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:27,780 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 445 transitions. [2018-02-04 03:20:27,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:20:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 445 transitions. [2018-02-04 03:20:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 03:20:27,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:27,780 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2018-02-04 03:20:27,780 INFO L371 AbstractCegarLoop]: === Iteration 87 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1767452220, now seen corresponding path program 2 times [2018-02-04 03:20:27,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:27,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 35 proven. 153 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-02-04 03:20:28,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:28,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:20:28,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:20:28,357 INFO L182 omatonBuilderFactory]: Interpolants [41728#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 41729#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.offset 0)), 41730#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 41731#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8)))))), 41732#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 41733#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4)))))), 41734#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 41735#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 41736#(= 1 (select |#valid| alloc_17_~array.base)), 41710#true, 41711#false, 41712#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 41713#(= 0 |ldv_malloc_#t~malloc1.offset|), 41714#(= 0 |ldv_malloc_#res.offset|), 41715#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 41716#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 41717#(= entry_point_~array~0.offset 0), 41718#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 41719#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 41720#(= 0 |alloc_17_#in~array.offset|), 41721#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 41722#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 41723#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 41724#(= |#valid| |old(#valid)|), 41725#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 41726#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 41727#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|)))] [2018-02-04 03:20:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 35 proven. 153 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-02-04 03:20:28,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:20:28,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:20:28,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:20:28,358 INFO L87 Difference]: Start difference. First operand 372 states and 445 transitions. Second operand 27 states. [2018-02-04 03:20:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:29,038 INFO L93 Difference]: Finished difference Result 388 states and 460 transitions. [2018-02-04 03:20:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 03:20:29,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-02-04 03:20:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:29,039 INFO L225 Difference]: With dead ends: 388 [2018-02-04 03:20:29,039 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 03:20:29,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=380, Invalid=3280, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 03:20:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 03:20:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 374. [2018-02-04 03:20:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 03:20:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 447 transitions. [2018-02-04 03:20:29,042 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 447 transitions. Word has length 122 [2018-02-04 03:20:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:29,042 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 447 transitions. [2018-02-04 03:20:29,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:20:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 447 transitions. [2018-02-04 03:20:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 03:20:29,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:29,042 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2018-02-04 03:20:29,043 INFO L371 AbstractCegarLoop]: === Iteration 88 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash -624420883, now seen corresponding path program 3 times [2018-02-04 03:20:29,043 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:29,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-02-04 03:20:29,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:29,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:20:29,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:20:29,220 INFO L182 omatonBuilderFactory]: Interpolants [42567#true, 42568#false, 42569#(= 0 |ldv_malloc_#t~malloc1.offset|), 42570#(= 0 |ldv_malloc_#res.offset|), 42571#(= 0 |entry_point_#t~ret10.offset|), 42572#(= 0 entry_point_~array~0.offset), 42573#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 42574#(and (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 42575#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 42576#(or (<= 1 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 42577#(or (<= 0 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 42578#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 42579#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 42580#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 42581#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 42582#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:20:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-02-04 03:20:29,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:20:29,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:20:29,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:20:29,221 INFO L87 Difference]: Start difference. First operand 374 states and 447 transitions. Second operand 16 states. [2018-02-04 03:20:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:29,417 INFO L93 Difference]: Finished difference Result 382 states and 450 transitions. [2018-02-04 03:20:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:20:29,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 122 [2018-02-04 03:20:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:29,418 INFO L225 Difference]: With dead ends: 382 [2018-02-04 03:20:29,419 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 03:20:29,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:20:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 03:20:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2018-02-04 03:20:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-04 03:20:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 446 transitions. [2018-02-04 03:20:29,423 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 446 transitions. Word has length 122 [2018-02-04 03:20:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:29,423 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 446 transitions. [2018-02-04 03:20:29,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:20:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 446 transitions. [2018-02-04 03:20:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 03:20:29,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:29,424 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:29,424 INFO L371 AbstractCegarLoop]: === Iteration 89 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash -98109991, now seen corresponding path program 2 times [2018-02-04 03:20:29,425 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:29,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-02-04 03:20:29,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:29,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:20:29,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 03:20:29,523 INFO L182 omatonBuilderFactory]: Interpolants [43360#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 43361#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 43362#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 4)), 43363#(<= |alloc_17_#in~len| 4), 43355#true, 43356#false, 43357#(<= 10 entry_point_~len~0), 43358#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 43359#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1))] [2018-02-04 03:20:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-02-04 03:20:29,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:20:29,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:20:29,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:20:29,523 INFO L87 Difference]: Start difference. First operand 374 states and 446 transitions. Second operand 9 states. [2018-02-04 03:20:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:29,568 INFO L93 Difference]: Finished difference Result 450 states and 528 transitions. [2018-02-04 03:20:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:20:29,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2018-02-04 03:20:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:29,569 INFO L225 Difference]: With dead ends: 450 [2018-02-04 03:20:29,569 INFO L226 Difference]: Without dead ends: 447 [2018-02-04 03:20:29,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:20:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-02-04 03:20:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 381. [2018-02-04 03:20:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 03:20:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 455 transitions. [2018-02-04 03:20:29,571 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 455 transitions. Word has length 124 [2018-02-04 03:20:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:29,572 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 455 transitions. [2018-02-04 03:20:29,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:20:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 455 transitions. [2018-02-04 03:20:29,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-04 03:20:29,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:29,572 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 8, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:29,572 INFO L371 AbstractCegarLoop]: === Iteration 90 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1371783745, now seen corresponding path program 7 times [2018-02-04 03:20:29,573 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:29,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 6 proven. 265 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:20:30,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:30,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:20:30,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:30,071 INFO L182 omatonBuilderFactory]: Interpolants [44197#true, 44198#false, 44199#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 44200#(= 0 |ldv_malloc_#t~malloc1.offset|), 44201#(= 0 |ldv_malloc_#res.offset|), 44202#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 44203#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 44204#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 44205#(and (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)))), 44206#(and (<= (+ (div (+ (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset)))), 44207#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 44208#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 44209#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))))), 44210#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset))))), 44211#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 24 entry_point_~array~0.offset)))), 44212#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 44213#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 24)) (= 0 |free_17_#in~array.offset|)), 44214#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 24)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 44215#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 20))) (= free_17_~array.offset 0)), 44216#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 44217#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 12))) (= free_17_~array.offset 0)), 44218#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 44219#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 44220#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 44221#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 44222#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 6 proven. 265 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:20:30,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:20:30,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:20:30,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:20:30,072 INFO L87 Difference]: Start difference. First operand 381 states and 455 transitions. Second operand 26 states. [2018-02-04 03:20:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:31,445 INFO L93 Difference]: Finished difference Result 395 states and 467 transitions. [2018-02-04 03:20:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 03:20:31,446 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 123 [2018-02-04 03:20:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:31,446 INFO L225 Difference]: With dead ends: 395 [2018-02-04 03:20:31,447 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 03:20:31,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=355, Invalid=3427, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:20:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 03:20:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 386. [2018-02-04 03:20:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-04 03:20:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 461 transitions. [2018-02-04 03:20:31,449 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 461 transitions. Word has length 123 [2018-02-04 03:20:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:31,450 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 461 transitions. [2018-02-04 03:20:31,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:20:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 461 transitions. [2018-02-04 03:20:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 03:20:31,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:31,450 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:31,450 INFO L371 AbstractCegarLoop]: === Iteration 91 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash -745238011, now seen corresponding path program 4 times [2018-02-04 03:20:31,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:31,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:20:32,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:32,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:20:32,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:32,519 INFO L182 omatonBuilderFactory]: Interpolants [45077#true, 45078#false, 45079#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 45080#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 45081#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 45082#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 45083#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 45084#(and (<= 10 entry_point_~len~0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 45085#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 45086#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 45087#(and (= 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~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 45088#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 45089#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2)), 45090#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 45091#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 12 entry_point_~array~0.offset)) entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 45092#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset)) entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 45093#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset)) entry_point_~array~0.base))))), 45094#(and (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset)) entry_point_~array~0.base))), 45095#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 45096#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 45097#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 45098#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 45099#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 45100#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 45101#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0))), 45102#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 45103#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12) |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 45104#(and (= free_17_~i~1 0) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 12) free_17_~array.base)) (= free_17_~array.offset 0)), 45105#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))) free_17_~array.base)) (= free_17_~array.offset 0)), 45106#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))) free_17_~array.base)) (= free_17_~array.offset 0)), 45107#(not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)), 45108#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 45109#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:20:32,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:20:32,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:20:32,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:20:32,520 INFO L87 Difference]: Start difference. First operand 386 states and 461 transitions. Second operand 33 states. [2018-02-04 03:20:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:35,418 INFO L93 Difference]: Finished difference Result 397 states and 468 transitions. [2018-02-04 03:20:35,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 03:20:35,419 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 125 [2018-02-04 03:20:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:35,419 INFO L225 Difference]: With dead ends: 397 [2018-02-04 03:20:35,420 INFO L226 Difference]: Without dead ends: 397 [2018-02-04 03:20:35,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=636, Invalid=5216, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 03:20:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-04 03:20:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 386. [2018-02-04 03:20:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-04 03:20:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2018-02-04 03:20:35,422 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 125 [2018-02-04 03:20:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:35,423 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2018-02-04 03:20:35,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:20:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2018-02-04 03:20:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 03:20:35,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:35,423 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 8, 8, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:35,423 INFO L371 AbstractCegarLoop]: === Iteration 92 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash -424376813, now seen corresponding path program 7 times [2018-02-04 03:20:35,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:35,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 7 proven. 244 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:20:35,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:35,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:20:35,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:35,938 INFO L182 omatonBuilderFactory]: Interpolants [45981#true, 45982#false, 45983#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 45984#(= 0 |ldv_malloc_#t~malloc1.offset|), 45985#(= 0 |ldv_malloc_#res.offset|), 45986#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 45987#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 45988#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 45989#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))))) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 45990#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)))))), 45991#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)))))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 45992#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))))), 45993#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))))) (= entry_point_~array~0.offset 0)), 45994#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 28))) (= entry_point_~array~0.offset 0)), 45995#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 45996#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 28)) (= 0 |free_17_#in~array.offset|)), 45997#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 28)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 45998#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 24))) (= free_17_~array.offset 0)), 45999#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 20))) (= free_17_~array.offset 0)), 46000#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 46001#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 12)))), 46002#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 46003#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 46004#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 46005#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:20:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 7 proven. 244 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:20:35,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:20:35,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:20:35,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:35,938 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand 25 states. [2018-02-04 03:20:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:37,105 INFO L93 Difference]: Finished difference Result 399 states and 470 transitions. [2018-02-04 03:20:37,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 03:20:37,106 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 124 [2018-02-04 03:20:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:37,106 INFO L225 Difference]: With dead ends: 399 [2018-02-04 03:20:37,106 INFO L226 Difference]: Without dead ends: 399 [2018-02-04 03:20:37,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=3108, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 03:20:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-02-04 03:20:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 387. [2018-02-04 03:20:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-04 03:20:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 462 transitions. [2018-02-04 03:20:37,109 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 462 transitions. Word has length 124 [2018-02-04 03:20:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:37,109 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 462 transitions. [2018-02-04 03:20:37,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:20:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 462 transitions. [2018-02-04 03:20:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 03:20:37,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:37,110 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 8, 8, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:37,110 INFO L371 AbstractCegarLoop]: === Iteration 93 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash -424376812, now seen corresponding path program 7 times [2018-02-04 03:20:37,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:37,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 7 proven. 244 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:20:37,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:37,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:20:37,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:37,547 INFO L182 omatonBuilderFactory]: Interpolants [46861#true, 46862#false, 46863#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 46864#(= 0 |ldv_malloc_#t~malloc1.offset|), 46865#(= 0 |ldv_malloc_#res.offset|), 46866#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 46867#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 46868#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 46869#(and (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 46870#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (= entry_point_~array~0.offset 0)), 46871#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 46872#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 46873#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))))) (= entry_point_~array~0.offset 0)), 46874#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 28)))), 46875#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 46876#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 28))), 46877#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 28)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 46878#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 24))) (= free_17_~array.offset 0)), 46879#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 20))) (= free_17_~array.offset 0)), 46880#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 46881#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 12))) (= free_17_~array.offset 0)), 46882#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 46883#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 46884#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 46885#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:20:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 7 proven. 244 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:20:37,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:20:37,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:20:37,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:37,548 INFO L87 Difference]: Start difference. First operand 387 states and 462 transitions. Second operand 25 states. [2018-02-04 03:20:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:38,630 INFO L93 Difference]: Finished difference Result 398 states and 469 transitions. [2018-02-04 03:20:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:20:38,630 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 124 [2018-02-04 03:20:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:38,631 INFO L225 Difference]: With dead ends: 398 [2018-02-04 03:20:38,631 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 03:20:38,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=2219, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 03:20:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 03:20:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 387. [2018-02-04 03:20:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-04 03:20:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 461 transitions. [2018-02-04 03:20:38,634 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 461 transitions. Word has length 124 [2018-02-04 03:20:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:38,634 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 461 transitions. [2018-02-04 03:20:38,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:20:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 461 transitions. [2018-02-04 03:20:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 03:20:38,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:38,634 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:38,634 INFO L371 AbstractCegarLoop]: === Iteration 94 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1833125674, now seen corresponding path program 3 times [2018-02-04 03:20:38,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:38,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-04 03:20:39,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:39,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:20:39,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:20:39,039 INFO L182 omatonBuilderFactory]: Interpolants [47722#true, 47723#false, 47724#(= 0 |ldv_malloc_#t~malloc1.offset|), 47725#(= 0 |ldv_malloc_#res.offset|), 47726#(= 0 |entry_point_#t~ret10.offset|), 47727#(= 0 entry_point_~array~0.offset), 47728#(= 0 |alloc_17_#in~array.offset|), 47729#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 47730#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 47731#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 47732#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 47733#(and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 47734#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0)), 47735#(and (<= alloc_17_~i~0 3) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 3) alloc_17_~i~0)), 47736#(and (= alloc_17_~array.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~j~0) (<= alloc_17_~j~0 2)), 47737#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))), 47738#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 47739#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 47740#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 47741#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-04 03:20:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-04 03:20:39,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:20:39,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:20:39,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:20:39,040 INFO L87 Difference]: Start difference. First operand 387 states and 461 transitions. Second operand 20 states. [2018-02-04 03:20:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:39,631 INFO L93 Difference]: Finished difference Result 419 states and 494 transitions. [2018-02-04 03:20:39,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:20:39,631 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 127 [2018-02-04 03:20:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:39,632 INFO L225 Difference]: With dead ends: 419 [2018-02-04 03:20:39,632 INFO L226 Difference]: Without dead ends: 419 [2018-02-04 03:20:39,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 03:20:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-04 03:20:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 410. [2018-02-04 03:20:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 03:20:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 487 transitions. [2018-02-04 03:20:39,635 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 487 transitions. Word has length 127 [2018-02-04 03:20:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:39,635 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 487 transitions. [2018-02-04 03:20:39,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:20:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 487 transitions. [2018-02-04 03:20:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 03:20:39,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:39,636 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:39,636 INFO L371 AbstractCegarLoop]: === Iteration 95 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1833125675, now seen corresponding path program 4 times [2018-02-04 03:20:39,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:39,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 107 proven. 183 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 03:20:41,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:41,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 03:20:41,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 03:20:41,622 INFO L182 omatonBuilderFactory]: Interpolants [48640#(= entry_point_~array~0.offset 0), 48641#(= 0 |alloc_17_#in~array.offset|), 48642#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 48643#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 48644#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 48645#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 48646#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 48647#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 48648#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4) (or (<= (* 4 alloc_17_~i~0) 3) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))), 48649#(= |#valid| |old(#valid)|), 48650#(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)), 48651#(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|))))), 48652#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) |alloc_17_#t~ret3.base|)) (not (= 0 |alloc_17_#t~ret3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (<= (* 4 alloc_17_~i~0) 4)), 48653#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4) (or (and (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0) alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0)))) (<= (* 4 alloc_17_~i~0) 3))), 48654#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4) (or (<= (* 4 alloc_17_~i~0) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 48655#(and (= alloc_17_~array.offset 0) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 8) (<= (* 4 alloc_17_~i~0) 7)) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7))), 48656#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) |alloc_17_#t~ret3.base|)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (<= (* 4 alloc_17_~i~0) 8) (not (= 0 |alloc_17_#t~ret3.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7)) (= alloc_17_~array.offset 0)), 48657#(and (= alloc_17_~array.offset 0) (or (and (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0) alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 8) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) (- 4)))))) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7))), 48658#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (<= (* 4 alloc_17_~i~0) 8) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))) (or (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (<= (* 4 alloc_17_~i~0) 7))), 48659#(and (or (and (<= alloc_17_~i~0 3) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 11)) (= alloc_17_~array.offset 0) (or (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (<= (* 4 alloc_17_~i~0) 11))), 48660#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (<= (* 4 alloc_17_~j~0) 8) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))))) (= alloc_17_~array.offset 0)), 48661#(and (or (and (= |alloc_17_#t~mem6.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (or (and (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (<= alloc_17_~j~0 2) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (not (= 1 (select |#valid| |alloc_17_#t~mem6.base|))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7)) (= alloc_17_~array.offset 0)), 48662#(and (= alloc_17_~array.offset 0) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (<= (* 4 alloc_17_~j~0) 8) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7))), 48663#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= alloc_17_~j~0 1)))), 48664#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (<= alloc_17_~j~0 1) (not (= 0 |alloc_17_#t~mem6.base|)) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))))) (= alloc_17_~array.offset 0)), 48665#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (or (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0))), 48666#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0)) (= alloc_17_~array.offset 0)), 48667#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 48668#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 48621#true, 48622#false, 48623#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 48624#(= 0 |ldv_malloc_#t~malloc1.offset|), 48625#(= 0 |ldv_malloc_#res.offset|), 48626#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 48627#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 48628#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 48629#(and (<= 10 entry_point_~len~0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 36)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 48630#(and (<= 10 entry_point_~len~0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 32)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 48631#(and (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 28)))), 48632#(and (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 24)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23)))), 48633#(and (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 20)))), 48634#(and (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15)) (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 16)))), 48635#(and (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 12)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11))) (= entry_point_~array~0.offset 0)), 48636#(and (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 8)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 48637#(and (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3))) (= entry_point_~array~0.offset 0)), 48638#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 48639#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0))] [2018-02-04 03:20:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 107 proven. 183 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 03:20:41,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 03:20:41,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 03:20:41,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2035, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:20:41,623 INFO L87 Difference]: Start difference. First operand 410 states and 487 transitions. Second operand 48 states. [2018-02-04 03:20:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:44,212 INFO L93 Difference]: Finished difference Result 416 states and 489 transitions. [2018-02-04 03:20:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 03:20:44,212 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-02-04 03:20:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:44,213 INFO L225 Difference]: With dead ends: 416 [2018-02-04 03:20:44,213 INFO L226 Difference]: Without dead ends: 416 [2018-02-04 03:20:44,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3653 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1293, Invalid=10263, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 03:20:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-02-04 03:20:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 410. [2018-02-04 03:20:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 03:20:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 486 transitions. [2018-02-04 03:20:44,216 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 486 transitions. Word has length 127 [2018-02-04 03:20:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:44,216 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 486 transitions. [2018-02-04 03:20:44,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 03:20:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 486 transitions. [2018-02-04 03:20:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 03:20:44,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:44,216 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:44,216 INFO L371 AbstractCegarLoop]: === Iteration 96 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2034004350, now seen corresponding path program 2 times [2018-02-04 03:20:44,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:44,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-02-04 03:20:44,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:44,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:20:44,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:20:44,382 INFO L182 omatonBuilderFactory]: Interpolants [49615#true, 49616#false, 49617#(= 0 |ldv_malloc_#t~malloc1.offset|), 49618#(= 0 |ldv_malloc_#res.offset|), 49619#(= 0 |entry_point_#t~ret10.offset|), 49620#(= 0 entry_point_~array~0.offset), 49621#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 49622#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 49623#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 8) (select |#length| alloc_17_~array.base)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 49624#(and (or (<= (+ alloc_17_~array.offset 8) (select |#length| alloc_17_~array.base)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 49625#(or (<= 8 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 49626#(and (<= 8 (select |#length| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 49627#(and (<= 8 (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 49628#(and (<= 8 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 49629#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-04 03:20:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-02-04 03:20:44,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:20:44,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:20:44,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:20:44,382 INFO L87 Difference]: Start difference. First operand 410 states and 486 transitions. Second operand 15 states. [2018-02-04 03:20:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:44,544 INFO L93 Difference]: Finished difference Result 420 states and 489 transitions. [2018-02-04 03:20:44,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:20:44,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2018-02-04 03:20:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:44,545 INFO L225 Difference]: With dead ends: 420 [2018-02-04 03:20:44,545 INFO L226 Difference]: Without dead ends: 420 [2018-02-04 03:20:44,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:20:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-02-04 03:20:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 410. [2018-02-04 03:20:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 03:20:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 485 transitions. [2018-02-04 03:20:44,548 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 485 transitions. Word has length 127 [2018-02-04 03:20:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:44,548 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 485 transitions. [2018-02-04 03:20:44,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:20:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 485 transitions. [2018-02-04 03:20:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-02-04 03:20:44,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:44,548 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:44,548 INFO L371 AbstractCegarLoop]: === Iteration 97 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1627541809, now seen corresponding path program 4 times [2018-02-04 03:20:44,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:44,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 4 proven. 224 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 03:20:45,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:45,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:20:45,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:45,500 INFO L182 omatonBuilderFactory]: Interpolants [50496#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 50497#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 50498#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 50499#(= 0 |free_17_#t~mem9.offset|), 50468#true, 50469#false, 50470#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 50471#(= 0 |ldv_malloc_#t~malloc1.offset|), 50472#(= 0 |ldv_malloc_#res.offset|), 50473#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 50474#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 50475#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 50476#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 50477#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 50478#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 50479#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 50480#(or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))), 50481#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 16 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 50482#(or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 50483#(or (and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 50484#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))), 50485#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 50486#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= alloc_17_~array.offset 0)))), 50487#(and (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 50488#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 50489#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 50490#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 50491#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 50492#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 50493#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 50494#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 16)) (= free_17_~array.offset 0)), 50495#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0))] [2018-02-04 03:20:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 4 proven. 224 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 03:20:45,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:20:45,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:20:45,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:20:45,501 INFO L87 Difference]: Start difference. First operand 410 states and 485 transitions. Second operand 32 states. [2018-02-04 03:20:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:47,830 INFO L93 Difference]: Finished difference Result 422 states and 492 transitions. [2018-02-04 03:20:47,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 03:20:47,830 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-02-04 03:20:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:47,831 INFO L225 Difference]: With dead ends: 422 [2018-02-04 03:20:47,831 INFO L226 Difference]: Without dead ends: 422 [2018-02-04 03:20:47,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=563, Invalid=4693, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 03:20:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-04 03:20:47,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 410. [2018-02-04 03:20:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 03:20:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2018-02-04 03:20:47,834 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 126 [2018-02-04 03:20:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:47,834 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2018-02-04 03:20:47,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:20:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2018-02-04 03:20:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-02-04 03:20:47,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:47,835 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:47,835 INFO L371 AbstractCegarLoop]: === Iteration 98 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1627541808, now seen corresponding path program 4 times [2018-02-04 03:20:47,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:47,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 4 proven. 224 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 03:20:48,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:48,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:20:48,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:48,795 INFO L182 omatonBuilderFactory]: Interpolants [51414#true, 51415#false, 51416#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 51417#(= 0 |ldv_malloc_#t~malloc1.offset|), 51418#(= 0 |ldv_malloc_#res.offset|), 51419#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 51420#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 51421#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 51422#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 51423#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 51424#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 51425#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 51426#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 51427#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 16 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 51428#(or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 51429#(or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 51430#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 51431#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 51432#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 51433#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 51434#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 51435#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 51436#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 51437#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0))), 51438#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 51439#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 51440#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 51441#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 51442#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 51443#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 51444#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 51445#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:20:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 4 proven. 224 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 03:20:48,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:20:48,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:20:48,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:20:48,796 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand 32 states. [2018-02-04 03:20:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:50,916 INFO L93 Difference]: Finished difference Result 421 states and 491 transitions. [2018-02-04 03:20:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:20:50,916 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-02-04 03:20:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:50,917 INFO L225 Difference]: With dead ends: 421 [2018-02-04 03:20:50,917 INFO L226 Difference]: Without dead ends: 421 [2018-02-04 03:20:50,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=486, Invalid=3936, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 03:20:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-02-04 03:20:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 410. [2018-02-04 03:20:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 03:20:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 483 transitions. [2018-02-04 03:20:50,919 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 483 transitions. Word has length 126 [2018-02-04 03:20:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:50,920 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 483 transitions. [2018-02-04 03:20:50,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:20:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 483 transitions. [2018-02-04 03:20:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 03:20:50,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:50,920 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:50,920 INFO L371 AbstractCegarLoop]: === Iteration 99 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash -270825540, now seen corresponding path program 6 times [2018-02-04 03:20:50,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:50,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:20:50,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:50,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:20:50,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:50,987 INFO L182 omatonBuilderFactory]: Interpolants [52352#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 52353#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 52354#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 4)), 52355#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 5)), 52356#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 6)), 52357#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 7)), 52358#(<= |free_17_#in~len| 7), 52347#true, 52348#false, 52349#(<= 10 entry_point_~len~0), 52350#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 52351#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1))] [2018-02-04 03:20:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:20:50,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:20:50,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:20:50,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:20:50,987 INFO L87 Difference]: Start difference. First operand 410 states and 483 transitions. Second operand 12 states. [2018-02-04 03:20:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:51,028 INFO L93 Difference]: Finished difference Result 480 states and 544 transitions. [2018-02-04 03:20:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:20:51,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2018-02-04 03:20:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:51,029 INFO L225 Difference]: With dead ends: 480 [2018-02-04 03:20:51,029 INFO L226 Difference]: Without dead ends: 472 [2018-02-04 03:20:51,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:20:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-02-04 03:20:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 428. [2018-02-04 03:20:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-02-04 03:20:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 511 transitions. [2018-02-04 03:20:51,032 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 511 transitions. Word has length 125 [2018-02-04 03:20:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:51,032 INFO L432 AbstractCegarLoop]: Abstraction has 428 states and 511 transitions. [2018-02-04 03:20:51,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:20:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 511 transitions. [2018-02-04 03:20:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 03:20:51,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:51,032 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:51,033 INFO L371 AbstractCegarLoop]: === Iteration 100 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1370374569, now seen corresponding path program 5 times [2018-02-04 03:20:51,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:51,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 19 proven. 110 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 03:20:52,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:52,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:20:52,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 03:20:52,092 INFO L182 omatonBuilderFactory]: Interpolants [53269#true, 53270#false, 53271#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 53272#(= 0 |ldv_malloc_#t~malloc1.offset|), 53273#(= 0 |ldv_malloc_#res.offset|), 53274#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 53275#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 53276#(= entry_point_~array~0.offset 0), 53277#(and (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))), 53278#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53279#(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))))), 53280#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53281#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (and (= 0 |alloc_17_#t~ret3.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53282#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53283#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53284#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (not (= alloc_17_~array.offset 0)) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53285#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53286#(and (or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53287#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53288#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (- (* (- 4) alloc_17_~j~0)) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53289#(and (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~j~0) (- 4))) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53290#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~j~0) (- 4))) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (<= 1 (* 4 alloc_17_~j~0)) (not (= alloc_17_~array.offset 0)))), 53291#(and (or (and (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~j~0) (- 4))) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))) (<= 1 (* 4 alloc_17_~j~0)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53292#(and (or (not (= alloc_17_~array.offset 0)) (and (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~j~0) (- 4))) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 1 (* 4 alloc_17_~j~0))) (<= 0 (* 4 alloc_17_~j~0)))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 53293#(or (and (<= 0 (* 4 alloc_17_~j~0)) (or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (- (+ (* (- 4) alloc_17_~j~0) (- 4))))) (<= 1 (* 4 alloc_17_~j~0)))) (not (= |alloc_17_#in~array.offset| 0))), 53294#(or (and (or (<= 0 (+ (* 4 alloc_17_~j~0) 3)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (- (+ (* (- 4) alloc_17_~j~0) (- 8)))))) (<= 0 (+ (* 4 alloc_17_~j~0) 4))) (not (= |alloc_17_#in~array.offset| 0))), 53295#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (- (- 4)))) (not (= |alloc_17_#in~array.offset| 0))), 53296#(and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 4))), 53297#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 53298#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 53299#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 53300#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:20:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 19 proven. 110 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 03:20:52,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:20:52,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:20:52,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:20:52,092 INFO L87 Difference]: Start difference. First operand 428 states and 511 transitions. Second operand 32 states. [2018-02-04 03:20:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:53,501 INFO L93 Difference]: Finished difference Result 437 states and 514 transitions. [2018-02-04 03:20:53,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:20:53,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 128 [2018-02-04 03:20:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:53,502 INFO L225 Difference]: With dead ends: 437 [2018-02-04 03:20:53,503 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 03:20:53,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=384, Invalid=2922, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:20:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 03:20:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 428. [2018-02-04 03:20:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-02-04 03:20:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 510 transitions. [2018-02-04 03:20:53,505 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 510 transitions. Word has length 128 [2018-02-04 03:20:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:53,505 INFO L432 AbstractCegarLoop]: Abstraction has 428 states and 510 transitions. [2018-02-04 03:20:53,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:20:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 510 transitions. [2018-02-04 03:20:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 03:20:53,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:53,506 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:53,506 INFO L371 AbstractCegarLoop]: === Iteration 101 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1370374568, now seen corresponding path program 5 times [2018-02-04 03:20:53,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:53,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 14 proven. 91 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-02-04 03:20:53,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:53,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:20:53,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:20:53,995 INFO L182 omatonBuilderFactory]: Interpolants [54218#true, 54219#false, 54220#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 54221#(= 0 |ldv_malloc_#t~malloc1.offset|), 54222#(= 0 |ldv_malloc_#res.offset|), 54223#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 54224#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 54225#(= entry_point_~array~0.offset 0), 54226#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 54227#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 54228#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 54229#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~j~0) (- 4)))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0) (not (= alloc_17_~array.offset 0)) (<= 4 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 54230#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (<= 0 (* 4 alloc_17_~j~0)) (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (- (- 4))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)) (<= 4 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))), 54231#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4)))) (<= 1 (* 4 alloc_17_~j~0))) (<= 0 (* 4 alloc_17_~j~0)))), 54232#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= 0 (+ (* 4 alloc_17_~j~0) 3)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (<= 0 (+ (* 4 alloc_17_~j~0) 4)))), 54233#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))), 54234#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 54235#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 54236#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 54237#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 54238#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:20:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 14 proven. 91 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-02-04 03:20:53,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:20:53,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:20:53,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:20:53,995 INFO L87 Difference]: Start difference. First operand 428 states and 510 transitions. Second operand 21 states. [2018-02-04 03:20:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:54,438 INFO L93 Difference]: Finished difference Result 436 states and 513 transitions. [2018-02-04 03:20:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:20:54,438 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 128 [2018-02-04 03:20:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:54,439 INFO L225 Difference]: With dead ends: 436 [2018-02-04 03:20:54,439 INFO L226 Difference]: Without dead ends: 436 [2018-02-04 03:20:54,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:20:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-04 03:20:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 428. [2018-02-04 03:20:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-02-04 03:20:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 509 transitions. [2018-02-04 03:20:54,442 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 509 transitions. Word has length 128 [2018-02-04 03:20:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:54,442 INFO L432 AbstractCegarLoop]: Abstraction has 428 states and 509 transitions. [2018-02-04 03:20:54,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:20:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 509 transitions. [2018-02-04 03:20:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 03:20:54,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:54,443 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:54,443 INFO L371 AbstractCegarLoop]: === Iteration 102 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash 697182155, now seen corresponding path program 3 times [2018-02-04 03:20:54,443 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:54,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 46 proven. 137 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-04 03:20:55,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:55,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:20:55,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:20:55,267 INFO L182 omatonBuilderFactory]: Interpolants [55129#true, 55130#false, 55131#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 55132#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 55133#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 55134#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 55135#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= (select |#valid| entry_point_~array~0.base) 1)), 55136#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 55137#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 55138#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 55139#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 55140#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 55141#(= |#valid| |old(#valid)|), 55142#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 55143#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 55144#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 55145#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 55146#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 55147#(and (= alloc_17_~array.offset 0) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 3)) (<= (* 4 alloc_17_~i~0) 4)), 55148#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 7))), 55149#(and (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 11)) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 12)), 55150#(and (= alloc_17_~array.offset 0) (or (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7)) (<= alloc_17_~j~0 2)), 55151#(and (= alloc_17_~array.offset 0) (or (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3)) (<= alloc_17_~j~0 1)), 55152#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (or (and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3))), 55153#(and (or (and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 1 (select |#valid| alloc_17_~array.base))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0)) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 55154#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))), 55155#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 55156#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:20:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 46 proven. 137 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-02-04 03:20:55,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:20:55,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:20:55,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:20:55,268 INFO L87 Difference]: Start difference. First operand 428 states and 509 transitions. Second operand 28 states. [2018-02-04 03:20:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:56,048 INFO L93 Difference]: Finished difference Result 437 states and 515 transitions. [2018-02-04 03:20:56,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:20:56,048 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 129 [2018-02-04 03:20:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:56,049 INFO L225 Difference]: With dead ends: 437 [2018-02-04 03:20:56,049 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 03:20:56,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 14 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=428, Invalid=2652, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:20:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 03:20:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 405. [2018-02-04 03:20:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-02-04 03:20:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 484 transitions. [2018-02-04 03:20:56,052 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 484 transitions. Word has length 129 [2018-02-04 03:20:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:56,052 INFO L432 AbstractCegarLoop]: Abstraction has 405 states and 484 transitions. [2018-02-04 03:20:56,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:20:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 484 transitions. [2018-02-04 03:20:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 03:20:56,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:56,053 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:56,053 INFO L371 AbstractCegarLoop]: === Iteration 103 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:56,053 INFO L82 PathProgramCache]: Analyzing trace with hash -155391209, now seen corresponding path program 8 times [2018-02-04 03:20:56,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:56,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 7 proven. 282 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:20:56,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:56,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:20:56,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:56,506 INFO L182 omatonBuilderFactory]: Interpolants [56064#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (= entry_point_~array~0.offset 0)), 56065#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 56066#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32))))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 56067#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))))) (= entry_point_~array~0.offset 0)), 56068#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 28)))), 56069#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 56070#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 28))), 56071#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 28)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 56072#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 24))) (= free_17_~array.offset 0)), 56073#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 20))) (= free_17_~array.offset 0)), 56074#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 56075#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 12))) (= free_17_~array.offset 0)), 56076#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 56077#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 56078#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 56079#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 56080#(= 1 (select |#valid| free_17_~array.base)), 56055#true, 56056#false, 56057#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 56058#(= 0 |ldv_malloc_#t~malloc1.offset|), 56059#(= 0 |ldv_malloc_#res.offset|), 56060#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 56061#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 56062#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 56063#(and (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))))))] [2018-02-04 03:20:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 7 proven. 282 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:20:56,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:20:56,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:20:56,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:20:56,507 INFO L87 Difference]: Start difference. First operand 405 states and 484 transitions. Second operand 26 states. [2018-02-04 03:20:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:57,755 INFO L93 Difference]: Finished difference Result 419 states and 496 transitions. [2018-02-04 03:20:57,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 03:20:57,755 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 129 [2018-02-04 03:20:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:57,756 INFO L225 Difference]: With dead ends: 419 [2018-02-04 03:20:57,756 INFO L226 Difference]: Without dead ends: 419 [2018-02-04 03:20:57,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=3331, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 03:20:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-04 03:20:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 410. [2018-02-04 03:20:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 03:20:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 490 transitions. [2018-02-04 03:20:57,759 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 490 transitions. Word has length 129 [2018-02-04 03:20:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:57,759 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 490 transitions. [2018-02-04 03:20:57,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:20:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 490 transitions. [2018-02-04 03:20:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-04 03:20:57,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:57,760 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:57,760 INFO L371 AbstractCegarLoop]: === Iteration 104 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2034509861, now seen corresponding path program 5 times [2018-02-04 03:20:57,760 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:57,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 4 proven. 247 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 03:20:58,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:58,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:20:58,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:58,806 INFO L182 omatonBuilderFactory]: Interpolants [56981#true, 56982#false, 56983#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 56984#(= 0 |ldv_malloc_#t~malloc1.offset|), 56985#(= 0 |ldv_malloc_#res.offset|), 56986#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 56987#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 56988#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 56989#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 56990#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 56991#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 56992#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 56993#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 56994#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 16)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 56995#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 56996#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 56997#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (= entry_point_~array~0.offset 0)), 56998#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 56999#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 57000#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 57001#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 57002#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 57003#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 57004#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0))), 57005#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 57006#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 57007#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 57008#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 57009#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 57010#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 57011#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 57012#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 57013#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 4 proven. 247 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 03:20:58,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:20:58,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:20:58,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:20:58,807 INFO L87 Difference]: Start difference. First operand 410 states and 490 transitions. Second operand 33 states. [2018-02-04 03:21:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:01,317 INFO L93 Difference]: Finished difference Result 421 states and 497 transitions. [2018-02-04 03:21:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 03:21:01,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-02-04 03:21:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:01,318 INFO L225 Difference]: With dead ends: 421 [2018-02-04 03:21:01,318 INFO L226 Difference]: Without dead ends: 421 [2018-02-04 03:21:01,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 03:21:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-02-04 03:21:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 410. [2018-02-04 03:21:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 03:21:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 489 transitions. [2018-02-04 03:21:01,323 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 489 transitions. Word has length 131 [2018-02-04 03:21:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:01,323 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 489 transitions. [2018-02-04 03:21:01,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:21:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 489 transitions. [2018-02-04 03:21:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-02-04 03:21:01,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:01,324 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:01,324 INFO L371 AbstractCegarLoop]: === Iteration 105 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:01,324 INFO L82 PathProgramCache]: Analyzing trace with hash -522160131, now seen corresponding path program 8 times [2018-02-04 03:21:01,325 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:01,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 8 proven. 258 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 03:21:01,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:01,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:21:01,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:01,815 INFO L182 omatonBuilderFactory]: Interpolants [57929#true, 57930#false, 57931#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 57932#(= 0 |ldv_malloc_#t~malloc1.offset|), 57933#(= 0 |ldv_malloc_#res.offset|), 57934#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 57935#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 57936#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 57937#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)))), 57938#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))))), 57939#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 57940#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 57941#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 32 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 57942#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 57943#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 32))), 57944#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 32)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 57945#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 28))) (= free_17_~array.offset 0)), 57946#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 24))) (= free_17_~array.offset 0)), 57947#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 20))) (= free_17_~array.offset 0)), 57948#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 57949#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 12)))), 57950#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 57951#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 57952#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 57953#(= 0 |free_17_#t~mem9.offset|)] [2018-02-04 03:21:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 8 proven. 258 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 03:21:01,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:21:01,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:21:01,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:21:01,816 INFO L87 Difference]: Start difference. First operand 410 states and 489 transitions. Second operand 25 states. [2018-02-04 03:21:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:03,027 INFO L93 Difference]: Finished difference Result 423 states and 499 transitions. [2018-02-04 03:21:03,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:21:03,027 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 130 [2018-02-04 03:21:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:03,028 INFO L225 Difference]: With dead ends: 423 [2018-02-04 03:21:03,028 INFO L226 Difference]: Without dead ends: 423 [2018-02-04 03:21:03,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=3009, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:21:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-04 03:21:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 411. [2018-02-04 03:21:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 03:21:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 491 transitions. [2018-02-04 03:21:03,031 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 491 transitions. Word has length 130 [2018-02-04 03:21:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:03,031 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 491 transitions. [2018-02-04 03:21:03,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:21:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 491 transitions. [2018-02-04 03:21:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-02-04 03:21:03,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:03,031 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:03,031 INFO L371 AbstractCegarLoop]: === Iteration 106 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash -522160130, now seen corresponding path program 8 times [2018-02-04 03:21:03,032 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:03,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 8 proven. 258 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 03:21:03,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:03,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:21:03,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:03,482 INFO L182 omatonBuilderFactory]: Interpolants [58855#true, 58856#false, 58857#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 58858#(= 0 |ldv_malloc_#t~malloc1.offset|), 58859#(= 0 |ldv_malloc_#res.offset|), 58860#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 58861#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 58862#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 58863#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 58864#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 58865#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 58866#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 32)))))) (= entry_point_~array~0.offset 0)), 58867#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 32))) (= entry_point_~array~0.offset 0)), 58868#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 58869#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 32)) (= 0 |free_17_#in~array.offset|)), 58870#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 32)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 58871#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 28))) (= free_17_~array.offset 0)), 58872#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 24))) (= free_17_~array.offset 0)), 58873#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 20))) (= free_17_~array.offset 0)), 58874#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 58875#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 12))) (= free_17_~array.offset 0)), 58876#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 58877#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 58878#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 58879#(= |free_17_#t~mem9.base| 0)] [2018-02-04 03:21:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 8 proven. 258 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 03:21:03,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:21:03,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:21:03,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:21:03,482 INFO L87 Difference]: Start difference. First operand 411 states and 491 transitions. Second operand 25 states. [2018-02-04 03:21:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:04,371 INFO L93 Difference]: Finished difference Result 422 states and 498 transitions. [2018-02-04 03:21:04,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:21:04,372 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 130 [2018-02-04 03:21:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:04,372 INFO L225 Difference]: With dead ends: 422 [2018-02-04 03:21:04,372 INFO L226 Difference]: Without dead ends: 422 [2018-02-04 03:21:04,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=2052, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:21:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-04 03:21:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 411. [2018-02-04 03:21:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 03:21:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 490 transitions. [2018-02-04 03:21:04,375 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 490 transitions. Word has length 130 [2018-02-04 03:21:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:04,375 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 490 transitions. [2018-02-04 03:21:04,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:21:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 490 transitions. [2018-02-04 03:21:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-04 03:21:04,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:04,376 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1] [2018-02-04 03:21:04,376 INFO L371 AbstractCegarLoop]: === Iteration 107 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1823227219, now seen corresponding path program 6 times [2018-02-04 03:21:04,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:04,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 2 proven. 141 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-02-04 03:21:04,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:04,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:21:04,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:21:04,823 INFO L182 omatonBuilderFactory]: Interpolants [59776#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= 0 (+ (* 4 alloc_17_~j~0) 3)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (<= 0 (+ (* 4 alloc_17_~j~0) 4)))), 59777#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))), 59778#(and (= 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_~array~0.base))), 59779#(and (= 0 |free_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4) |free_17_#in~array.base|))), 59780#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 4) free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 59781#(not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))) free_17_~array.base)), 59782#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 59783#(= 1 (select |#valid| free_17_~array.base)), 59760#true, 59761#false, 59762#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 59763#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 59764#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 59765#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 59766#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 59767#(and (= entry_point_~array~0.offset 0) (not (= 0 entry_point_~array~0.base))), 59768#(or (and (= entry_point_~array~0.offset 0) (not (= 0 entry_point_~array~0.base))) (< (+ entry_point_~i~2 1) entry_point_~len~0)), 59769#(or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (= entry_point_~array~0.offset 0) (not (= 0 entry_point_~array~0.base)) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 59770#(or (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 entry_point_~array~0.offset) (not (= 0 entry_point_~array~0.base))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 59771#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 59772#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 59773#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~j~0) (- 4)))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 59774#(and (or (and (<= 0 (* 4 alloc_17_~j~0)) (or (<= 1 (* 4 alloc_17_~j~0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (- (- 4))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 59775#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4)))) (<= 1 (* 4 alloc_17_~j~0))) (<= 0 (* 4 alloc_17_~j~0))))] [2018-02-04 03:21:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 2 proven. 141 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-02-04 03:21:04,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:21:04,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:21:04,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:21:04,824 INFO L87 Difference]: Start difference. First operand 411 states and 490 transitions. Second operand 24 states. [2018-02-04 03:21:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:05,352 INFO L93 Difference]: Finished difference Result 420 states and 493 transitions. [2018-02-04 03:21:05,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:21:05,352 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 133 [2018-02-04 03:21:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:05,353 INFO L225 Difference]: With dead ends: 420 [2018-02-04 03:21:05,353 INFO L226 Difference]: Without dead ends: 420 [2018-02-04 03:21:05,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:21:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-02-04 03:21:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 411. [2018-02-04 03:21:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 03:21:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 489 transitions. [2018-02-04 03:21:05,356 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 489 transitions. Word has length 133 [2018-02-04 03:21:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:05,356 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 489 transitions. [2018-02-04 03:21:05,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:21:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 489 transitions. [2018-02-04 03:21:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-04 03:21:05,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:05,356 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1] [2018-02-04 03:21:05,356 INFO L371 AbstractCegarLoop]: === Iteration 108 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:05,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1823227220, now seen corresponding path program 3 times [2018-02-04 03:21:05,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:05,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 13 proven. 76 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-02-04 03:21:05,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:05,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:21:05,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:21:05,824 INFO L182 omatonBuilderFactory]: Interpolants [60672#(or (<= (select |#length| |free_17_#in~array.base|) 7) (and (<= 40 (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|))), 60673#(or (and (<= 40 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)) (<= (select |#length| free_17_~array.base) 7)), 60674#(or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (and (<= 40 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))), 60675#(or (and (<= (+ (* 4 free_17_~i~1) 36) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 60676#(and (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 36) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 60677#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 32) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 60649#true, 60650#false, 60651#(<= 10 entry_point_~len~0), 60652#(= 0 |ldv_malloc_#t~malloc1.offset|), 60653#(= 0 |ldv_malloc_#res.offset|), 60654#(and (<= 10 entry_point_~len~0) (= 0 |entry_point_#t~ret10.offset|)), 60655#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0)), 60656#(and (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 44) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)))), 60657#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 40) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 60658#(and (<= (+ entry_point_~array~0.offset 40) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 60659#(= |old(#length)| |#length|), 60660#(and (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 60661#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |old(#length)| |#length|)) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 60662#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (<= (select |#length| |ldv_malloc_#t~malloc1.base|) |ldv_malloc_#in~size|)) (<= 2147483648 |ldv_malloc_#in~size|)), 60663#(or (and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (<= (select |#length| (@diff |old(#length)| |#length|)) |ldv_malloc_#in~size|))) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|)), 60664#(and (or (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (<= (select |#length| alloc_17_~array.base) 4)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 60665#(and (= (select |#valid| alloc_17_~array.base) 1) (or (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (<= (select |#length| alloc_17_~array.base) 4)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 60666#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 60667#(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|))), 60668#(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|))))), 60669#(and (or (<= (select |#length| alloc_17_~array.base) 7) (= (select |#length| alloc_17_~array.base) (select |old(#length)| alloc_17_~array.base))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 60670#(or (<= (select |#length| |alloc_17_#in~array.base|) 7) (<= (select |old(#length)| |alloc_17_#in~array.base|) (select |#length| |alloc_17_#in~array.base|))), 60671#(or (and (<= (+ entry_point_~array~0.offset 40) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)) (<= (select |#length| entry_point_~array~0.base) 7))] [2018-02-04 03:21:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 13 proven. 76 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-02-04 03:21:05,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:21:05,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:21:05,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:21:05,825 INFO L87 Difference]: Start difference. First operand 411 states and 489 transitions. Second operand 29 states. [2018-02-04 03:21:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:06,826 INFO L93 Difference]: Finished difference Result 426 states and 492 transitions. [2018-02-04 03:21:06,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:21:06,827 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-02-04 03:21:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:06,827 INFO L225 Difference]: With dead ends: 426 [2018-02-04 03:21:06,827 INFO L226 Difference]: Without dead ends: 426 [2018-02-04 03:21:06,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=2282, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 03:21:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-04 03:21:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 411. [2018-02-04 03:21:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 03:21:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 487 transitions. [2018-02-04 03:21:06,831 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 487 transitions. Word has length 133 [2018-02-04 03:21:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:06,831 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 487 transitions. [2018-02-04 03:21:06,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:21:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 487 transitions. [2018-02-04 03:21:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 03:21:06,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:06,831 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:06,831 INFO L371 AbstractCegarLoop]: === Iteration 109 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1354703801, now seen corresponding path program 6 times [2018-02-04 03:21:06,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:06,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 5 proven. 232 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-04 03:21:07,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:07,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:21:07,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:07,803 INFO L182 omatonBuilderFactory]: Interpolants [61568#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 61569#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))) 4) 3) entry_point_~i~2)), 61570#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 61571#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 20)))) (= entry_point_~array~0.offset 0)), 61572#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 61573#(and (or (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20)))) (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 61574#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (= entry_point_~array~0.offset 0)), 61575#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 61576#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= alloc_17_~array.offset 0)))), 61577#(and (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 61578#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 61579#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 61580#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 61581#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 61582#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 61583#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 20))), 61584#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 20)) (= free_17_~array.offset 0)), 61585#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 16)))) (= free_17_~array.offset 0)), 61586#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 61587#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 61588#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 61589#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 61590#(= 0 |free_17_#t~mem9.offset|), 61559#true, 61560#false, 61561#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 61562#(= 0 |ldv_malloc_#t~malloc1.offset|), 61563#(= 0 |ldv_malloc_#res.offset|), 61564#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 61565#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 61566#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 61567#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))))))] [2018-02-04 03:21:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 5 proven. 232 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-04 03:21:07,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:21:07,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:21:07,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:21:07,803 INFO L87 Difference]: Start difference. First operand 411 states and 487 transitions. Second operand 32 states. [2018-02-04 03:21:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:09,956 INFO L93 Difference]: Finished difference Result 423 states and 494 transitions. [2018-02-04 03:21:09,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 03:21:09,956 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 132 [2018-02-04 03:21:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:09,956 INFO L225 Difference]: With dead ends: 423 [2018-02-04 03:21:09,956 INFO L226 Difference]: Without dead ends: 423 [2018-02-04 03:21:09,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=521, Invalid=4591, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 03:21:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-04 03:21:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 411. [2018-02-04 03:21:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 03:21:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 486 transitions. [2018-02-04 03:21:09,959 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 486 transitions. Word has length 132 [2018-02-04 03:21:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:09,959 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 486 transitions. [2018-02-04 03:21:09,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:21:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 486 transitions. [2018-02-04 03:21:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 03:21:09,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:09,960 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:09,960 INFO L371 AbstractCegarLoop]: === Iteration 110 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1354703802, now seen corresponding path program 6 times [2018-02-04 03:21:09,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:09,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 5 proven. 232 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-04 03:21:10,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:10,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:21:10,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:10,868 INFO L182 omatonBuilderFactory]: Interpolants [62528#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 62529#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 20))), 62530#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 20)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 62531#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 16)))) (= free_17_~array.offset 0)), 62532#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 62533#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 62534#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 62535#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 62536#(= |free_17_#t~mem9.base| 0), 62505#true, 62506#false, 62507#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 62508#(= 0 |ldv_malloc_#t~malloc1.offset|), 62509#(= 0 |ldv_malloc_#res.offset|), 62510#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 62511#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 62512#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 62513#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36))) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)))))), 62514#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 62515#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)))))), 62516#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 62517#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 20))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))))), 62518#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 62519#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20)))))), 62520#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (= entry_point_~array~0.offset 0)), 62521#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 62522#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 62523#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 62524#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 62525#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 62526#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 62527#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0)))] [2018-02-04 03:21:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 5 proven. 232 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-04 03:21:10,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:21:10,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:21:10,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:21:10,868 INFO L87 Difference]: Start difference. First operand 411 states and 486 transitions. Second operand 32 states. [2018-02-04 03:21:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:12,862 INFO L93 Difference]: Finished difference Result 422 states and 493 transitions. [2018-02-04 03:21:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:21:12,862 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 132 [2018-02-04 03:21:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:12,863 INFO L225 Difference]: With dead ends: 422 [2018-02-04 03:21:12,863 INFO L226 Difference]: Without dead ends: 422 [2018-02-04 03:21:12,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=430, Invalid=3730, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 03:21:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-04 03:21:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 411. [2018-02-04 03:21:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 03:21:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 485 transitions. [2018-02-04 03:21:12,866 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 485 transitions. Word has length 132 [2018-02-04 03:21:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:12,866 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 485 transitions. [2018-02-04 03:21:12,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:21:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 485 transitions. [2018-02-04 03:21:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-04 03:21:12,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:12,867 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:12,867 INFO L371 AbstractCegarLoop]: === Iteration 111 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash 992858898, now seen corresponding path program 7 times [2018-02-04 03:21:12,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:12,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:21:12,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:12,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:21:12,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:12,949 INFO L182 omatonBuilderFactory]: Interpolants [63436#true, 63437#false, 63438#(<= 10 entry_point_~len~0), 63439#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 63440#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 63441#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 63442#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 63443#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 4)), 63444#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 5)), 63445#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 6)), 63446#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 7)), 63447#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 8)), 63448#(<= |free_17_#in~len| 8)] [2018-02-04 03:21:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:21:12,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:21:12,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:21:12,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:21:12,950 INFO L87 Difference]: Start difference. First operand 411 states and 485 transitions. Second operand 13 states. [2018-02-04 03:21:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:12,998 INFO L93 Difference]: Finished difference Result 484 states and 546 transitions. [2018-02-04 03:21:12,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:21:12,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2018-02-04 03:21:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:12,999 INFO L225 Difference]: With dead ends: 484 [2018-02-04 03:21:12,999 INFO L226 Difference]: Without dead ends: 476 [2018-02-04 03:21:12,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:21:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-04 03:21:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 429. [2018-02-04 03:21:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-04 03:21:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 513 transitions. [2018-02-04 03:21:13,002 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 513 transitions. Word has length 131 [2018-02-04 03:21:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:13,002 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 513 transitions. [2018-02-04 03:21:13,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:21:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 513 transitions. [2018-02-04 03:21:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 03:21:13,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:13,002 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1] [2018-02-04 03:21:13,002 INFO L371 AbstractCegarLoop]: === Iteration 112 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash 685468993, now seen corresponding path program 7 times [2018-02-04 03:21:13,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:13,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 2 proven. 238 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:21:15,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:15,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 03:21:15,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:21:15,530 INFO L182 omatonBuilderFactory]: Interpolants [64384#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= alloc_17_~array.offset 0)))), 64385#(and (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 64386#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 64387#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= alloc_17_~array.offset 0)) (and (or (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (<= (+ (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 64388#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (or (<= (+ (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 64389#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))))) (= (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 64390#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (<= (@diff (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))))) (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 64391#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (@diff (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4)) (= (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (or (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4))) (= (store (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)))) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4))))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 64392#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (= (store (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (= (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 64393#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 8)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (or (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 8))) (= (store (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 8)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (or (<= (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 8)) (= (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 64394#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 4) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (or (<= (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 4) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 4)) (or (<= (@diff (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 4) (= (store (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 64395#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 64396#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 64397#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 64398#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 64399#(= 0 |free_17_#t~mem9.offset|), 64364#true, 64365#false, 64366#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 64367#(= 0 |ldv_malloc_#t~malloc1.offset|), 64368#(= 0 |ldv_malloc_#res.offset|), 64369#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 64370#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 64371#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 64372#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 64373#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)))), 64374#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 64375#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 64376#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)))), 64377#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 64378#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 64379#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 64380#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 64381#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 64382#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 64383#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)] [2018-02-04 03:21:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 2 proven. 238 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:21:15,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 03:21:15,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 03:21:15,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1155, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:21:15,531 INFO L87 Difference]: Start difference. First operand 429 states and 513 transitions. Second operand 36 states. [2018-02-04 03:21:19,114 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 71 DAG size of output 62 [2018-02-04 03:21:19,601 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-02-04 03:21:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:19,822 INFO L93 Difference]: Finished difference Result 529 states and 635 transitions. [2018-02-04 03:21:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 03:21:19,822 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 134 [2018-02-04 03:21:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:19,823 INFO L225 Difference]: With dead ends: 529 [2018-02-04 03:21:19,823 INFO L226 Difference]: Without dead ends: 529 [2018-02-04 03:21:19,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 3 SyntacticMatches, 14 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=712, Invalid=5768, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 03:21:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-04 03:21:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 512. [2018-02-04 03:21:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-02-04 03:21:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 623 transitions. [2018-02-04 03:21:19,826 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 623 transitions. Word has length 134 [2018-02-04 03:21:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:19,826 INFO L432 AbstractCegarLoop]: Abstraction has 512 states and 623 transitions. [2018-02-04 03:21:19,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 03:21:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 623 transitions. [2018-02-04 03:21:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 03:21:19,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:19,827 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1] [2018-02-04 03:21:19,827 INFO L371 AbstractCegarLoop]: === Iteration 113 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:19,827 INFO L82 PathProgramCache]: Analyzing trace with hash 685468994, now seen corresponding path program 7 times [2018-02-04 03:21:19,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:19,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 2 proven. 238 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:21:22,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:22,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 03:21:22,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:21:22,333 INFO L182 omatonBuilderFactory]: Interpolants [65537#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 65536#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 65539#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 65538#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 65541#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 65540#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 65543#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 65542#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 65545#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 65544#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 65547#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (<= (+ entry_point_~i~2 2) entry_point_~len~0))), 65546#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset))))), 65549#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 65548#(and (or (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 65551#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 65550#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 65553#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 65552#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 65555#(and (or (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (or (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (<= (+ (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 65554#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (<= (+ (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 65557#(and (or (and (or (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (<= (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (<= (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 65556#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (or (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (<= (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 65559#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (<= 0 alloc_17_~j~0) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4))) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (<= (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 65558#(and (or (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4))) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (<= (@diff (store (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 65561#(or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 8)) (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))) (or (<= (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 8)) (= (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))) (<= 0 (+ alloc_17_~j~0 1)) (= (store (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 8)) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 8)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))))) (not (= |alloc_17_#in~array.offset| 0))), 65560#(or (not (= |alloc_17_#in~array.offset| 0)) (and (<= 0 alloc_17_~j~0) (or (= (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (= (store (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))))), 65563#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 65562#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 4)) (or (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 4)) (= (store (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 4) (= (store (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 4) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))))), 65565#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 65564#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 65567#(= |free_17_#t~mem9.base| 0), 65566#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 65531#true, 65532#false, 65533#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 65534#(= 0 |ldv_malloc_#t~malloc1.offset|), 65535#(= 0 |ldv_malloc_#res.offset|)] [2018-02-04 03:21:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 2 proven. 238 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:21:22,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 03:21:22,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 03:21:22,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1235, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:21:22,334 INFO L87 Difference]: Start difference. First operand 512 states and 623 transitions. Second operand 37 states. [2018-02-04 03:21:26,814 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 86 DAG size of output 66 [2018-02-04 03:21:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:27,826 INFO L93 Difference]: Finished difference Result 528 states and 634 transitions. [2018-02-04 03:21:27,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 03:21:27,826 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 134 [2018-02-04 03:21:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:27,827 INFO L225 Difference]: With dead ends: 528 [2018-02-04 03:21:27,827 INFO L226 Difference]: Without dead ends: 528 [2018-02-04 03:21:27,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=658, Invalid=6148, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 03:21:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-02-04 03:21:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2018-02-04 03:21:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-02-04 03:21:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 622 transitions. [2018-02-04 03:21:27,830 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 622 transitions. Word has length 134 [2018-02-04 03:21:27,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:27,830 INFO L432 AbstractCegarLoop]: Abstraction has 512 states and 622 transitions. [2018-02-04 03:21:27,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 03:21:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 622 transitions. [2018-02-04 03:21:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 03:21:27,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:27,831 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:27,831 INFO L371 AbstractCegarLoop]: === Iteration 114 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1666413762, now seen corresponding path program 3 times [2018-02-04 03:21:27,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:27,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-04 03:21:27,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:27,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:21:27,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-04 03:21:27,890 INFO L182 omatonBuilderFactory]: Interpolants [66705#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 66704#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 66707#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 4)), 66706#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 66709#(<= |alloc_17_#in~len| 5), 66708#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 5)), 66701#false, 66700#true, 66703#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 66702#(<= 10 entry_point_~len~0)] [2018-02-04 03:21:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-04 03:21:27,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:21:27,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:21:27,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:21:27,890 INFO L87 Difference]: Start difference. First operand 512 states and 622 transitions. Second operand 10 states. [2018-02-04 03:21:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:27,929 INFO L93 Difference]: Finished difference Result 598 states and 715 transitions. [2018-02-04 03:21:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:21:27,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2018-02-04 03:21:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:27,930 INFO L225 Difference]: With dead ends: 598 [2018-02-04 03:21:27,930 INFO L226 Difference]: Without dead ends: 595 [2018-02-04 03:21:27,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:21:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-02-04 03:21:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 519. [2018-02-04 03:21:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-02-04 03:21:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 631 transitions. [2018-02-04 03:21:27,932 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 631 transitions. Word has length 137 [2018-02-04 03:21:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:27,933 INFO L432 AbstractCegarLoop]: Abstraction has 519 states and 631 transitions. [2018-02-04 03:21:27,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:21:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 631 transitions. [2018-02-04 03:21:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-02-04 03:21:27,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:27,933 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:27,933 INFO L371 AbstractCegarLoop]: === Iteration 115 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1856871277, now seen corresponding path program 9 times [2018-02-04 03:21:27,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:27,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 147 proven. 162 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 03:21:28,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:28,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:21:28,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:28,501 INFO L182 omatonBuilderFactory]: Interpolants [67841#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 67840#(and (<= (* 4 entry_point_~len~0) 40) (or (<= (* 4 entry_point_~len~0) 39) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 8)) entry_point_~array~0.offset)) entry_point_~array~0.base))) (= entry_point_~array~0.offset 0)), 67843#(and (= free_17_~array.offset 0) (<= (* 4 free_17_~len) 40) (or (<= (* 4 free_17_~len) 39) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base)))), 67842#(and (= 0 |free_17_#in~array.offset|) (or (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 |free_17_#in~len|) (- 8))) |free_17_#in~array.base|)) (<= (* 4 |free_17_#in~len|) 39)) (<= (* 4 |free_17_#in~len|) 40)), 67845#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 35)) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 36)) (= free_17_~array.offset 0)), 67844#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 40)) (or (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base)) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 39))) (= free_17_~array.offset 0)), 67847#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 27)) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base))) (= free_17_~array.offset 0) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 28))), 67846#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 31)) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base))) (= free_17_~array.offset 0) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 32))), 67849#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 19)) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 20)) (= free_17_~array.offset 0)), 67848#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 24)) (or (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base)) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 23))) (= free_17_~array.offset 0)), 67851#(and (or (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base)) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 11))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 67850#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 16)) (or (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) free_17_~array.base)) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 15))) (= free_17_~array.offset 0)), 67853#(or (and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))) (<= free_17_~len (+ free_17_~i~1 1))), 67852#(and (or (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 7))) (= free_17_~array.offset 0)), 67855#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len free_17_~i~1)), 67854#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len (+ free_17_~i~1 1))), 67856#(= 1 (select |#valid| free_17_~array.base)), 67829#true, 67831#(<= entry_point_~len~0 10), 67830#false, 67833#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 67832#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 67835#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 67834#(and (<= entry_point_~len~0 10) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 67837#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (<= (* 4 entry_point_~len~0) 40) (or (<= (* 4 entry_point_~len~0) 39) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (- 4)) entry_point_~array~0.offset)) entry_point_~array~0.base))))) (= 0 entry_point_~array~0.offset)), 67836#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) entry_point_~array~0.base))), 67839#(and (= 0 entry_point_~array~0.offset) (or (and (<= (* 4 entry_point_~len~0) 40) (or (<= (* 4 entry_point_~len~0) 39) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 8)) entry_point_~array~0.offset)) entry_point_~array~0.base)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 67838#(and (= 0 entry_point_~array~0.offset) (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (or (<= (* 4 entry_point_~i~2) 35) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (- 4)) entry_point_~array~0.offset)) entry_point_~array~0.base))) (<= (* 4 entry_point_~i~2) 36))))] [2018-02-04 03:21:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 147 proven. 162 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 03:21:28,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:21:28,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:21:28,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:21:28,501 INFO L87 Difference]: Start difference. First operand 519 states and 631 transitions. Second operand 28 states. Received shutdown request... [2018-02-04 03:21:29,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:21:29,300 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 03:21:29,304 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 03:21:29,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:21:29 BoogieIcfgContainer [2018-02-04 03:21:29,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:21:29,305 INFO L168 Benchmark]: Toolchain (without parser) took 169074.14 ms. Allocated memory was 404.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 361.5 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 155.0 MB. Max. memory is 5.3 GB. [2018-02-04 03:21:29,306 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:21:29,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.10 ms. Allocated memory is still 404.8 MB. Free memory was 361.5 MB in the beginning and 348.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:21:29,306 INFO L168 Benchmark]: Boogie Preprocessor took 32.82 ms. Allocated memory is still 404.8 MB. Free memory was 348.3 MB in the beginning and 347.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:21:29,306 INFO L168 Benchmark]: RCFGBuilder took 226.05 ms. Allocated memory is still 404.8 MB. Free memory was 347.0 MB in the beginning and 322.2 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. [2018-02-04 03:21:29,306 INFO L168 Benchmark]: TraceAbstraction took 168646.81 ms. Allocated memory was 404.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 322.2 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 115.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:21:29,307 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.10 ms. Allocated memory is still 404.8 MB. Free memory was 361.5 MB in the beginning and 348.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.82 ms. Allocated memory is still 404.8 MB. Free memory was 348.3 MB in the beginning and 347.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 226.05 ms. Allocated memory is still 404.8 MB. Free memory was 347.0 MB in the beginning and 322.2 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 168646.81 ms. Allocated memory was 404.8 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 322.2 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 115.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (519states) and interpolant automaton (currently 27 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 168.6s OverallTime, 115 OverallIterations, 11 TraceHistogramMax, 110.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7908 SDtfs, 14995 SDslu, 64567 SDs, 0 SdLazy, 94707 SolverSat, 5114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4975 GetRequests, 277 SyntacticMatches, 483 SemanticMatches, 4215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49248 ImplicationChecksByTransitivity, 104.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=519occurred in iteration=114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 13166/25834 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 114 MinimizatonAttempts, 1559 StatesRemovedByMinimization, 110 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 53.5s InterpolantComputationTime, 11168 NumberOfCodeBlocks, 11168 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 11053 ConstructedInterpolants, 0 QuantifiedInterpolants, 20636541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 115 InterpolantComputations, 11 PerfectInterpolantSequences, 13166/25834 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_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-21-29-312.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-21-29-312.csv Completed graceful shutdown