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_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:11:23,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:11:23,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:11:23,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:11:23,582 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:11:23,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:11:23,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:11:23,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:11:23,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:11:23,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:11:23,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:11:23,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:11:23,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:11:23,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:11:23,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:11:23,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:11:23,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:11:23,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:11:23,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:11:23,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:11:23,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:11:23,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:11:23,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:11:23,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:11:23,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:11:23,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:11:23,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:11:23,601 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:11:23,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:11:23,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:11:23,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:11:23,602 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:11:23,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:11:23,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:11:23,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:11:23,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:11:23,613 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:11:23,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:11:23,613 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:11:23,613 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:11:23,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:11:23,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:11:23,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:11:23,614 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:11:23,614 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:11:23,614 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:11:23,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:11:23,614 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:11:23,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:11:23,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:11:23,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:11:23,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:11:23,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:11:23,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:11:23,616 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:11:23,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:11:23,657 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:11:23,663 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:11:23,665 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:11:23,665 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:11:23,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-02-04 03:11:23,842 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:11:23,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:11:23,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:11:23,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:11:23,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:11:23,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:23,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23, skipping insertion in model container [2018-02-04 03:11:23,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:23,863 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:11:23,897 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:11:23,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:11:23,994 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:11:23,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23 WrapperNode [2018-02-04 03:11:23,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:11:23,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:11:23,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:11:23,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:11:24,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:24,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:24,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:24,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:24,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:24,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:24,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (1/1) ... [2018-02-04 03:11:24,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:11:24,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:11:24,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:11:24,023 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:11:24,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (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:11:24,059 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:11:24,059 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:11:24,059 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:11:24,059 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 03:11:24,059 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:11:24,060 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:11:24,060 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:11:24,061 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:11:24,061 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:11:24,213 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:11:24,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:11:24 BoogieIcfgContainer [2018-02-04 03:11:24,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:11:24,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:11:24,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:11:24,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:11:24,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:11:23" (1/3) ... [2018-02-04 03:11:24,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710e4625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:11:24, skipping insertion in model container [2018-02-04 03:11:24,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:11:23" (2/3) ... [2018-02-04 03:11:24,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710e4625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:11:24, skipping insertion in model container [2018-02-04 03:11:24,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:11:24" (3/3) ... [2018-02-04 03:11:24,218 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-02-04 03:11:24,223 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:11:24,227 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 03:11:24,262 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:11:24,262 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:11:24,262 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:11:24,262 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:11:24,263 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:11:24,263 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:11:24,263 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:11:24,263 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:11:24,264 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:11:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-02-04 03:11:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:11:24,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:24,282 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:11:24,283 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029176, now seen corresponding path program 1 times [2018-02-04 03:11:24,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:24,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:24,427 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:11:24,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:24,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:11:24,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:24,429 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:11:24,430 INFO L182 omatonBuilderFactory]: Interpolants [65#true, 66#false, 67#(= |#valid| |old(#valid)|)] [2018-02-04 03:11:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:11:24,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:11:24,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:11:24,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:11:24,440 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-02-04 03:11:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:24,612 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2018-02-04 03:11:24,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:11:24,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 03:11:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:24,623 INFO L225 Difference]: With dead ends: 102 [2018-02-04 03:11:24,624 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 03:11:24,625 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:11:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 03:11:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-02-04 03:11:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 03:11:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-02-04 03:11:24,656 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 17 [2018-02-04 03:11:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:24,656 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-02-04 03:11:24,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:11:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-02-04 03:11:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:11:24,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:24,658 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:11:24,658 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1524292544, now seen corresponding path program 1 times [2018-02-04 03:11:24,659 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:24,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:24,720 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:11:24,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:24,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:11:24,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:24,721 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:11:24,721 INFO L182 omatonBuilderFactory]: Interpolants [233#true, 234#false, 235#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 236#(and (= 0 |entry_point_#t~ret8.offset|) (= 0 |entry_point_#t~ret8.base|)), 237#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-04 03:11:24,721 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:11:24,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:11:24,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:11:24,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:11:24,723 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-02-04 03:11:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:24,748 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-02-04 03:11:24,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:11:24,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 03:11:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:24,750 INFO L225 Difference]: With dead ends: 65 [2018-02-04 03:11:24,750 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 03:11:24,750 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:11:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 03:11:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-02-04 03:11:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 03:11:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-04 03:11:24,756 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 17 [2018-02-04 03:11:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:24,756 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-04 03:11:24,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:11:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-04 03:11:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:11:24,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:24,757 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:11:24,757 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1268239334, now seen corresponding path program 1 times [2018-02-04 03:11:24,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:24,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:24,807 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:11:24,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:24,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:11:24,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:24,808 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:11:24,808 INFO L182 omatonBuilderFactory]: Interpolants [368#(not (= 0 |entry_point_#t~ret8.base|)), 369#(not (= 0 entry_point_~array~0.base)), 364#true, 365#false, 366#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 367#(not (= 0 |ldv_malloc_#res.base|))] [2018-02-04 03:11:24,808 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:11:24,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:11:24,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:11:24,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:11:24,809 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 6 states. [2018-02-04 03:11:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:24,847 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-02-04 03:11:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:11:24,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:11:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:24,849 INFO L225 Difference]: With dead ends: 61 [2018-02-04 03:11:24,849 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 03:11:24,849 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:11:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 03:11:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 03:11:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 03:11:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 03:11:24,855 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2018-02-04 03:11:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:24,855 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 03:11:24,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:11:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 03:11:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:11:24,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:24,856 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:11:24,856 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975966, now seen corresponding path program 1 times [2018-02-04 03:11:24,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:24,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:24,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:11:24,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:24,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:11:24,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:24,915 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:11:24,915 INFO L182 omatonBuilderFactory]: Interpolants [496#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 497#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 498#(= 1 (select |#valid| |entry_point_#t~ret8.base|)), 499#(= 1 (select |#valid| entry_point_~array~0.base)), 494#true, 495#false] [2018-02-04 03:11:24,915 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:11:24,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:11:24,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:11:24,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:11:24,916 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-02-04 03:11:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:25,004 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 03:11:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:11:25,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:11:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:25,005 INFO L225 Difference]: With dead ends: 60 [2018-02-04 03:11:25,005 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 03:11:25,006 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:11:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 03:11:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 03:11:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 03:11:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 03:11:25,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 19 [2018-02-04 03:11:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:25,010 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 03:11:25,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:11:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 03:11:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:11:25,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:25,011 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:11:25,011 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1268975965, now seen corresponding path program 1 times [2018-02-04 03:11:25,012 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:25,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:25,204 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:11:25,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:25,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:11:25,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:25,205 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:11:25,205 INFO L182 omatonBuilderFactory]: Interpolants [624#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 625#(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))), 626#(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|)), 627#(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|))), 628#(and (= 0 |entry_point_#t~ret8.offset|) (<= 40 (select |#length| |entry_point_#t~ret8.base|))), 629#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 630#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~1 0)), 622#true, 623#false] [2018-02-04 03:11:25,205 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:11:25,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:11:25,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:11:25,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:11:25,206 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2018-02-04 03:11:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:25,376 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 03:11:25,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:11:25,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 03:11:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:25,377 INFO L225 Difference]: With dead ends: 64 [2018-02-04 03:11:25,377 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 03:11:25,377 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:11:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 03:11:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-02-04 03:11:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 03:11:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 03:11:25,380 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 19 [2018-02-04 03:11:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:25,380 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 03:11:25,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:11:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 03:11:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:11:25,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:25,381 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:11:25,381 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1174934022, now seen corresponding path program 1 times [2018-02-04 03:11:25,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:25,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:25,571 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:11:25,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:25,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:11:25,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:25,572 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:11:25,572 INFO L182 omatonBuilderFactory]: Interpolants [768#true, 769#false, 770#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 771#(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))), 772#(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)), 773#(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|)))), 774#(or (<= (+ (select |#length| |entry_point_#t~ret8.base|) 1) 0) (and (= 0 |entry_point_#t~ret8.offset|) (<= 40 (select |#length| |entry_point_#t~ret8.base|)))), 775#(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))), 776#(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~1 0)), 777#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~1 0)), 778#(and (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~1) 36) (select |#length| entry_point_~array~0.base)))] [2018-02-04 03:11:25,573 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:11:25,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:11:25,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:11:25,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:11:25,573 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 11 states. [2018-02-04 03:11:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:25,812 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-04 03:11:25,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:11:25,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 03:11:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:25,813 INFO L225 Difference]: With dead ends: 69 [2018-02-04 03:11:25,813 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 03:11:25,813 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:11:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 03:11:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-02-04 03:11:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 03:11:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 03:11:25,816 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 23 [2018-02-04 03:11:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:25,816 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 03:11:25,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:11:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 03:11:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:11:25,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:25,817 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:11:25,817 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash 614865, now seen corresponding path program 2 times [2018-02-04 03:11:25,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:25,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,010 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:11:26,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:26,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:11:26,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,011 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:11:26,011 INFO L182 omatonBuilderFactory]: Interpolants [929#true, 930#false, 931#(<= 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 (<= (+ (select |#length| |entry_point_#t~ret8.base|) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret8.base|)) (= 0 |entry_point_#t~ret8.offset|))), 936#(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))), 937#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 938#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 939#(and (<= 0 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 940#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 941#(and (<= 4 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~1) 4) (select |#length| entry_point_~array~0.base)))] [2018-02-04 03:11:26,011 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:11:26,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:11:26,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:11:26,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:11:26,011 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 13 states. [2018-02-04 03:11:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,190 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-02-04 03:11:26,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:11:26,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 03:11:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,190 INFO L225 Difference]: With dead ends: 66 [2018-02-04 03:11:26,191 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 03:11:26,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:11:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 03:11:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-02-04 03:11:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 03:11:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-02-04 03:11:26,196 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 27 [2018-02-04 03:11:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,196 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-02-04 03:11:26,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:11:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-02-04 03:11:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:11:26,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,197 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] [2018-02-04 03:11:26,197 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2025596221, now seen corresponding path program 1 times [2018-02-04 03:11:26,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,236 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:11:26,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:26,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:11:26,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,237 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:11:26,237 INFO L182 omatonBuilderFactory]: Interpolants [1083#true, 1084#false, 1085#(= 1 (select |#valid| entry_point_~array~0.base)), 1086#(= |#valid| |old(#valid)|)] [2018-02-04 03:11:26,237 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:11:26,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:11:26,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:11:26,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:11:26,238 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 4 states. [2018-02-04 03:11:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,292 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-04 03:11:26,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:11:26,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-04 03:11:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,294 INFO L225 Difference]: With dead ends: 87 [2018-02-04 03:11:26,294 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 03:11:26,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:11:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 03:11:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-02-04 03:11:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 03:11:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2018-02-04 03:11:26,300 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 31 [2018-02-04 03:11:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,300 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2018-02-04 03:11:26,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:11:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-02-04 03:11:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:11:26,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,301 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] [2018-02-04 03:11:26,301 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2025596220, now seen corresponding path program 1 times [2018-02-04 03:11:26,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,336 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:11:26,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:26,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:11:26,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,337 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:11:26,338 INFO L182 omatonBuilderFactory]: Interpolants [1251#true, 1252#false, 1253#(= 0 |ldv_malloc_#t~malloc1.offset|), 1254#(= 0 |ldv_malloc_#res.offset|), 1255#(= 0 |entry_point_#t~ret8.offset|), 1256#(= 0 entry_point_~array~0.offset)] [2018-02-04 03:11:26,338 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:11:26,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:11:26,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:11:26,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:11:26,339 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 6 states. [2018-02-04 03:11:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,357 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-02-04 03:11:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:11:26,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 03:11:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,358 INFO L225 Difference]: With dead ends: 76 [2018-02-04 03:11:26,359 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 03:11:26,359 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:11:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 03:11:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 03:11:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 03:11:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2018-02-04 03:11:26,363 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 31 [2018-02-04 03:11:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,363 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2018-02-04 03:11:26,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:11:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2018-02-04 03:11:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:11:26,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,364 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:11:26,364 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash 324245613, now seen corresponding path program 1 times [2018-02-04 03:11:26,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,410 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:11:26,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:26,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:11:26,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,411 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:11:26,411 INFO L182 omatonBuilderFactory]: Interpolants [1411#true, 1412#false, 1413#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1414#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1415#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-04 03:11:26,411 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:11:26,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:11:26,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:11:26,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:11:26,412 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 5 states. [2018-02-04 03:11:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,419 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-02-04 03:11:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:11:26,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 03:11:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,420 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:11:26,420 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:11:26,421 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:11:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:11:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-02-04 03:11:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 03:11:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-02-04 03:11:26,423 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 34 [2018-02-04 03:11:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,423 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-02-04 03:11:26,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:11:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-02-04 03:11:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:11:26,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,424 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] [2018-02-04 03:11:26,424 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,424 INFO L82 PathProgramCache]: Analyzing trace with hash 246550693, now seen corresponding path program 1 times [2018-02-04 03:11:26,425 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,454 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:11:26,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:26,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:11:26,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,455 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:11:26,455 INFO L182 omatonBuilderFactory]: Interpolants [1572#true, 1573#false, 1574#(<= 10 entry_point_~len~0), 1575#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1576#(<= (+ entry_point_~i~1 9) entry_point_~len~0)] [2018-02-04 03:11:26,455 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:11:26,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:11:26,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:11:26,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:11:26,456 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 5 states. [2018-02-04 03:11:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,475 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-04 03:11:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:11:26,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 03:11:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,476 INFO L225 Difference]: With dead ends: 82 [2018-02-04 03:11:26,476 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 03:11:26,477 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:11:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 03:11:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-02-04 03:11:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 03:11:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-02-04 03:11:26,480 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2018-02-04 03:11:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,481 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-02-04 03:11:26,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:11:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-02-04 03:11:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 03:11:26,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,482 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] [2018-02-04 03:11:26,482 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1199349870, now seen corresponding path program 2 times [2018-02-04 03:11:26,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,513 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:11:26,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:26,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:11:26,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,514 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:11:26,514 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1745#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 1746#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 1741#true, 1742#false, 1743#(<= 10 entry_point_~len~0)] [2018-02-04 03:11:26,514 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:11:26,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:11:26,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:11:26,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:11:26,515 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 6 states. [2018-02-04 03:11:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,541 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-02-04 03:11:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:11:26,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-04 03:11:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,542 INFO L225 Difference]: With dead ends: 86 [2018-02-04 03:11:26,542 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 03:11:26,543 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:11:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 03:11:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-02-04 03:11:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 03:11:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-02-04 03:11:26,545 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38 [2018-02-04 03:11:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,546 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-02-04 03:11:26,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:11:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-02-04 03:11:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:11:26,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,546 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] [2018-02-04 03:11:26,547 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash -176675913, now seen corresponding path program 3 times [2018-02-04 03:11:26,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,582 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:11:26,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:26,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:11:26,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,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:11:26,583 INFO L182 omatonBuilderFactory]: Interpolants [1921#true, 1922#false, 1923#(<= 10 entry_point_~len~0), 1924#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 1925#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 1926#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 1927#(<= (+ entry_point_~i~1 7) entry_point_~len~0)] [2018-02-04 03:11:26,583 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:11:26,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:11:26,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:11:26,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:11:26,583 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 7 states. [2018-02-04 03:11:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,620 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-02-04 03:11:26,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:11:26,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-02-04 03:11:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,621 INFO L225 Difference]: With dead ends: 90 [2018-02-04 03:11:26,621 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 03:11:26,621 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:11:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 03:11:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-02-04 03:11:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 03:11:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-02-04 03:11:26,624 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 42 [2018-02-04 03:11:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,624 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-02-04 03:11:26,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:11:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-02-04 03:11:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:11:26,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,625 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] [2018-02-04 03:11:26,626 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1744755328, now seen corresponding path program 4 times [2018-02-04 03:11:26,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,676 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:11:26,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:26,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:11:26,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,677 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:11:26,677 INFO L182 omatonBuilderFactory]: Interpolants [2112#true, 2113#false, 2114#(<= 10 entry_point_~len~0), 2115#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2116#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2117#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2118#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2119#(<= (+ entry_point_~i~1 6) entry_point_~len~0)] [2018-02-04 03:11:26,677 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:11:26,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:11:26,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:11:26,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:11:26,678 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2018-02-04 03:11:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,742 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-02-04 03:11:26,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:11:26,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 03:11:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,744 INFO L225 Difference]: With dead ends: 94 [2018-02-04 03:11:26,744 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 03:11:26,744 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:11:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 03:11:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-02-04 03:11:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 03:11:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-02-04 03:11:26,747 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 46 [2018-02-04 03:11:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,747 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-02-04 03:11:26,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:11:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-02-04 03:11:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:11:26,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,748 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] [2018-02-04 03:11:26,749 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash 927663305, now seen corresponding path program 5 times [2018-02-04 03:11:26,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,808 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:11:26,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:26,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:11:26,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,809 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:11:26,809 INFO L182 omatonBuilderFactory]: Interpolants [2320#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2321#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2322#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2314#true, 2315#false, 2316#(<= 10 entry_point_~len~0), 2317#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2318#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2319#(<= (+ entry_point_~i~1 8) entry_point_~len~0)] [2018-02-04 03:11:26,809 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:11:26,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:11:26,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:11:26,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:11:26,810 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 9 states. [2018-02-04 03:11:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:26,882 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-02-04 03:11:26,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:11:26,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-02-04 03:11:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:26,884 INFO L225 Difference]: With dead ends: 98 [2018-02-04 03:11:26,884 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 03:11:26,884 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:11:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 03:11:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-04 03:11:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 03:11:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-04 03:11:26,888 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 50 [2018-02-04 03:11:26,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:26,888 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-04 03:11:26,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:11:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-04 03:11:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 03:11:26,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:26,889 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] [2018-02-04 03:11:26,889 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash -730406254, now seen corresponding path program 6 times [2018-02-04 03:11:26,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:26,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:26,967 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:11:26,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:26,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:11:26,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:26,968 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:11:26,968 INFO L182 omatonBuilderFactory]: Interpolants [2528#false, 2529#(<= 10 entry_point_~len~0), 2530#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2531#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2532#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2533#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2534#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2535#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2536#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2527#true] [2018-02-04 03:11:26,968 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:11:26,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:11:26,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:11:26,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:11:26,969 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 10 states. [2018-02-04 03:11:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:27,054 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2018-02-04 03:11:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:11:27,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-04 03:11:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:27,056 INFO L225 Difference]: With dead ends: 102 [2018-02-04 03:11:27,056 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 03:11:27,056 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:11:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 03:11:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-04 03:11:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 03:11:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-02-04 03:11:27,060 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 54 [2018-02-04 03:11:27,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:27,060 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-02-04 03:11:27,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:11:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-02-04 03:11:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 03:11:27,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:27,061 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] [2018-02-04 03:11:27,061 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash 427602907, now seen corresponding path program 7 times [2018-02-04 03:11:27,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:27,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:27,148 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:11:27,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:27,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:11:27,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:27,149 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:11:27,149 INFO L182 omatonBuilderFactory]: Interpolants [2752#false, 2753#(<= 10 entry_point_~len~0), 2754#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2755#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2756#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 2757#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2758#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2759#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2760#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2761#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 2751#true] [2018-02-04 03:11:27,149 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:11:27,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:11:27,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:11:27,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:11:27,150 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 11 states. [2018-02-04 03:11:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:27,229 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-02-04 03:11:27,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:11:27,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-02-04 03:11:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:27,229 INFO L225 Difference]: With dead ends: 106 [2018-02-04 03:11:27,229 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 03:11:27,230 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:11:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 03:11:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-02-04 03:11:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 03:11:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-02-04 03:11:27,232 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 58 [2018-02-04 03:11:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:27,232 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-02-04 03:11:27,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:11:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-02-04 03:11:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:11:27,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:27,233 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] [2018-02-04 03:11:27,234 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash -650725212, now seen corresponding path program 8 times [2018-02-04 03:11:27,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:27,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:27,333 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:11:27,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:27,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:11:27,334 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:27,334 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:11:27,334 INFO L182 omatonBuilderFactory]: Interpolants [2992#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 2993#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 2994#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 2995#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 2996#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 2997#(<= (+ entry_point_~i~1 2) entry_point_~len~0), 2986#true, 2987#false, 2988#(<= 10 entry_point_~len~0), 2989#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 2990#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 2991#(<= (+ entry_point_~i~1 8) entry_point_~len~0)] [2018-02-04 03:11:27,334 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:11:27,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:11:27,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:11:27,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:11:27,335 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 12 states. [2018-02-04 03:11:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:27,437 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-02-04 03:11:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:11:27,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-02-04 03:11:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:27,437 INFO L225 Difference]: With dead ends: 110 [2018-02-04 03:11:27,438 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 03:11:27,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:11:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 03:11:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-02-04 03:11:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:11:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-02-04 03:11:27,440 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 62 [2018-02-04 03:11:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:27,440 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-02-04 03:11:27,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:11:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-02-04 03:11:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 03:11:27,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:27,440 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] [2018-02-04 03:11:27,440 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:27,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1868509421, now seen corresponding path program 9 times [2018-02-04 03:11:27,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:27,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:27,513 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:11:27,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:27,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:11:27,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:27,514 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:11:27,514 INFO L182 omatonBuilderFactory]: Interpolants [3232#true, 3233#false, 3234#(<= 10 entry_point_~len~0), 3235#(and (<= 10 entry_point_~len~0) (= entry_point_~i~1 0)), 3236#(<= (+ entry_point_~i~1 9) entry_point_~len~0), 3237#(<= (+ entry_point_~i~1 8) entry_point_~len~0), 3238#(<= (+ entry_point_~i~1 7) entry_point_~len~0), 3239#(<= (+ entry_point_~i~1 6) entry_point_~len~0), 3240#(<= (+ entry_point_~i~1 5) entry_point_~len~0), 3241#(<= (+ entry_point_~i~1 4) entry_point_~len~0), 3242#(<= (+ entry_point_~i~1 3) entry_point_~len~0), 3243#(<= (+ entry_point_~i~1 2) entry_point_~len~0), 3244#(<= (+ entry_point_~i~1 1) entry_point_~len~0)] [2018-02-04 03:11:27,514 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:11:27,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:11:27,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:11:27,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:11:27,515 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 13 states. [2018-02-04 03:11:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:27,620 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-02-04 03:11:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:11:27,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-02-04 03:11:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:27,621 INFO L225 Difference]: With dead ends: 112 [2018-02-04 03:11:27,621 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:11:27,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:11:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:11:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 03:11:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:11:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-02-04 03:11:27,624 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 66 [2018-02-04 03:11:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:27,624 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-02-04 03:11:27,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:11:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-02-04 03:11:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 03:11:27,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:27,625 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] [2018-02-04 03:11:27,625 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1351638198, now seen corresponding path program 10 times [2018-02-04 03:11:27,626 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:27,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:27,661 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:11:27,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:27,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:11:27,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:27,662 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:11:27,662 INFO L182 omatonBuilderFactory]: Interpolants [3488#false, 3489#(<= 10 entry_point_~len~0), 3490#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 3491#(<= |alloc_17_#in~len| 0), 3487#true] [2018-02-04 03:11:27,662 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:11:27,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:11:27,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:11:27,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:11:27,662 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 5 states. [2018-02-04 03:11:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:27,689 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-02-04 03:11:27,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:11:27,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-02-04 03:11:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:27,690 INFO L225 Difference]: With dead ends: 137 [2018-02-04 03:11:27,690 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 03:11:27,690 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:11:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 03:11:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2018-02-04 03:11:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 03:11:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-02-04 03:11:27,693 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 70 [2018-02-04 03:11:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:27,693 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-02-04 03:11:27,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:11:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-02-04 03:11:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:11:27,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:27,693 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:11:27,693 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1434451296, now seen corresponding path program 1 times [2018-02-04 03:11:27,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:27,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 03:11:27,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:27,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:11:27,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:27,953 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:11:27,953 INFO L182 omatonBuilderFactory]: Interpolants [3744#(<= 10 entry_point_~len~0), 3745#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3746#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 3747#(and (<= 10 entry_point_~len~0) (= (select |#valid| |entry_point_#t~ret8.base|) 1) (= 0 |entry_point_#t~ret8.offset|)), 3748#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3749#(and (<= (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 44) (+ (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)), 3750#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (<= (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 40) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)))), 3751#(and (<= (+ entry_point_~array~0.offset 40) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3752#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (<= 40 (select |#length| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 3753#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 40 (select |#length| alloc_17_~array.base))), 3754#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3755#(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|))), 3756#(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|))))), 3757#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 40 (select |#length| alloc_17_~array.base))), 3742#true, 3743#false] [2018-02-04 03:11:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 03:11:27,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:11:27,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:11:27,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:11:27,955 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 16 states. [2018-02-04 03:11:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:28,398 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2018-02-04 03:11:28,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:11:28,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-04 03:11:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:28,398 INFO L225 Difference]: With dead ends: 172 [2018-02-04 03:11:28,398 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 03:11:28,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:11:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 03:11:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2018-02-04 03:11:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 03:11:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2018-02-04 03:11:28,401 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 72 [2018-02-04 03:11:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:28,401 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2018-02-04 03:11:28,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:11:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2018-02-04 03:11:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:11:28,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:28,402 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:11:28,402 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:28,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1434451295, now seen corresponding path program 1 times [2018-02-04 03:11:28,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:28,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:28,515 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:11:28,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:28,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:11:28,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:28,515 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:11:28,515 INFO L182 omatonBuilderFactory]: Interpolants [4081#true, 4082#false, 4083#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4084#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4085#(= 1 (select |#valid| |entry_point_#t~ret8.base|)), 4086#(= 1 (select |#valid| entry_point_~array~0.base)), 4087#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 4088#(= 1 (select |#valid| alloc_17_~array.base)), 4089#(= |#valid| |old(#valid)|), 4090#(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|)), 4091#(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:11:28,516 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:11:28,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:11:28,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:11:28,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:11:28,516 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 11 states. [2018-02-04 03:11:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:28,689 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2018-02-04 03:11:28,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:11:28,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-04 03:11:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:28,690 INFO L225 Difference]: With dead ends: 159 [2018-02-04 03:11:28,690 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 03:11:28,691 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:11:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 03:11:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2018-02-04 03:11:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 03:11:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-02-04 03:11:28,694 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 72 [2018-02-04 03:11:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:28,695 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-02-04 03:11:28,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:11:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-02-04 03:11:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 03:11:28,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:28,696 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:11:28,696 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:28,696 INFO L82 PathProgramCache]: Analyzing trace with hash 955550151, now seen corresponding path program 1 times [2018-02-04 03:11:28,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:28,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:28,771 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:11:28,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:28,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:11:28,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:28,772 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:11:28,772 INFO L182 omatonBuilderFactory]: Interpolants [4374#true, 4375#false, 4376#(= alloc_17_~i~0 0), 4377#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-04 03:11:28,773 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:11:28,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:11:28,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:11:28,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:11:28,773 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-02-04 03:11:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:28,813 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 03:11:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:11:28,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 03:11:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:28,815 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:11:28,815 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:11:28,815 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:11:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:11:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-02-04 03:11:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 03:11:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-02-04 03:11:28,820 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 73 [2018-02-04 03:11:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:28,820 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-02-04 03:11:28,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:11:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-02-04 03:11:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 03:11:28,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:28,821 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] [2018-02-04 03:11:28,821 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 509492026, now seen corresponding path program 1 times [2018-02-04 03:11:28,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:28,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-04 03:11:28,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:28,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:11:28,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:28,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:11:28,987 INFO L182 omatonBuilderFactory]: Interpolants [4614#true, 4615#false, 4616#(= |#valid| |old(#valid)|), 4617#(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)), 4618#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 4619#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret8.base| (select |#valid| |entry_point_#t~ret8.base|))) (= (select |old(#valid)| |entry_point_#t~ret8.base|) 0) (not (= 0 |entry_point_#t~ret8.base|))), 4620#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))))] [2018-02-04 03:11:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-04 03:11:28,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:11:28,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:11:28,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:11:28,988 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-02-04 03:11:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:29,108 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 03:11:29,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:11:29,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-02-04 03:11:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:29,110 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:11:29,110 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 03:11:29,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:11:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 03:11:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 03:11:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:11:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-02-04 03:11:29,112 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 80 [2018-02-04 03:11:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:29,113 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-02-04 03:11:29,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:11:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-02-04 03:11:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:11:29,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:29,114 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] [2018-02-04 03:11:29,114 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:29,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2010390940, now seen corresponding path program 1 times [2018-02-04 03:11:29,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:29,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:29,155 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:11:29,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:11:29,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:11:29,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:29,156 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:11:29,156 INFO L182 omatonBuilderFactory]: Interpolants [4864#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 4865#(not (= 0 |ldv_malloc_#res.base|)), 4866#(not (= 0 |alloc_17_#t~ret3.base|)), 4867#(not (= 0 alloc_17_~p~0.base)), 4862#true, 4863#false] [2018-02-04 03:11:29,156 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:11:29,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:11:29,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:11:29,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:11:29,157 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-02-04 03:11:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:29,180 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-04 03:11:29,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:11:29,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-02-04 03:11:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:29,181 INFO L225 Difference]: With dead ends: 111 [2018-02-04 03:11:29,181 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 03:11:29,182 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:11:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 03:11:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 03:11:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 03:11:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-04 03:11:29,184 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 82 [2018-02-04 03:11:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:29,185 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-04 03:11:29,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:11:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-04 03:11:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 03:11:29,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:29,185 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] [2018-02-04 03:11:29,186 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:29,186 INFO L82 PathProgramCache]: Analyzing trace with hash 732875601, now seen corresponding path program 1 times [2018-02-04 03:11:29,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:29,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:29,246 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:11:29,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:29,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:11:29,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:29,246 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:11:29,246 INFO L182 omatonBuilderFactory]: Interpolants [5092#true, 5093#false, 5094#(<= 10 entry_point_~len~0), 5095#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 5096#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 5097#(<= |alloc_17_#in~len| 1)] [2018-02-04 03:11:29,251 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:11:29,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:11:29,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:11:29,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:11:29,251 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 6 states. [2018-02-04 03:11:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:29,294 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-02-04 03:11:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:11:29,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-04 03:11:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:29,295 INFO L225 Difference]: With dead ends: 144 [2018-02-04 03:11:29,295 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 03:11:29,295 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:11:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 03:11:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-02-04 03:11:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:11:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-02-04 03:11:29,298 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 83 [2018-02-04 03:11:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:29,299 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-02-04 03:11:29,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:11:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-02-04 03:11:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 03:11:29,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:29,299 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:11:29,300 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:29,300 INFO L82 PathProgramCache]: Analyzing trace with hash -490917573, now seen corresponding path program 1 times [2018-02-04 03:11:29,300 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:29,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:29,649 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:11:29,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:29,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:11:29,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:29,650 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:11:29,650 INFO L182 omatonBuilderFactory]: Interpolants [5356#true, 5357#false, 5358#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5359#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5360#(and (= (select |#valid| |entry_point_#t~ret8.base|) 1) (= 0 |entry_point_#t~ret8.offset|)), 5361#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 5362#(and (<= (+ (* 4 entry_point_~i~1) 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)), 5363#(and (<= (+ (* 4 entry_point_~i~1) 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)), 5364#(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)), 5365#(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|)), 5366#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 5367#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5368#(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|))), 5369#(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|))))), 5370#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 5371#(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)), 5372#(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)), 5373#(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)), 5374#(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))] [2018-02-04 03:11:29,650 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:11:29,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:11:29,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:11:29,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:11:29,651 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 19 states. [2018-02-04 03:11:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:30,086 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-02-04 03:11:30,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:11:30,086 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-02-04 03:11:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:30,087 INFO L225 Difference]: With dead ends: 137 [2018-02-04 03:11:30,087 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 03:11:30,087 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:11:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 03:11:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2018-02-04 03:11:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 03:11:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-02-04 03:11:30,089 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 85 [2018-02-04 03:11:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:30,090 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-02-04 03:11:30,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:11:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-02-04 03:11:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:11:30,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:30,091 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:11:30,091 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1398657356, now seen corresponding path program 1 times [2018-02-04 03:11:30,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:30,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:30,226 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:11:30,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:30,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:11:30,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:30,227 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:11:30,227 INFO L182 omatonBuilderFactory]: Interpolants [5664#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 5665#(= |old(#length)| |#length|), 5666#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 5667#(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)), 5655#true, 5656#false, 5657#(= 0 |ldv_malloc_#t~malloc1.offset|), 5658#(= 0 |ldv_malloc_#res.offset|), 5659#(= 0 |entry_point_#t~ret8.offset|), 5660#(= 0 entry_point_~array~0.offset), 5661#(= 0 |alloc_17_#in~array.offset|), 5662#(= alloc_17_~array.offset 0), 5663#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)))] [2018-02-04 03:11:30,228 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:11:30,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:11:30,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:11:30,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:11:30,228 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 13 states. [2018-02-04 03:11:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:30,442 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-04 03:11:30,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:11:30,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-04 03:11:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:30,443 INFO L225 Difference]: With dead ends: 111 [2018-02-04 03:11:30,443 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 03:11:30,443 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:11:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 03:11:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 03:11:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 03:11:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-04 03:11:30,446 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 86 [2018-02-04 03:11:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:30,446 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-04 03:11:30,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:11:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-04 03:11:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 03:11:30,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:30,447 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:11:30,447 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash 408705067, now seen corresponding path program 1 times [2018-02-04 03:11:30,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:30,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:30,720 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:11:30,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:30,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:11:30,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:30,721 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:11:30,721 INFO L182 omatonBuilderFactory]: Interpolants [5920#(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))))), 5921#(= 0 |alloc_17_#t~mem6.offset|), 5907#true, 5908#false, 5909#(= 0 |ldv_malloc_#t~malloc1.offset|), 5910#(= 0 |ldv_malloc_#res.offset|), 5911#(= 0 |entry_point_#t~ret8.offset|), 5912#(= 0 entry_point_~array~0.offset), 5913#(= 0 |alloc_17_#in~array.offset|), 5914#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 5915#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 5916#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 5917#(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))))), 5918#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 5919#(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))] [2018-02-04 03:11:30,722 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:11:30,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:11:30,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:11:30,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:11:30,722 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 15 states. [2018-02-04 03:11:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:30,999 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-02-04 03:11:31,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:11:31,000 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-04 03:11:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:31,000 INFO L225 Difference]: With dead ends: 133 [2018-02-04 03:11:31,001 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 03:11:31,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:11:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 03:11:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-02-04 03:11:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:11:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-02-04 03:11:31,004 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 87 [2018-02-04 03:11:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:31,004 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-02-04 03:11:31,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:11:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-02-04 03:11:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 03:11:31,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:31,005 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:11:31,005 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:31,005 INFO L82 PathProgramCache]: Analyzing trace with hash 408705068, now seen corresponding path program 1 times [2018-02-04 03:11:31,006 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:31,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:31,289 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:11:31,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:31,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:11:31,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:31,290 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:11:31,290 INFO L182 omatonBuilderFactory]: Interpolants [6208#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 6209#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 6210#(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)))))), 6211#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 6212#(= |#valid| |old(#valid)|), 6213#(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)), 6214#(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)))))), 6215#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 6198#true, 6199#false, 6200#(= 0 |ldv_malloc_#t~malloc1.offset|), 6201#(= 0 |ldv_malloc_#res.offset|), 6202#(= 0 |entry_point_#t~ret8.offset|), 6203#(= 0 entry_point_~array~0.offset), 6204#(= 0 |alloc_17_#in~array.offset|), 6205#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 6206#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 6207#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-04 03:11:31,290 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:11:31,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:11:31,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:11:31,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:11:31,291 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 18 states. [2018-02-04 03:11:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:31,566 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-02-04 03:11:31,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:11:31,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-04 03:11:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:31,567 INFO L225 Difference]: With dead ends: 127 [2018-02-04 03:11:31,567 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:11:31,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:11:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:11:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-02-04 03:11:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:11:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-02-04 03:11:31,570 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 87 [2018-02-04 03:11:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:31,570 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-02-04 03:11:31,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:11:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-02-04 03:11:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:11:31,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:31,570 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:11:31,570 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1923546252, now seen corresponding path program 1 times [2018-02-04 03:11:31,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:31,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:11:31,891 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:11:31,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:31,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:11:31,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:31,892 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:11:31,892 INFO L182 omatonBuilderFactory]: Interpolants [6496#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 6497#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 6498#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 6499#(= |#valid| |old(#valid)|), 6500#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6501#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6502#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 6503#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 6504#(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)))))), 6505#(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)))), 6506#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 6507#(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))), 6508#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 6509#(= 1 (select |#valid| alloc_17_~array.base)), 6491#true, 6492#false, 6493#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 6494#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 6495#(and (= 1 (select |#valid| |entry_point_#t~ret8.base|)) (= 0 |entry_point_#t~ret8.offset|))] [2018-02-04 03:11:31,892 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:11:31,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:11:31,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:11:31,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:11:31,892 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 19 states. [2018-02-04 03:11:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:32,185 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-02-04 03:11:32,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:11:32,187 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-04 03:11:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:32,187 INFO L225 Difference]: With dead ends: 129 [2018-02-04 03:11:32,188 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 03:11:32,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:11:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 03:11:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-02-04 03:11:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:11:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-04 03:11:32,191 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 89 [2018-02-04 03:11:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:32,192 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-04 03:11:32,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:11:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-04 03:11:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 03:11:32,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:32,193 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] [2018-02-04 03:11:32,193 INFO L371 AbstractCegarLoop]: === Iteration 32 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1757191147, now seen corresponding path program 1 times [2018-02-04 03:11:32,193 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:32,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:11:32,329 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:11:32,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:32,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:11:32,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:32,330 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:11:32,330 INFO L182 omatonBuilderFactory]: Interpolants [6784#(= 0 |ldv_malloc_#res.offset|), 6785#(= 0 |entry_point_#t~ret8.offset|), 6786#(= 0 entry_point_~array~0.offset), 6787#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 6788#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 6789#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0)), 6790#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 6791#(not (= |alloc_17_#in~array.offset| 0)), 6781#true, 6782#false, 6783#(= 0 |ldv_malloc_#t~malloc1.offset|)] [2018-02-04 03:11:32,330 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:11:32,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:11:32,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:11:32,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:11:32,331 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-02-04 03:11:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:32,433 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-02-04 03:11:32,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:11:32,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-02-04 03:11:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:32,435 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:11:32,436 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:11:32,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:11:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:11:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-04 03:11:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 03:11:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-02-04 03:11:32,439 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 93 [2018-02-04 03:11:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:32,439 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-02-04 03:11:32,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:11:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-02-04 03:11:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:11:32,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:32,440 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:11:32,440 INFO L371 AbstractCegarLoop]: === Iteration 33 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:32,440 INFO L82 PathProgramCache]: Analyzing trace with hash 988408539, now seen corresponding path program 1 times [2018-02-04 03:11:32,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:32,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:11:32,490 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:11:32,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:32,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:11:32,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:32,491 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:11:32,491 INFO L182 omatonBuilderFactory]: Interpolants [7056#false, 7057#(= alloc_17_~i~0 0), 7058#(<= alloc_17_~i~0 1), 7059#(<= alloc_17_~j~0 0), 7060#(<= (+ alloc_17_~j~0 1) 0), 7055#true] [2018-02-04 03:11:32,491 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:11:32,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:11:32,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:11:32,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:11:32,492 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-02-04 03:11:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:32,531 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-02-04 03:11:32,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:11:32,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-02-04 03:11:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:32,532 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:11:32,532 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 03:11:32,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:11:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 03:11:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2018-02-04 03:11:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 03:11:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-02-04 03:11:32,535 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 94 [2018-02-04 03:11:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:32,536 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-02-04 03:11:32,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:11:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-02-04 03:11:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 03:11:32,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:32,537 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] [2018-02-04 03:11:32,537 INFO L371 AbstractCegarLoop]: === Iteration 34 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash -549703530, now seen corresponding path program 2 times [2018-02-04 03:11:32,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:32,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:32,600 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:11:32,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:32,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:11:32,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:32,601 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:11:32,601 INFO L182 omatonBuilderFactory]: Interpolants [7314#true, 7315#false, 7316#(<= 10 entry_point_~len~0), 7317#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 7318#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 7319#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 7320#(<= |alloc_17_#in~len| 2)] [2018-02-04 03:11:32,601 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:11:32,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:11:32,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:11:32,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:11:32,602 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 7 states. [2018-02-04 03:11:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:32,646 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-02-04 03:11:32,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:11:32,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-02-04 03:11:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:32,647 INFO L225 Difference]: With dead ends: 156 [2018-02-04 03:11:32,647 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 03:11:32,648 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:11:32,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 03:11:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2018-02-04 03:11:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 03:11:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2018-02-04 03:11:32,652 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 96 [2018-02-04 03:11:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:32,652 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2018-02-04 03:11:32,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:11:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2018-02-04 03:11:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 03:11:32,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:32,653 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] [2018-02-04 03:11:32,653 INFO L371 AbstractCegarLoop]: === Iteration 35 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:32,653 INFO L82 PathProgramCache]: Analyzing trace with hash -659963202, now seen corresponding path program 1 times [2018-02-04 03:11:32,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:32,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-02-04 03:11:32,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:32,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 03:11:32,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:32,698 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:11:32,699 INFO L182 omatonBuilderFactory]: Interpolants [7606#true, 7607#false, 7608#(= alloc_17_~array.base |alloc_17_#in~array.base|), 7609#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 7610#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:11:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-02-04 03:11:32,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:11:32,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:11:32,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:11:32,699 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand 5 states. [2018-02-04 03:11:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:32,734 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-02-04 03:11:32,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:11:32,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-02-04 03:11:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:32,736 INFO L225 Difference]: With dead ends: 127 [2018-02-04 03:11:32,736 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:11:32,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:11:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:11:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-04 03:11:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:11:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-02-04 03:11:32,739 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 97 [2018-02-04 03:11:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:32,739 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-02-04 03:11:32,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:11:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-02-04 03:11:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:11:32,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:32,740 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:11:32,740 INFO L371 AbstractCegarLoop]: === Iteration 36 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash -797207824, now seen corresponding path program 2 times [2018-02-04 03:11:32,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:32,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:11:33,155 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:11:33,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:33,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:11:33,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:33,155 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:11:33,156 INFO L182 omatonBuilderFactory]: Interpolants [7872#(= 0 |alloc_17_#in~array.offset|), 7873#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 7874#(= alloc_17_~array.offset 0), 7875#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 7876#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 7877#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (* 4 alloc_17_~i~0)))), 7878#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 7879#(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))))), 7880#(= 0 |alloc_17_#t~mem6.offset|), 7862#true, 7863#false, 7864#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 7865#(= 0 |ldv_malloc_#t~malloc1.offset|), 7866#(= 0 |ldv_malloc_#res.offset|), 7867#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 7868#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 7869#(= entry_point_~array~0.offset 0), 7870#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 7871#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0))] [2018-02-04 03:11:33,156 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:11:33,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:11:33,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:11:33,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:11:33,156 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 19 states. [2018-02-04 03:11:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:33,412 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-02-04 03:11:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:11:33,412 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-04 03:11:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:33,413 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:11:33,413 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 03:11:33,413 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:11:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 03:11:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-02-04 03:11:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:11:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-04 03:11:33,416 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 100 [2018-02-04 03:11:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:33,416 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-04 03:11:33,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:11:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-04 03:11:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:11:33,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:33,417 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:11:33,417 INFO L371 AbstractCegarLoop]: === Iteration 37 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash -797207823, now seen corresponding path program 2 times [2018-02-04 03:11:33,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:33,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:33,843 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:11:33,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:33,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:11:33,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:33,843 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:11:33,843 INFO L182 omatonBuilderFactory]: Interpolants [8160#false, 8161#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 8162#(= 0 |ldv_malloc_#t~malloc1.offset|), 8163#(= 0 |ldv_malloc_#res.offset|), 8164#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 8165#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 8166#(= entry_point_~array~0.offset 0), 8167#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 8168#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 8169#(= 0 |alloc_17_#in~array.offset|), 8170#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8171#(= alloc_17_~array.offset 0), 8172#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 8173#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 8174#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 8175#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 8176#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 8177#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 8178#(= |#valid| |old(#valid)|), 8179#(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)))))), 8180#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 8159#true] [2018-02-04 03:11:33,844 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:11:33,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:11:33,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:11:33,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:11:33,844 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 22 states. [2018-02-04 03:11:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:34,148 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-02-04 03:11:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:11:34,148 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-04 03:11:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:34,149 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:11:34,149 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:11:34,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:11:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:11:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-04 03:11:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:11:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-02-04 03:11:34,152 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 100 [2018-02-04 03:11:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:34,152 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-02-04 03:11:34,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:11:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-02-04 03:11:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:11:34,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:34,153 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] [2018-02-04 03:11:34,153 INFO L371 AbstractCegarLoop]: === Iteration 38 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:34,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1396569988, now seen corresponding path program 1 times [2018-02-04 03:11:34,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:34,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-02-04 03:11:35,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:35,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:11:35,459 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:35,459 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:11:35,459 INFO L182 omatonBuilderFactory]: Interpolants [8480#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.offset 0)) (and (= |#valid| (store |old(#valid)| |alloc_17_#t~ret3.base| (select |#valid| |alloc_17_#t~ret3.base|))) (not (= 0 |alloc_17_#t~ret3.base|)) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8481#(and (or (= 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)) (and (= |#valid| (store |old(#valid)| alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base))) (not (= alloc_17_~array.offset 0)))), 8482#(and (or (and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8483#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 8484#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| 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))), 8485#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (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))), 8486#(and (or (and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (not (= 0 |alloc_17_#t~mem6.base|)) (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store |old(#valid)| |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|))) (= 0 (select |old(#valid)| |alloc_17_#t~mem6.base|)))) (<= 0 (+ (* 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))), 8487#(and (or (and (<= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= |#valid| |old(#valid)|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8488#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 8489#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 8490#(or (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 8491#(and (not (= entry_point_~array~0.base 0)) (= (select |old(#valid)| entry_point_~array~0.base) (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (= (store |old(#valid)| entry_point_~array~0.base (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (store |#valid| entry_point_~array~0.base 0))), 8470#true, 8471#false, 8472#(= |#valid| |old(#valid)|), 8473#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|) (= (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)), 8474#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (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|))))), 8475#(and (= (select |#valid| |entry_point_#t~ret8.base|) 1) (= (select |old(#valid)| |entry_point_#t~ret8.base|) 0) (= 0 |entry_point_#t~ret8.offset|) (not (= 0 |entry_point_#t~ret8.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8476#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8477#(and (or (= |#valid| |old(#valid)|) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 8478#(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)), 8479#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|)))] [2018-02-04 03:11:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-02-04 03:11:35,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:11:35,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:11:35,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:11:35,460 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 22 states. [2018-02-04 03:11:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:36,627 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-02-04 03:11:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:11:36,627 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-04 03:11:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:36,628 INFO L225 Difference]: With dead ends: 140 [2018-02-04 03:11:36,628 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:11:36,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:11:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:11:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-04 03:11:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:11:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-04 03:11:36,631 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 100 [2018-02-04 03:11:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:36,632 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-04 03:11:36,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:11:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-04 03:11:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:11:36,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:36,633 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:11:36,633 INFO L371 AbstractCegarLoop]: === Iteration 39 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1612539375, now seen corresponding path program 2 times [2018-02-04 03:11:36,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:36,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:37,040 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:11:37,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:37,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:11:37,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:37,041 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:11:37,041 INFO L182 omatonBuilderFactory]: Interpolants [8773#true, 8774#false, 8775#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 8776#(= 0 |ldv_malloc_#t~malloc1.offset|), 8777#(= 0 |ldv_malloc_#res.offset|), 8778#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 8779#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 8780#(= entry_point_~array~0.offset 0), 8781#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 8782#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 8783#(= 0 |alloc_17_#in~array.offset|), 8784#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8785#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 8786#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 8787#(= |#valid| |old(#valid)|), 8788#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8789#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8790#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 8791#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 8792#(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))))), 8793#(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)))))), 8794#(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))), 8795#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 8796#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:11:37,041 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:11:37,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:11:37,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:11:37,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:11:37,041 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 24 states. [2018-02-04 03:11:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:37,407 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-02-04 03:11:37,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:11:37,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2018-02-04 03:11:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:37,408 INFO L225 Difference]: With dead ends: 123 [2018-02-04 03:11:37,408 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 03:11:37,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:11:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 03:11:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2018-02-04 03:11:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:11:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-04 03:11:37,415 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 102 [2018-02-04 03:11:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:37,415 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-04 03:11:37,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:11:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-04 03:11:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 03:11:37,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:37,416 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:11:37,416 INFO L371 AbstractCegarLoop]: === Iteration 40 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash -430114699, now seen corresponding path program 1 times [2018-02-04 03:11:37,417 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:37,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:37,811 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:11:37,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:37,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:11:37,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:37,812 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:11:37,812 INFO L182 omatonBuilderFactory]: Interpolants [9088#(= 0 |alloc_17_#in~array.offset|), 9089#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 9090#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 9091#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 9092#(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))))), 9093#(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))), 9094#(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)), 9095#(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))), 9096#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 9097#(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)), 9098#(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))))), 9099#(= 0 |alloc_17_#t~mem6.offset|), 9082#true, 9083#false, 9084#(= 0 |ldv_malloc_#t~malloc1.offset|), 9085#(= 0 |ldv_malloc_#res.offset|), 9086#(= 0 |entry_point_#t~ret8.offset|), 9087#(= 0 entry_point_~array~0.offset)] [2018-02-04 03:11:37,812 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:11:37,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:11:37,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:11:37,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:11:37,813 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 18 states. [2018-02-04 03:11:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:38,130 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-04 03:11:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:11:38,130 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-02-04 03:11:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:38,131 INFO L225 Difference]: With dead ends: 146 [2018-02-04 03:11:38,131 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 03:11:38,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:11:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 03:11:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-02-04 03:11:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 03:11:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-02-04 03:11:38,136 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 107 [2018-02-04 03:11:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:38,137 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-02-04 03:11:38,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:11:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-02-04 03:11:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 03:11:38,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:38,138 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:11:38,138 INFO L371 AbstractCegarLoop]: === Iteration 41 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:38,138 INFO L82 PathProgramCache]: Analyzing trace with hash -430114698, now seen corresponding path program 2 times [2018-02-04 03:11:38,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:38,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 10 proven. 134 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:11:39,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:39,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:11:39,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:39,716 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:11:39,716 INFO L182 omatonBuilderFactory]: Interpolants [9409#true, 9410#false, 9411#(= 0 (select |#valid| 0)), 9412#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10)), 9413#(= (select |old(#valid)| 0) (select |#valid| 0)), 9414#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 9415#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 9416#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 9417#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9418#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9419#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0))) (= entry_point_~array~0.offset 0)), 9420#(and (or (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0)) (and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0)))) (= entry_point_~array~0.offset 0)), 9421#(and (= 0 (select |#valid| 0)) (= 0 |alloc_17_#in~array.offset|)), 9422#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 9423#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 9424#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 9425#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 9426#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |#valid| 0))), 9427#(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))), 9428#(and (or (and (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4)), 9429#(= |#valid| |old(#valid)|), 9430#(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)), 9431#(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|))))), 9432#(and (= alloc_17_~array.offset 0) (or (and (= 0 (select |#valid| 0)) (not (= 0 |alloc_17_#t~ret3.base|)) (<= (* 4 alloc_17_~i~0) 4) (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))), 9433#(and (= alloc_17_~array.offset 0) (or (and (not (= 0 alloc_17_~p~0.base)) (= 0 (select |#valid| 0)) (<= (* 4 alloc_17_~i~0) 4) (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))), 9434#(and (or (and (= 0 (select |#valid| 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) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4)), 9435#(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) (+ (* 4 alloc_17_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 8) (= 0 (select |#valid| 0)) (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)))))), 9436#(and (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 (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~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))) (= 0 (select |#valid| 0)))) (= alloc_17_~array.offset 0)), 9437#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (not (= 0 |alloc_17_#t~mem6.base|)) (or (= 0 (select |#valid| |alloc_17_#t~mem6.base|)) (and (<= alloc_17_~j~0 1) (or (not (= 1 (select |#valid| |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))))))))), 9438#(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)))), 9439#(and (= alloc_17_~array.offset 0) (or (and (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (<= alloc_17_~j~0 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))))), 9440#(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)))))), 9441#(= 1 (select |#valid| |alloc_17_#t~mem6.base|))] [2018-02-04 03:11:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 10 proven. 134 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 03:11:39,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:11:39,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:11:39,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:11:39,717 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 33 states. [2018-02-04 03:11:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:40,952 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-04 03:11:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:11:40,952 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2018-02-04 03:11:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:40,953 INFO L225 Difference]: With dead ends: 145 [2018-02-04 03:11:40,953 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 03:11:40,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=456, Invalid=3326, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:11:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 03:11:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2018-02-04 03:11:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 03:11:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-02-04 03:11:40,956 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 107 [2018-02-04 03:11:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:40,956 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-02-04 03:11:40,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:11:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-02-04 03:11:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 03:11:40,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:40,957 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] [2018-02-04 03:11:40,957 INFO L371 AbstractCegarLoop]: === Iteration 42 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:40,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2049065841, now seen corresponding path program 3 times [2018-02-04 03:11:40,958 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:40,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:41,032 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:11:41,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:41,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:11:41,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:41,033 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:11:41,033 INFO L182 omatonBuilderFactory]: Interpolants [9782#true, 9783#false, 9784#(<= 10 entry_point_~len~0), 9785#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 9786#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 9787#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 9788#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 9789#(<= |alloc_17_#in~len| 3)] [2018-02-04 03:11:41,033 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:11:41,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:11:41,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:11:41,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:11:41,033 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 8 states. [2018-02-04 03:11:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:41,108 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-02-04 03:11:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:11:41,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-02-04 03:11:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:41,109 INFO L225 Difference]: With dead ends: 180 [2018-02-04 03:11:41,109 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 03:11:41,110 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:11:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 03:11:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2018-02-04 03:11:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 03:11:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-02-04 03:11:41,113 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 109 [2018-02-04 03:11:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:41,113 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-02-04 03:11:41,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:11:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-02-04 03:11:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 03:11:41,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:41,114 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:11:41,114 INFO L371 AbstractCegarLoop]: === Iteration 43 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1023364522, now seen corresponding path program 1 times [2018-02-04 03:11:41,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:41,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:42,027 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:11:42,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:42,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:11:42,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:42,028 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:11:42,028 INFO L182 omatonBuilderFactory]: Interpolants [10115#true, 10116#false, 10117#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10118#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 10119#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 10120#(and (<= 10 entry_point_~len~0) (= (select |#valid| |entry_point_#t~ret8.base|) 1) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 10121#(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)), 10122#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10123#(and (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (= (select |#valid| entry_point_~array~0.base) 1)) (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10124#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= (select |#valid| entry_point_~array~0.base) 1) (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0)))), 10125#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 10126#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 10127#(= |#valid| |old(#valid)|), 10128#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10129#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10130#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 10131#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 10132#(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)))))), 10133#(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)), 10134#(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))), 10135#(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)), 10136#(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))))), 10137#(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)), 10138#(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))), 10139#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 10140#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:11:42,028 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:11:42,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:11:42,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:11:42,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:11:42,029 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 26 states. [2018-02-04 03:11:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:42,527 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-04 03:11:42,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:11:42,527 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-02-04 03:11:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:42,528 INFO L225 Difference]: With dead ends: 146 [2018-02-04 03:11:42,528 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 03:11:42,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:11:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 03:11:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-02-04 03:11:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 03:11:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-04 03:11:42,530 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 109 [2018-02-04 03:11:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:42,531 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-04 03:11:42,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:11:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-04 03:11:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 03:11:42,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:42,532 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:11:42,532 INFO L371 AbstractCegarLoop]: === Iteration 44 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1303372102, now seen corresponding path program 2 times [2018-02-04 03:11:42,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:42,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 37 proven. 142 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-02-04 03:11:43,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:43,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:11:43,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 03:11:43,224 INFO L182 omatonBuilderFactory]: Interpolants [10464#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10465#(= entry_point_~array~0.offset 0), 10466#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10467#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10468#(= 0 |alloc_17_#in~array.offset|), 10469#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 10470#(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))))), 10471#(= alloc_17_~array.offset 0), 10472#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 10473#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 10474#(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)), 10475#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 10476#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))), 10477#(and (= 0 (select (store (select |#memory_$Pointer$.offset| 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)), 10478#(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))))), 10479#(= 0 |alloc_17_#t~mem6.offset|), 10458#true, 10459#false, 10460#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10461#(= 0 |ldv_malloc_#t~malloc1.offset|), 10462#(= 0 |ldv_malloc_#res.offset|), 10463#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|))] [2018-02-04 03:11:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 37 proven. 142 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-02-04 03:11:43,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:11:43,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:11:43,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:11:43,225 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 22 states. [2018-02-04 03:11:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:43,645 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-04 03:11:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:11:43,646 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 120 [2018-02-04 03:11:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:43,646 INFO L225 Difference]: With dead ends: 153 [2018-02-04 03:11:43,646 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 03:11:43,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=1497, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:11:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 03:11:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2018-02-04 03:11:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 03:11:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-02-04 03:11:43,649 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 120 [2018-02-04 03:11:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:43,649 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-02-04 03:11:43,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:11:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-02-04 03:11:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 03:11:43,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:43,650 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:11:43,650 INFO L371 AbstractCegarLoop]: === Iteration 45 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1303372101, now seen corresponding path program 3 times [2018-02-04 03:11:43,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:43,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:11:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 29 proven. 168 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-02-04 03:11:45,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:45,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:11:45,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 03:11:45,190 INFO L182 omatonBuilderFactory]: Interpolants [10818#true, 10819#false, 10820#(= 0 (select |#valid| 0)), 10821#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10)), 10822#(= (select |old(#valid)| 0) (select |#valid| 0)), 10823#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 10824#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 10825#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 10826#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10827#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 10828#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0))) (= entry_point_~array~0.offset 0)), 10829#(and (or (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0)) (and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0)))) (= entry_point_~array~0.offset 0)), 10830#(and (= 0 (select |#valid| 0)) (= 0 |alloc_17_#in~array.offset|)), 10831#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 10832#(and (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 10833#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 10834#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 10835#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 10836#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |#valid| 0))), 10837#(and (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 10838#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 10839#(= |#valid| |old(#valid)|), 10840#(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)), 10841#(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|))))), 10842#(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))))) (= 0 (select |#valid| 0)) (not (= 0 |alloc_17_#t~ret3.base|))), 10843#(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)) (= 0 (select |#valid| 0)) (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)))))), 10844#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 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))))), 10845#(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))))) (= 0 (select |#valid| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 10846#(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))))) (= 0 (select |#valid| 0))), 10847#(and (= alloc_17_~array.offset 0) (not (= 0 |alloc_17_#t~mem6.base|)) (or (not (= 1 (select |#valid| |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))))))), 10848#(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)))))), 10849#(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)))))), 10850#(= 1 (select |#valid| |alloc_17_#t~mem6.base|))] [2018-02-04 03:11:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 29 proven. 168 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-02-04 03:11:45,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:11:45,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:11:45,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:11:45,190 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 33 states. [2018-02-04 03:11:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:46,327 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-02-04 03:11:46,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:11:46,327 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 120 [2018-02-04 03:11:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:46,328 INFO L225 Difference]: With dead ends: 151 [2018-02-04 03:11:46,328 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 03:11:46,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=475, Invalid=3815, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 03:11:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 03:11:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2018-02-04 03:11:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 03:11:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-02-04 03:11:46,330 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 120 [2018-02-04 03:11:46,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:46,331 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-02-04 03:11:46,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:11:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-02-04 03:11:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 03:11:46,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:46,331 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] [2018-02-04 03:11:46,331 INFO L371 AbstractCegarLoop]: === Iteration 46 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 761110394, now seen corresponding path program 2 times [2018-02-04 03:11:46,332 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:46,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-04 03:11:50,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:50,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 03:11:50,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 03:11:50,238 INFO L182 omatonBuilderFactory]: Interpolants [11213#true, 11214#false, 11215#(= |#valid| |old(#valid)|), 11216#(and (<= 10 entry_point_~len~0) (= |#valid| |old(#valid)|) (<= entry_point_~len~0 10)), 11217#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|) (= (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)), 11218#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (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|))))), 11219#(and (<= 10 entry_point_~len~0) (= (select |#valid| |entry_point_#t~ret8.base|) 1) (<= entry_point_~len~0 10) (= (select |old(#valid)| |entry_point_#t~ret8.base|) 0) (= 0 |entry_point_#t~ret8.offset|) (not (= 0 |entry_point_#t~ret8.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11220#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= (select |#valid| entry_point_~array~0.base) 1) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11221#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11222#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))))), 11223#(and (or (and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (not (= entry_point_~array~0.base 0)) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 11224#(and (or (and (= |#valid| |old(#valid)|) (= 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))), 11225#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 11226#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11227#(and (or (and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (not (= 0 |alloc_17_#t~ret3.base|)) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11228#(and (or (not (= alloc_17_~array.offset 0)) (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11229#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= 0 (select |old(#valid)| (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|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (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)))), 11230#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= 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))), 11231#(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)), 11232#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 11233#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret3.base|)) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) |alloc_17_#t~ret3.base| (select |#valid| |alloc_17_#t~ret3.base|))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= alloc_17_~array.base |alloc_17_#t~ret3.base|)) (not (= 0 |alloc_17_#t~ret3.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 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))), 11234#(and (or (and (not (= 0 alloc_17_~p~0.base)) (or (and (= |#valid| (store (store |old(#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) (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))) alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (= (select |old(#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)) 0)) (= alloc_17_~array.base alloc_17_~p~0.base)) (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))) (not (= 0 (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)))) (<= 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))), 11235#(and (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (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)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) 0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))) (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) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 11236#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (and (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4)))))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (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 (- 4))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4)))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4))))) 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4)))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4)))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~i~0) 4)))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (not (= alloc_17_~array.offset 0)) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))), 11237#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (* (- 4) alloc_17_~j~0))))) (and (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) 0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))))) (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) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 11238#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 |alloc_17_#t~mem6.base|)) (not (= |alloc_17_#t~mem6.base| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (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)))) (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (* (- 4) alloc_17_~j~0)))))) (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~mem6.base|)) (= (select |old(#valid)| |alloc_17_#t~mem6.base|) (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store (store |old(#valid)| |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|)) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 11239#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (* (- 4) alloc_17_~j~0))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) 0)) (and (= |#valid| (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 11240#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 11241#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| 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))), 11242#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (<= 0 (* 4 alloc_17_~j~0)) (or (<= 1 (* 4 alloc_17_~j~0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))))) (not (= alloc_17_~array.offset 0)))), 11243#(and (or (and (not (= 0 |alloc_17_#t~mem6.base|)) (<= 0 (* 4 alloc_17_~j~0)) (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store |old(#valid)| |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|))) (= 0 (select |old(#valid)| |alloc_17_#t~mem6.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))), 11244#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= |#valid| |old(#valid)|) (<= 0 (* 4 alloc_17_~j~0))) (<= 1 (* 4 alloc_17_~j~0)) (not (= alloc_17_~array.offset 0)))), 11245#(or (not (= |alloc_17_#in~array.offset| 0)) (and (<= 0 (* 4 alloc_17_~j~0)) (or (= |#valid| |old(#valid)|) (<= 1 (* 4 alloc_17_~j~0))))), 11246#(or (and (or (= |#valid| |old(#valid)|) (<= 0 (+ (* 4 alloc_17_~j~0) 3))) (<= 0 (+ (* 4 alloc_17_~j~0) 4))) (not (= |alloc_17_#in~array.offset| 0))), 11247#(or (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 11248#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |old(#valid)| entry_point_~array~0.base) (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (= (store |old(#valid)| entry_point_~array~0.base (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (store |#valid| entry_point_~array~0.base 0)))] [2018-02-04 03:11:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-04 03:11:50,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 03:11:50,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 03:11:50,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:11:50,239 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 36 states. [2018-02-04 03:11:51,547 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 91 DAG size of output 69 [2018-02-04 03:11:51,915 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 201 DAG size of output 94 [2018-02-04 03:11:52,202 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 216 DAG size of output 115 [2018-02-04 03:11:52,563 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 199 DAG size of output 139 [2018-02-04 03:11:52,879 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 184 DAG size of output 118 [2018-02-04 03:11:53,095 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 157 DAG size of output 77 [2018-02-04 03:11:53,280 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 115 DAG size of output 80 [2018-02-04 03:11:53,506 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 126 DAG size of output 91 [2018-02-04 03:11:54,349 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 113 DAG size of output 72 [2018-02-04 03:11:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:54,622 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-02-04 03:11:54,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:11:54,622 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 120 [2018-02-04 03:11:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:54,622 INFO L225 Difference]: With dead ends: 174 [2018-02-04 03:11:54,623 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 03:11:54,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 18 SyntacticMatches, 34 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=380, Invalid=3280, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 03:11:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 03:11:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2018-02-04 03:11:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 03:11:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-02-04 03:11:54,625 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 120 [2018-02-04 03:11:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:54,626 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-02-04 03:11:54,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 03:11:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-02-04 03:11:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 03:11:54,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:54,627 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] [2018-02-04 03:11:54,627 INFO L371 AbstractCegarLoop]: === Iteration 47 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash 367324278, now seen corresponding path program 4 times [2018-02-04 03:11:54,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:54,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:54,723 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:11:54,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:54,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:11:54,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:54,724 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:11:54,724 INFO L182 omatonBuilderFactory]: Interpolants [11632#(<= 10 entry_point_~len~0), 11633#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 11634#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 11635#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 11636#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 11637#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 4)), 11638#(<= |alloc_17_#in~len| 4), 11630#true, 11631#false] [2018-02-04 03:11:54,724 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:11:54,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:11:54,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:11:54,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:11:54,725 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 9 states. [2018-02-04 03:11:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:54,797 INFO L93 Difference]: Finished difference Result 239 states and 257 transitions. [2018-02-04 03:11:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:11:54,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2018-02-04 03:11:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:54,799 INFO L225 Difference]: With dead ends: 239 [2018-02-04 03:11:54,799 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 03:11:54,799 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:11:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 03:11:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 164. [2018-02-04 03:11:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 03:11:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 176 transitions. [2018-02-04 03:11:54,803 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 176 transitions. Word has length 122 [2018-02-04 03:11:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:54,803 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 176 transitions. [2018-02-04 03:11:54,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:11:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2018-02-04 03:11:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 03:11:54,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:54,804 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:11:54,804 INFO L371 AbstractCegarLoop]: === Iteration 48 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1589861211, now seen corresponding path program 2 times [2018-02-04 03:11:54,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:54,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:11:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 9 proven. 260 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 03:11:56,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:11:56,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 03:11:56,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:11:56,450 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:11:56,450 INFO L182 omatonBuilderFactory]: Interpolants [12044#true, 12045#false, 12046#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12047#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 12048#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 12049#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|) (not (= 0 |entry_point_#t~ret8.base|))), 12050#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 12051#(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) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1))) entry_point_~array~0.base))), 12052#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 36)))) entry_point_~array~0.base)) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12053#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 32)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 32))) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~1)), 12054#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 28)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~1)), 12055#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 24)))) entry_point_~array~0.base)) (= 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~1) 24)))) 4) 4) entry_point_~i~1)), 12056#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~1) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 20)))) entry_point_~array~0.base))), 12057#(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~1) 16)))) 4) 6) entry_point_~i~1) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 16)))) entry_point_~array~0.base))), 12058#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 12)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 12)))) 4) 7) entry_point_~i~1)), 12059#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 8)))) entry_point_~array~0.base))), 12060#(and (or (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12061#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base))))), 12062#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base))) (= entry_point_~array~0.offset 0)), 12063#(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))), 12064#(and (= 0 |alloc_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4) |alloc_17_#in~array.base|))), 12065#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) alloc_17_~array.base))), 12066#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) alloc_17_~array.base))), 12067#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 12068#(= |#valid| |old(#valid)|), 12069#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 12070#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12071#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 12072#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 12073#(and (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)) alloc_17_~array.base))), 12074#(and (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) alloc_17_~array.base))), 12075#(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)))))), 12076#(and (= alloc_17_~array.offset 0) (not (= (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.base))), 12077#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4))) alloc_17_~array.base))), 12078#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) alloc_17_~array.base))), 12079#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 12080#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:11:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 9 proven. 260 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 03:11:56,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 03:11:56,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 03:11:56,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1245, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:11:56,451 INFO L87 Difference]: Start difference. First operand 164 states and 176 transitions. Second operand 37 states. [2018-02-04 03:11:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:11:59,791 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-02-04 03:11:59,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 03:11:59,791 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 122 [2018-02-04 03:11:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:11:59,792 INFO L225 Difference]: With dead ends: 174 [2018-02-04 03:11:59,792 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 03:11:59,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=791, Invalid=7581, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 03:11:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 03:11:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2018-02-04 03:11:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 03:11:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-02-04 03:11:59,796 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 122 [2018-02-04 03:11:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:11:59,796 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-02-04 03:11:59,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 03:11:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-02-04 03:11:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 03:11:59,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:11:59,796 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:11:59,796 INFO L371 AbstractCegarLoop]: === Iteration 49 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:11:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1226012011, now seen corresponding path program 3 times [2018-02-04 03:11:59,797 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:11:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:11:59,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 43 proven. 122 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 03:12:00,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:00,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:12:00,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:12:00,568 INFO L182 omatonBuilderFactory]: Interpolants [12544#(and (or (and (<= alloc_17_~i~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 3)) (= alloc_17_~array.offset 0)), 12545#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 7))), 12546#(and (= alloc_17_~array.offset 0) (or (<= (* 4 alloc_17_~i~0) 11) (and (<= alloc_17_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))))), 12547#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7) (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) (<= alloc_17_~j~0 2)))), 12548#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (<= 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)))) (= alloc_17_~array.offset 0)), 12549#(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)), 12550#(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))))), 12551#(= 0 |alloc_17_#t~mem6.offset|), 12529#true, 12530#false, 12531#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12532#(= 0 |ldv_malloc_#t~malloc1.offset|), 12533#(= 0 |ldv_malloc_#res.offset|), 12534#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 12535#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12536#(= entry_point_~array~0.offset 0), 12537#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12538#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12539#(= 0 |alloc_17_#in~array.offset|), 12540#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 12541#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 12542#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 12543#(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)))))] [2018-02-04 03:12:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 43 proven. 122 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-02-04 03:12:00,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:12:00,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:12:00,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:12:00,569 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 23 states. [2018-02-04 03:12:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:00,970 INFO L93 Difference]: Finished difference Result 198 states and 210 transitions. [2018-02-04 03:12:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:12:00,970 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2018-02-04 03:12:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:00,971 INFO L225 Difference]: With dead ends: 198 [2018-02-04 03:12:00,971 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 03:12:00,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 15 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=1753, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:12:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 03:12:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2018-02-04 03:12:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 03:12:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2018-02-04 03:12:00,973 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 127 [2018-02-04 03:12:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:00,974 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2018-02-04 03:12:00,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:12:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2018-02-04 03:12:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 03:12:00,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:00,974 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:12:00,974 INFO L371 AbstractCegarLoop]: === Iteration 50 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1226012012, now seen corresponding path program 4 times [2018-02-04 03:12:00,975 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:00,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 53 proven. 157 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-02-04 03:12:03,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:03,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 03:12:03,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:12:03,074 INFO L182 omatonBuilderFactory]: Interpolants [12992#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12993#(= entry_point_~array~0.offset 0), 12994#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12995#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12996#(= 0 |alloc_17_#in~array.offset|), 12997#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 12998#(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))), 12999#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 13000#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 13001#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 13002#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 13003#(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)))))), 13004#(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))))), 13005#(= |#valid| |old(#valid)|), 13006#(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)), 13007#(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|))))), 13008#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) |alloc_17_#t~ret3.base|)) (<= (* 4 alloc_17_~i~0) 4) (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)) (= alloc_17_~array.offset 0)), 13009#(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))), 13010#(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)))))), 13011#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8) (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))), 13012#(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|))))), 13013#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8) (or (<= (* 4 alloc_17_~i~0) 7) (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))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 |alloc_17_#t~ret3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 13014#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8) (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))) (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) 7))), 13015#(and (= alloc_17_~array.offset 0) (or (and (not (= 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) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (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)))) (<= (* 4 alloc_17_~i~0) 7))), 13016#(and (= alloc_17_~array.offset 0) (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 (= 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) 11))), 13017#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~j~0) 8) (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 (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))))) (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)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7))), 13018#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7) (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 |alloc_17_#t~mem6.base|)) (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))))) (= 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_~j~0 2)))), 13019#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~j~0) 8) (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))))) (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))), 13020#(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)))), 13021#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (not (= 0 |alloc_17_#t~mem6.base|)) (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))))))) (= alloc_17_~array.offset 0)), 13022#(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)))), 13023#(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))), 13024#(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)))))), 13025#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 12986#true, 12987#false, 12988#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12989#(= 0 |ldv_malloc_#t~malloc1.offset|), 12990#(= 0 |ldv_malloc_#res.offset|), 12991#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|))] [2018-02-04 03:12:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 53 proven. 157 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-02-04 03:12:03,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 03:12:03,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 03:12:03,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:12:03,075 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand 40 states. [2018-02-04 03:12:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:04,447 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2018-02-04 03:12:04,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 03:12:04,447 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 127 [2018-02-04 03:12:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:04,448 INFO L225 Difference]: With dead ends: 194 [2018-02-04 03:12:04,448 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 03:12:04,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=631, Invalid=5069, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 03:12:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 03:12:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2018-02-04 03:12:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 03:12:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2018-02-04 03:12:04,451 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 127 [2018-02-04 03:12:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:04,451 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2018-02-04 03:12:04,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 03:12:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2018-02-04 03:12:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 03:12:04,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:04,452 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-02-04 03:12:04,452 INFO L371 AbstractCegarLoop]: === Iteration 51 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1829900415, now seen corresponding path program 3 times [2018-02-04 03:12:04,452 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:04,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-02-04 03:12:04,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:04,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:12:04,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:12:04,507 INFO L182 omatonBuilderFactory]: Interpolants [13488#(<= alloc_17_~j~0 0), 13489#(<= (+ alloc_17_~j~0 1) 0), 13482#true, 13483#false, 13484#(= alloc_17_~i~0 0), 13485#(<= alloc_17_~i~0 1), 13486#(<= alloc_17_~i~0 2), 13487#(<= alloc_17_~j~0 1)] [2018-02-04 03:12:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-02-04 03:12:04,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:12:04,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:12:04,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:12:04,508 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand 8 states. [2018-02-04 03:12:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:04,547 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-02-04 03:12:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:12:04,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-02-04 03:12:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:04,547 INFO L225 Difference]: With dead ends: 185 [2018-02-04 03:12:04,547 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 03:12:04,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:12:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 03:12:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-02-04 03:12:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 03:12:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-02-04 03:12:04,550 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 127 [2018-02-04 03:12:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:04,550 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-02-04 03:12:04,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:12:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-02-04 03:12:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 03:12:04,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:04,551 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:12:04,551 INFO L371 AbstractCegarLoop]: === Iteration 52 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1376504268, now seen corresponding path program 3 times [2018-02-04 03:12:04,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:04,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 3 proven. 82 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-02-04 03:12:05,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:05,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:12:05,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:12:05,123 INFO L182 omatonBuilderFactory]: Interpolants [13856#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 13857#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 13858#(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)))))), 13859#(and (<= alloc_17_~i~0 1) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 13860#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0)), 13861#(and (<= alloc_17_~i~0 3) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 3) alloc_17_~i~0)), 13862#(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) 0))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~j~0) (<= alloc_17_~j~0 2)), 13863#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (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)))), 13864#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 1) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 13865#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 13866#(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))), 13867#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 13868#(= 1 (select |#valid| alloc_17_~array.base)), 13845#true, 13846#false, 13847#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 13848#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 13849#(and (= 1 (select |#valid| |entry_point_#t~ret8.base|)) (= 0 |entry_point_#t~ret8.offset|)), 13850#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 13851#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 13852#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 13853#(= |#valid| |old(#valid)|), 13854#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 13855#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|))] [2018-02-04 03:12:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 3 proven. 82 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-02-04 03:12:05,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:12:05,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:12:05,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:12:05,124 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 24 states. [2018-02-04 03:12:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:05,736 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-02-04 03:12:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:12:05,737 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 129 [2018-02-04 03:12:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:05,737 INFO L225 Difference]: With dead ends: 168 [2018-02-04 03:12:05,737 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 03:12:05,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:12:05,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 03:12:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-04 03:12:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 03:12:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-02-04 03:12:05,740 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 129 [2018-02-04 03:12:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:05,740 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-02-04 03:12:05,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:12:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-02-04 03:12:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-02-04 03:12:05,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:05,741 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] [2018-02-04 03:12:05,741 INFO L371 AbstractCegarLoop]: === Iteration 53 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash -120466543, now seen corresponding path program 5 times [2018-02-04 03:12:05,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:05,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:05,825 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:12:05,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:05,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:12:05,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-04 03:12:05,826 INFO L182 omatonBuilderFactory]: Interpolants [14240#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 14241#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 14242#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 4)), 14243#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 5)), 14244#(<= |alloc_17_#in~len| 5), 14235#true, 14236#false, 14237#(<= 10 entry_point_~len~0), 14238#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 14239#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1))] [2018-02-04 03:12:05,826 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:12:05,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:12:05,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:12:05,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:12:05,827 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 10 states. [2018-02-04 03:12:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:05,867 INFO L93 Difference]: Finished difference Result 251 states and 267 transitions. [2018-02-04 03:12:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:12:05,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2018-02-04 03:12:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:05,868 INFO L225 Difference]: With dead ends: 251 [2018-02-04 03:12:05,868 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 03:12:05,868 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:12:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 03:12:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 175. [2018-02-04 03:12:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 03:12:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-02-04 03:12:05,871 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 135 [2018-02-04 03:12:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:05,871 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-02-04 03:12:05,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:12:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-02-04 03:12:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 03:12:05,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:05,872 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:05,873 INFO L371 AbstractCegarLoop]: === Iteration 54 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:05,873 INFO L82 PathProgramCache]: Analyzing trace with hash 963668539, now seen corresponding path program 4 times [2018-02-04 03:12:05,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:05,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-02-04 03:12:05,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:05,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:12:05,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-04 03:12:05,970 INFO L182 omatonBuilderFactory]: Interpolants [14673#true, 14674#false, 14675#(= alloc_17_~i~0 0), 14676#(<= alloc_17_~i~0 1), 14677#(<= alloc_17_~i~0 2), 14678#(<= alloc_17_~i~0 3), 14679#(<= alloc_17_~j~0 2), 14680#(<= alloc_17_~j~0 1), 14681#(<= alloc_17_~j~0 0), 14682#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-04 03:12:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-02-04 03:12:05,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:12:05,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:12:05,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:12:05,971 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 10 states. [2018-02-04 03:12:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:06,029 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-02-04 03:12:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:12:06,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 136 [2018-02-04 03:12:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:06,029 INFO L225 Difference]: With dead ends: 176 [2018-02-04 03:12:06,029 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 03:12:06,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:12:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 03:12:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-02-04 03:12:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 03:12:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2018-02-04 03:12:06,032 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 136 [2018-02-04 03:12:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:06,032 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2018-02-04 03:12:06,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:12:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2018-02-04 03:12:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-04 03:12:06,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:06,033 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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:12:06,033 INFO L371 AbstractCegarLoop]: === Iteration 55 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1221474512, now seen corresponding path program 4 times [2018-02-04 03:12:06,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:06,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 42 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-04 03:12:06,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:06,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:12:06,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-04 03:12:06,673 INFO L182 omatonBuilderFactory]: Interpolants [15040#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15041#(= 0 |ldv_malloc_#t~malloc1.offset|), 15042#(= 0 |ldv_malloc_#res.offset|), 15043#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 15044#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15045#(= entry_point_~array~0.offset 0), 15046#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 15047#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 15048#(= 0 |alloc_17_#in~array.offset|), 15049#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15050#(= alloc_17_~array.offset 0), 15051#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 15052#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 15053#(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)), 15054#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 15055#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))), 15056#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))))), 15057#(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) (+ (* 4 alloc_17_~j~0) (- 8))))), 15058#(and (= 0 (select (store (select |#memory_$Pointer$.offset| 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)), 15059#(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))))), 15060#(= 0 |alloc_17_#t~mem6.offset|), 15038#true, 15039#false] [2018-02-04 03:12:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 42 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-04 03:12:06,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:12:06,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:12:06,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:12:06,673 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 23 states. [2018-02-04 03:12:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:07,102 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-02-04 03:12:07,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:12:07,102 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 140 [2018-02-04 03:12:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:07,103 INFO L225 Difference]: With dead ends: 177 [2018-02-04 03:12:07,103 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 03:12:07,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 15 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=303, Invalid=1767, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:12:07,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 03:12:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-02-04 03:12:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 03:12:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2018-02-04 03:12:07,106 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 140 [2018-02-04 03:12:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:07,107 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2018-02-04 03:12:07,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:12:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2018-02-04 03:12:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-04 03:12:07,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:07,108 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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:12:07,108 INFO L371 AbstractCegarLoop]: === Iteration 56 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:07,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1221474511, now seen corresponding path program 5 times [2018-02-04 03:12:07,109 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:07,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 56 proven. 218 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-02-04 03:12:09,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:09,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 03:12:09,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:12:09,218 INFO L182 omatonBuilderFactory]: Interpolants [15488#(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) (- (+ (* (- 4) alloc_17_~i~0) 8))) alloc_17_~p~0.base)) (= alloc_17_~array.offset 0) (not (= 0 alloc_17_~p~0.base)) (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) (- (+ (* (- 4) alloc_17_~i~0) 8))) (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))))) (= 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) 8)))))), 15489#(and (= alloc_17_~array.offset 0) (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) (- (+ (* (- 4) alloc_17_~i~0) 8))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (- (+ (* (- 4) alloc_17_~i~0) 8))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (- (+ (* (- 4) alloc_17_~i~0) 8))) (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))))), 15490#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (- (+ (* (- 4) alloc_17_~i~0) 12))))) (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) (- (+ (* (- 4) alloc_17_~i~0) 12))) (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) 12))) (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)))))), 15491#(and (not (= (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) 8))) (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) 8))))) (= 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 (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (- (+ (* (- 4) alloc_17_~j~0) 8))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ 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)))))), 15492#(and (not (= (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) 8))) (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 (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) 8))))) (= alloc_17_~array.offset 0) (not (= 0 |alloc_17_#t~mem6.base|)) (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)))))), 15493#(and (not (= (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) 8))) (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) 8))))) (= alloc_17_~array.offset 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)))))), 15494#(and (= 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))))) (= 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 (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))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 15495#(and (= alloc_17_~array.offset 0) (not (= 0 |alloc_17_#t~mem6.base|)) (or (= 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))))) (not (= 1 (select |#valid| |alloc_17_#t~mem6.base|))))), 15496#(and (= 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))))) (= alloc_17_~array.offset 0)), 15497#(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)))))), 15498#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 15457#true, 15458#false, 15459#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15460#(= 0 |ldv_malloc_#t~malloc1.offset|), 15461#(= 0 |ldv_malloc_#res.offset|), 15462#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 15463#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15464#(= entry_point_~array~0.offset 0), 15465#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 15466#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 15467#(= 0 |alloc_17_#in~array.offset|), 15468#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15469#(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))), 15470#(and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= alloc_17_~array.offset 0)), 15471#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 15472#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 15473#(and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 15474#(and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 15475#(and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 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))))), 15476#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (<= (+ (div (+ (- alloc_17_~array.offset) 4) 4) 1) alloc_17_~i~0)), 15477#(= |#valid| |old(#valid)|), 15478#(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)), 15479#(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|))))), 15480#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (not (= 0 |alloc_17_#t~ret3.base|)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) |alloc_17_#t~ret3.base|)) (<= 2 alloc_17_~i~0)), 15481#(and (<= alloc_17_~i~0 2) (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) 4) alloc_17_~p~0.base)) (= alloc_17_~array.offset 0) (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) 4))) (<= 2 alloc_17_~i~0)), 15482#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (<= 2 alloc_17_~i~0)), 15483#(and (<= alloc_17_~i~0 3) (= alloc_17_~array.offset 0) (<= (+ (div (+ 4 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 15484#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (<= |ldv_malloc_#in~size| ldv_malloc_~size) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|)))))), 15485#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (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)) (<= 4294967296 |ldv_malloc_#in~size|)), 15486#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (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|))))) (<= 4294967296 |ldv_malloc_#in~size|)), 15487#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (- (+ (* (- 4) alloc_17_~i~0) 8))) |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0) (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) (- (+ (* (- 4) alloc_17_~i~0) 8))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (- (+ (* (- 4) alloc_17_~i~0) 8))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))))] [2018-02-04 03:12:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 56 proven. 218 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-02-04 03:12:09,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 03:12:09,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 03:12:09,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1624, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:12:09,218 INFO L87 Difference]: Start difference. First operand 173 states and 185 transitions. Second operand 42 states. [2018-02-04 03:12:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:11,011 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2018-02-04 03:12:11,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:12:11,012 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 140 [2018-02-04 03:12:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:11,012 INFO L225 Difference]: With dead ends: 194 [2018-02-04 03:12:11,012 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 03:12:11,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=328, Invalid=5524, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 03:12:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 03:12:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-02-04 03:12:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 03:12:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2018-02-04 03:12:11,014 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 140 [2018-02-04 03:12:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:11,015 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2018-02-04 03:12:11,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 03:12:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2018-02-04 03:12:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-04 03:12:11,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:11,015 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:11,015 INFO L371 AbstractCegarLoop]: === Iteration 57 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -617586108, now seen corresponding path program 4 times [2018-02-04 03:12:11,016 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:11,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:23,089 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 96 DAG size of output 59 [2018-02-04 03:12:23,355 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 127 DAG size of output 62 [2018-02-04 03:12:23,612 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 127 DAG size of output 62 [2018-02-04 03:12:24,774 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 106 DAG size of output 75 [2018-02-04 03:12:25,044 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 133 DAG size of output 61 [2018-02-04 03:12:26,835 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 143 DAG size of output 38 [2018-02-04 03:12:27,290 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 127 DAG size of output 33 [2018-02-04 03:12:27,757 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 134 DAG size of output 20 [2018-02-04 03:12:28,252 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 113 DAG size of output 16 [2018-02-04 03:12:28,895 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 115 DAG size of output 18 [2018-02-04 03:12:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 170 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-04 03:12:29,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:29,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 03:12:29,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:12:29,564 INFO L182 omatonBuilderFactory]: Interpolants [16000#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= |#valid| |old(#valid)|) (<= 0 (* 4 alloc_17_~j~0))) (<= 1 (* 4 alloc_17_~j~0)) (not (= alloc_17_~array.offset 0)))), 16001#(or (not (= |alloc_17_#in~array.offset| 0)) (and (<= 0 (* 4 alloc_17_~j~0)) (or (= |#valid| |old(#valid)|) (<= 1 (* 4 alloc_17_~j~0))))), 16002#(or (and (or (= |#valid| |old(#valid)|) (<= 0 (+ (* 4 alloc_17_~j~0) 3))) (<= 0 (+ (* 4 alloc_17_~j~0) 4))) (not (= |alloc_17_#in~array.offset| 0))), 16003#(or (not (= |alloc_17_#in~array.offset| 0)) (= |#valid| |old(#valid)|)), 16004#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |old(#valid)| entry_point_~array~0.base) (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (= (store |old(#valid)| entry_point_~array~0.base (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base)) (store |#valid| entry_point_~array~0.base 0))), 15958#true, 15959#false, 15960#(= |#valid| |old(#valid)|), 15961#(and (<= 10 entry_point_~len~0) (= |#valid| |old(#valid)|) (<= entry_point_~len~0 10)), 15962#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|) (= (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)), 15963#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (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|))))), 15964#(and (<= 10 entry_point_~len~0) (= (select |#valid| |entry_point_#t~ret8.base|) 1) (<= entry_point_~len~0 10) (= (select |old(#valid)| |entry_point_#t~ret8.base|) 0) (= 0 |entry_point_#t~ret8.offset|) (not (= 0 |entry_point_#t~ret8.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 15965#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= (select |#valid| entry_point_~array~0.base) 1) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 15966#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 15967#(and (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) 4)) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= entry_point_~array~0.offset 0)), 15968#(and (or (and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= (* 4 entry_point_~len~0) (* 4 entry_point_~i~1)) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 15969#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 15970#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 15971#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 15972#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (not (= 0 |alloc_17_#t~ret3.base|)) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0)))), 15973#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 15974#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (= (select |#valid| alloc_17_~array.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= 0 (select |old(#valid)| (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|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (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)))), 15975#(and (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= 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))), 15976#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 15977#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret3.base|)) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0) (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) |alloc_17_#t~ret3.base| (select |#valid| |alloc_17_#t~ret3.base|))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= 0 |alloc_17_#t~ret3.base|))) (not (= alloc_17_~array.offset 0)))), 15978#(and (or (and (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= |#valid| (store (store |old(#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) (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))) alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (= 0 (select |old(#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))) (= 1 (select |#valid| alloc_17_~p~0.base)) (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))) (= (store (store |#valid| alloc_17_~p~0.base 0) (@diff (store |#valid| alloc_17_~p~0.base 0) |#valid|) (select |#valid| (@diff (store |#valid| alloc_17_~p~0.base 0) |#valid|))) |#valid|) (= 1 (select |#valid| (@diff |#valid| (store |#valid| alloc_17_~p~0.base 0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= 0 (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)))) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= 0 alloc_17_~p~0.base))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 15979#(and (or (and (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= |#valid| (store (store |old(#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) (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))) alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (= 0 (select |old(#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))) (= 1 (select |#valid| alloc_17_~p~0.base)) (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))) (= (store (store |#valid| alloc_17_~p~0.base 0) (@diff (store |#valid| alloc_17_~p~0.base 0) |#valid|) (select |#valid| (@diff (store |#valid| alloc_17_~p~0.base 0) |#valid|))) |#valid|) (= 1 (select |#valid| (@diff |#valid| (store |#valid| alloc_17_~p~0.base 0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= 0 (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)))) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= 0 alloc_17_~p~0.base))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 15980#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |#valid| alloc_17_~array.base) 1) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (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)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) 0) (not (= (@diff (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0) |#valid|) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= |alloc_17_#in~array.base| (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) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= (store |#valid| (@diff |#valid| (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0)) (select (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0) (@diff |#valid| (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0)))) (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 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))), 15981#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |#valid| alloc_17_~array.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (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 (- 4))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4)))))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset))) 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset))))) (not (= alloc_17_~array.offset 0)))), 15982#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |#valid| alloc_17_~array.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (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 (- 4))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4)))))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset))) 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset))))) (not (= alloc_17_~array.offset 0)))), 15983#(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)), 15984#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 15985#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret3.base|)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |old(#valid)| |alloc_17_#t~ret3.base|) 0) (= |#valid| (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (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 (- 4))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4))))) |alloc_17_#t~ret3.base| (select |#valid| |alloc_17_#t~ret3.base|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset))) 0)) (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (not (= 0 |alloc_17_#t~ret3.base|))) (not (= alloc_17_~array.offset 0)))), 15986#(and (or (and (not (= 0 alloc_17_~p~0.base)) (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)) alloc_17_~array.offset)))) (or (and (not (= |alloc_17_#in~array.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)) alloc_17_~array.offset)))) (not (= |alloc_17_#in~array.base| 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)) alloc_17_~array.offset)))) (= 0 (select |old(#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))) (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) 0))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0) (or (and (= (select |old(#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)) alloc_17_~array.offset))) 0) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (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) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)) (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))) (= |#valid| (store (store (store |old(#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) (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))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4))) (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) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4))))) alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base)))) (= 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) 0)))) (<= 9 (+ (* 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))), 15987#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (or (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) 0) (= |#valid| (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (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 (- 4))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4))))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (select |#valid| (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) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset))) 0)) (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))) (not (= alloc_17_~array.offset 0)))), 15988#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 8)) alloc_17_~array.offset)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)) (and (= |#valid| (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (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 (- 8))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 8))))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4)))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 8)) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 8)) alloc_17_~array.offset))) 0) (= (select |old(#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) 4)) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 8)) alloc_17_~array.offset)))) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 3) alloc_17_~i~0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 8)) alloc_17_~array.offset)))) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~i~0) 4)) alloc_17_~array.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= 13 (+ (* 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))), 15989#(and (or (and (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)))) (or (and (or (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (* (- 4) alloc_17_~j~0)) alloc_17_~array.offset)) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) (and (= (select |old(#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)) alloc_17_~array.offset))) 0) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) 0) (= |#valid| (store (store (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset (- 4))) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset (- 4))))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))) (not (= (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)) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))))) (= 0 (select |old(#valid)| (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) (+ (- (* (- 4) alloc_17_~j~0)) alloc_17_~array.offset)) (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)))) (not (= |alloc_17_#in~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)) alloc_17_~array.offset)))) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (* (- 4) alloc_17_~j~0)) alloc_17_~array.offset)))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 9 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= 0 (select (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))), 15990#(and (or (and (not (= 0 |alloc_17_#t~mem6.base|)) (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)))) (or (and (not (= |alloc_17_#t~mem6.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)) alloc_17_~array.offset)))) (or (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~mem6.base|)) (= (select |old(#valid)| |alloc_17_#t~mem6.base|) (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|)) (= (select |old(#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)) alloc_17_~array.offset))) 0) (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0) (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store (store (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset (- 4))) (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset (- 4))))) |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|))) (not (= |alloc_17_#in~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)) alloc_17_~array.offset))))) (= (select (store (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)) alloc_17_~array.offset)) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0)) (not (= 4 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 9 (+ (* 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))), 15991#(and (or (and (or (and (or (= (select (store |#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)) alloc_17_~array.offset)) 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0) (and (= |#valid| (store (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset (- 4))) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset (- 4)))))) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (= (select |old(#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)) alloc_17_~array.offset))) 0) (not (= |alloc_17_#in~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)) alloc_17_~array.offset)))))) (not (= 4 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 9 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (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))))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 15992#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~j~0) 4)) alloc_17_~array.offset)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~j~0) 4)) alloc_17_~array.offset))) 0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~j~0) 4)) alloc_17_~array.offset)))) (= (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset (- 4))) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset (- 4))))) |#valid|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ (* (- 4) alloc_17_~j~0) 4)) alloc_17_~array.offset)) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)) 0)) (not (= 4 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= 9 (+ (* 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))), 15993#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (or (and (or (and (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) 0) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 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) 0)) 0)) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 15994#(and (or (and (or (and (or (= (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)) 0) (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~mem6.base|)) (= (select |old(#valid)| |alloc_17_#t~mem6.base|) (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|)) (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0) (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store (store |old(#valid)| |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|)) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= 0 |alloc_17_#t~mem6.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 15995#(and (or (and (or (= (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0) (and (= |#valid| (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0) (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))) (<= 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))), 15996#(and (or (<= 5 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)) 0) (and (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 15997#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) 0) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))))) (not (= 0 (+ (* 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))), 15998#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) 0) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))))) (<= 0 (* 4 alloc_17_~j~0))) (<= 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))), 15999#(and (or (and (<= 0 (* 4 alloc_17_~j~0)) (or (and (not (= 0 |alloc_17_#t~mem6.base|)) (or (and (= (store |#valid| |alloc_17_#t~mem6.base| 0) (store |old(#valid)| |alloc_17_#t~mem6.base| (select (store |#valid| |alloc_17_#t~mem6.base| 0) |alloc_17_#t~mem6.base|))) (= 0 (select |old(#valid)| |alloc_17_#t~mem6.base|))) (= (select |#valid| |alloc_17_#t~mem6.base|) 0))) (<= 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)))] [2018-02-04 03:12:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 170 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-04 03:12:29,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 03:12:29,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 03:12:29,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:12:29,564 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 47 states. [2018-02-04 03:12:31,002 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 113 DAG size of output 103 [2018-02-04 03:12:31,437 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 190 DAG size of output 137 [2018-02-04 03:12:31,837 WARN L146 SmtUtils]: Spent 307ms on a formula simplification. DAG size of input: 222 DAG size of output 162 [2018-02-04 03:12:32,151 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 195 DAG size of output 128 [2018-02-04 03:12:32,350 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 165 DAG size of output 110 [2018-02-04 03:12:32,550 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 132 DAG size of output 88 [2018-02-04 03:12:32,926 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 122 DAG size of output 99 [2018-02-04 03:12:33,136 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 150 DAG size of output 77 [2018-02-04 03:12:34,584 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 123 DAG size of output 91 [2018-02-04 03:12:34,989 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 124 DAG size of output 91 [2018-02-04 03:12:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:35,369 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2018-02-04 03:12:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 03:12:35,370 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 140 [2018-02-04 03:12:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:35,370 INFO L225 Difference]: With dead ends: 211 [2018-02-04 03:12:35,370 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 03:12:35,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 19 SyntacticMatches, 32 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=767, Invalid=5553, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 03:12:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 03:12:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-02-04 03:12:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 03:12:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2018-02-04 03:12:35,373 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 140 [2018-02-04 03:12:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:35,373 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2018-02-04 03:12:35,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 03:12:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2018-02-04 03:12:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 03:12:35,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:35,373 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-02-04 03:12:35,373 INFO L371 AbstractCegarLoop]: === Iteration 58 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1310933423, now seen corresponding path program 5 times [2018-02-04 03:12:35,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:35,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 308 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-04 03:12:37,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:37,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 03:12:37,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-02-04 03:12:37,193 INFO L182 omatonBuilderFactory]: Interpolants [16455#true, 16456#false, 16457#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 16458#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 16459#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 16460#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|) (not (= 0 |entry_point_#t~ret8.base|))), 16461#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 16462#(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) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1))) entry_point_~array~0.base))), 16463#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 36)))) entry_point_~array~0.base)) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16464#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 32)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 32))) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~1)), 16465#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 28)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~1)), 16466#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 24)))) entry_point_~array~0.base)) (= 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~1) 24)))) 4) 4) entry_point_~i~1)), 16467#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~1) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 20)))) entry_point_~array~0.base))), 16468#(and (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 16))) (- entry_point_~array~0.offset)) 4) 6) entry_point_~i~1) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~1) 16)))) entry_point_~array~0.base))), 16469#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~1)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 12)))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 12))) (- entry_point_~array~0.offset)) 4) 7) entry_point_~i~1)), 16470#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 8)))) entry_point_~array~0.base))), 16471#(and (= entry_point_~array~0.offset 0) (or (and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)))), 16472#(and (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16473#(and (or (and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 16474#(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))), 16475#(and (= 0 |alloc_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4) |alloc_17_#in~array.base|))), 16476#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) alloc_17_~array.base))), 16477#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) alloc_17_~array.base))), 16478#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 16479#(= |#valid| |old(#valid)|), 16480#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 16481#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 16482#(and (= alloc_17_~array.offset 0) (not (= 0 |alloc_17_#t~ret3.base|)) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 16483#(and (= alloc_17_~array.offset 0) (not (= 0 alloc_17_~p~0.base)) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 16484#(and (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)) alloc_17_~array.base))), 16485#(and (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) alloc_17_~array.base))), 16486#(and (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))) alloc_17_~array.base))), 16487#(and (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))) alloc_17_~array.base))), 16488#(and (not (= (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) (- 8))) alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 16489#(and (= alloc_17_~array.offset 0) (not (= (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.base))), 16490#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4))) alloc_17_~array.base))), 16491#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) alloc_17_~array.base))), 16492#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 16493#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:12:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 308 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-04 03:12:37,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 03:12:37,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 03:12:37,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1391, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:12:37,194 INFO L87 Difference]: Start difference. First operand 173 states and 185 transitions. Second operand 39 states. [2018-02-04 03:12:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:40,913 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2018-02-04 03:12:40,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 03:12:40,913 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 142 [2018-02-04 03:12:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:40,914 INFO L225 Difference]: With dead ends: 184 [2018-02-04 03:12:40,914 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 03:12:40,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 14 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=851, Invalid=8655, Unknown=0, NotChecked=0, Total=9506 [2018-02-04 03:12:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 03:12:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 173. [2018-02-04 03:12:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 03:12:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 184 transitions. [2018-02-04 03:12:40,917 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 184 transitions. Word has length 142 [2018-02-04 03:12:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:40,917 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 184 transitions. [2018-02-04 03:12:40,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 03:12:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 184 transitions. [2018-02-04 03:12:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 03:12:40,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:40,918 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:40,918 INFO L371 AbstractCegarLoop]: === Iteration 59 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:40,918 INFO L82 PathProgramCache]: Analyzing trace with hash 683184214, now seen corresponding path program 6 times [2018-02-04 03:12:40,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:40,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:12:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2018-02-04 03:12:41,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:41,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:12:41,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-04 03:12:41,027 INFO L182 omatonBuilderFactory]: Interpolants [16976#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 4)), 16977#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 5)), 16978#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 6)), 16979#(<= |alloc_17_#in~len| 6), 16969#true, 16970#false, 16971#(<= 10 entry_point_~len~0), 16972#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 16973#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 16974#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 16975#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3))] [2018-02-04 03:12:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2018-02-04 03:12:41,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:12:41,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:12:41,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:12:41,027 INFO L87 Difference]: Start difference. First operand 173 states and 184 transitions. Second operand 11 states. [2018-02-04 03:12:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:41,076 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2018-02-04 03:12:41,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:12:41,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 148 [2018-02-04 03:12:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:41,078 INFO L225 Difference]: With dead ends: 284 [2018-02-04 03:12:41,078 INFO L226 Difference]: Without dead ends: 281 [2018-02-04 03:12:41,078 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:12:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-04 03:12:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 180. [2018-02-04 03:12:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 03:12:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2018-02-04 03:12:41,081 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 148 [2018-02-04 03:12:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:41,081 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2018-02-04 03:12:41,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:12:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2018-02-04 03:12:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 03:12:41,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:41,082 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:41,082 INFO L371 AbstractCegarLoop]: === Iteration 60 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:41,082 INFO L82 PathProgramCache]: Analyzing trace with hash -598770635, now seen corresponding path program 5 times [2018-02-04 03:12:41,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:41,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 60 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-04 03:12:42,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:42,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 03:12:42,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-04 03:12:42,185 INFO L182 omatonBuilderFactory]: Interpolants [17472#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (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) 0)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3))), 17473#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (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) 0)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3))), 17474#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= alloc_17_~j~0 0)), 17475#(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))))), 17476#(= 0 |alloc_17_#t~mem6.offset|), 17446#true, 17447#false, 17448#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17449#(= 0 |ldv_malloc_#t~malloc1.offset|), 17450#(= 0 |ldv_malloc_#res.offset|), 17451#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 17452#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17453#(= entry_point_~array~0.offset 0), 17454#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17455#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17456#(= 0 |alloc_17_#in~array.offset|), 17457#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 17458#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 17459#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 17460#(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))))), 17461#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (* 4 alloc_17_~i~0) 3))), 17462#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (and (<= (* 4 alloc_17_~i~0) 8) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))))), 17463#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 12) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (* 4 alloc_17_~i~0) 11))), 17464#(and (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 15)) (= alloc_17_~array.offset 0) (<= alloc_17_~i~0 4)), 17465#(and (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) 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) 11)) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 3)), 17466#(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)))))) (= 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)) (<= (* 4 alloc_17_~j~0) 11)) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 3)), 17467#(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) 0)) (<= (* 4 alloc_17_~j~0) 11)) (<= alloc_17_~j~0 3)), 17468#(and (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) 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) 7)) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 2)), 17469#(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)))))) (= 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)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7)) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 2)), 17470#(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) 0)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7)) (<= alloc_17_~j~0 2)), 17471#(and (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) 0)) (<= (+ (* 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)))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1))] [2018-02-04 03:12:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 60 proven. 155 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-02-04 03:12:42,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 03:12:42,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 03:12:42,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:12:42,186 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 31 states. [2018-02-04 03:12:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:42,650 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-02-04 03:12:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:12:42,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-02-04 03:12:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:42,651 INFO L225 Difference]: With dead ends: 197 [2018-02-04 03:12:42,651 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 03:12:42,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=399, Invalid=2253, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 03:12:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 03:12:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2018-02-04 03:12:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 03:12:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2018-02-04 03:12:42,653 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 147 [2018-02-04 03:12:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:42,654 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2018-02-04 03:12:42,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 03:12:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2018-02-04 03:12:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 03:12:42,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:42,655 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:42,655 INFO L371 AbstractCegarLoop]: === Iteration 61 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash -598770634, now seen corresponding path program 6 times [2018-02-04 03:12:42,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:42,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:45,539 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 99 DAG size of output 31 [2018-02-04 03:12:45,691 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 97 DAG size of output 33 [2018-02-04 03:12:46,016 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 118 DAG size of output 35 [2018-02-04 03:12:46,268 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 127 DAG size of output 43 [2018-02-04 03:12:46,460 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 122 DAG size of output 43 [2018-02-04 03:12:46,667 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 128 DAG size of output 43 [2018-02-04 03:12:46,855 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 122 DAG size of output 45 [2018-02-04 03:12:47,077 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 101 DAG size of output 45 [2018-02-04 03:12:47,266 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 108 DAG size of output 44 [2018-02-04 03:12:47,429 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 90 DAG size of output 35 [2018-02-04 03:12:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 74 proven. 209 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-02-04 03:12:48,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:48,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 03:12:48,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 31 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:12:48,108 INFO L182 omatonBuilderFactory]: Interpolants [17920#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 17921#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 17922#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 17923#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 17924#(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)))))), 17925#(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))))), 17926#(= |#valid| |old(#valid)|), 17927#(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)), 17928#(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|))))), 17929#(and (or (<= (* 4 alloc_17_~i~0) 3) (and (not (= 0 |alloc_17_#t~ret3.base|)) (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))))) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4)), 17930#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4) (or (and (not (= 0 alloc_17_~p~0.base)) (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))), 17931#(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) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 17932#(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))) (<= (* 4 alloc_17_~i~0) 8) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7))), 17933#(and (= (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)), 17934#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (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|))))), 17935#(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) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 8) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7)) (= alloc_17_~array.offset 0)), 17936#(and (= alloc_17_~array.offset 0) (or (and (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)) (= 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))) (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))) (<= (* 4 alloc_17_~i~0) 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) 4) (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) 7))), 17937#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~i~0) 8) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7)) (= alloc_17_~array.offset 0)), 17938#(and (= alloc_17_~array.offset 0) (or (and (<= (* 4 alloc_17_~i~0) 12) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 11))), 17939#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 17940#(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|))))), 17941#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 11) (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) |alloc_17_#t~ret3.base|)) (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (<= (* 4 alloc_17_~i~0) 12) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (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 |alloc_17_#t~ret3.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 17942#(and (or (and (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)) (= 1 (select |#valid| alloc_17_~p~0.base)) (not (= 0 alloc_17_~p~0.base)) (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))) (= 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))) (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) 4) (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))) (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) 11)) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 12)), 17943#(and (= alloc_17_~array.offset 0) (or (and (<= (* 4 alloc_17_~i~0) 12) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (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 (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 11))), 17944#(and (= alloc_17_~array.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (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))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (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))))) (<= (* 4 alloc_17_~i~0) 16) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 15))), 17945#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 11) (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))))) (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))))) (= 1 (select |#valid| (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) 4) (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) 12) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 4)))))), 17946#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 11) (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 |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| |alloc_17_#t~mem6.base|)) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 4) (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) 12) (= 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 (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 4))))) (= alloc_17_~array.offset 0)), 17947#(and (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))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 4) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 4)))) (<= (* 4 alloc_17_~j~0) 11)) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~j~0) 12)), 17948#(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 (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) 4) (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 2) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 4)))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7))), 17949#(and (or (and (<= (* 4 alloc_17_~j~0) 8) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 4) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 4))) (= 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)))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7)) (= alloc_17_~array.offset 0)), 17950#(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) 4) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 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 2)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7))), 17951#(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 (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~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)))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3))), 17952#(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)), 17953#(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)))), 17954#(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)), 17955#(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)))))), 17956#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 17908#true, 17909#false, 17910#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17911#(= 0 |ldv_malloc_#t~malloc1.offset|), 17912#(= 0 |ldv_malloc_#res.offset|), 17913#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 17914#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17915#(= entry_point_~array~0.offset 0), 17916#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17917#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17918#(= 0 |alloc_17_#in~array.offset|), 17919#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0))] [2018-02-04 03:12:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 74 proven. 209 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-02-04 03:12:48,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 03:12:48,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 03:12:48,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2085, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 03:12:48,108 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand 49 states. [2018-02-04 03:12:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:49,775 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2018-02-04 03:12:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:12:49,775 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 147 [2018-02-04 03:12:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:49,776 INFO L225 Difference]: With dead ends: 196 [2018-02-04 03:12:49,776 INFO L226 Difference]: Without dead ends: 196 [2018-02-04 03:12:49,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=779, Invalid=6193, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 03:12:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-04 03:12:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2018-02-04 03:12:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 03:12:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2018-02-04 03:12:49,778 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 147 [2018-02-04 03:12:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:49,778 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2018-02-04 03:12:49,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 03:12:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2018-02-04 03:12:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 03:12:49,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:49,779 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:49,780 INFO L371 AbstractCegarLoop]: === Iteration 62 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash 107038230, now seen corresponding path program 6 times [2018-02-04 03:12:49,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:49,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 152 proven. 188 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:12:51,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:51,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 03:12:51,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-02-04 03:12:51,201 INFO L182 omatonBuilderFactory]: Interpolants [18432#(and (or (<= (+ (* 4 entry_point_~i~1) 5) (* 4 entry_point_~len~0)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 4)))) (= entry_point_~array~0.offset 0)), 18433#(and (or (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~1) 1) (* 4 entry_point_~len~0))) (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 18434#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 18435#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 18436#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18437#(= |#valid| |old(#valid)|), 18438#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 18439#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 18440#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 18441#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 18442#(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)))))), 18443#(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)))))), 18444#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (and (<= alloc_17_~i~0 2) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))) (= alloc_17_~array.offset 0)), 18445#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 3) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 11))), 18446#(and (or (and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= alloc_17_~i~0 4)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 15)) (= alloc_17_~array.offset 0)), 18447#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 8) (and (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))) (<= alloc_17_~j~0 3)))), 18448#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 4) (and (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))) (<= alloc_17_~j~0 2)))), 18449#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~j~0 1) (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) 0))), 18450#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (and (<= alloc_17_~j~0 1) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 18451#(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))), 18452#(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))), 18453#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 18454#(= 1 (select |#valid| alloc_17_~array.base)), 18415#true, 18416#false, 18417#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 18418#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 18419#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 18420#(and (<= 10 entry_point_~len~0) (= 1 (select |#valid| |entry_point_#t~ret8.base|)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 18421#(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)), 18422#(and (= 1 (select |#valid| entry_point_~array~0.base)) (<= 10 entry_point_~len~0) (or (= 0 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 18423#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (and (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 36)) (<= entry_point_~len~0 10) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~1) (+ (* (- 4) entry_point_~len~0) 36)))) 4) 1) entry_point_~i~1)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 35))) (= entry_point_~array~0.offset 0)), 18424#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 31)) (and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 32)))) (= entry_point_~array~0.offset 0)), 18425#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 28)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 27)))), 18426#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 24)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 23))) (= entry_point_~array~0.offset 0)), 18427#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 19)) (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 20)))), 18428#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 15)) (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 16))) (= entry_point_~array~0.offset 0)), 18429#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 12)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 11))) (= entry_point_~array~0.offset 0)), 18430#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 8)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 7))) (= entry_point_~array~0.offset 0)), 18431#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 4)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~1) entry_point_~array~0.offset 3))) (= entry_point_~array~0.offset 0))] [2018-02-04 03:12:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 152 proven. 188 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:12:51,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 03:12:51,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 03:12:51,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:12:51,202 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand 40 states. [2018-02-04 03:12:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:52,738 INFO L93 Difference]: Finished difference Result 195 states and 209 transitions. [2018-02-04 03:12:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 03:12:52,738 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 149 [2018-02-04 03:12:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:52,739 INFO L225 Difference]: With dead ends: 195 [2018-02-04 03:12:52,739 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 03:12:52,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=662, Invalid=5038, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 03:12:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 03:12:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-02-04 03:12:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 03:12:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2018-02-04 03:12:52,741 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 149 [2018-02-04 03:12:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:52,741 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2018-02-04 03:12:52,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 03:12:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2018-02-04 03:12:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 03:12:52,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:52,742 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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:12:52,743 INFO L371 AbstractCegarLoop]: === Iteration 63 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:52,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1505018484, now seen corresponding path program 7 times [2018-02-04 03:12:52,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:52,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 117 proven. 204 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-02-04 03:12:54,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:54,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 03:12:54,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 56 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 03:12:54,367 INFO L182 omatonBuilderFactory]: Interpolants [18944#(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) (- 8))) (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) (* 4 alloc_17_~i~0)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 18945#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))) (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) (+ (* 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) (- 12))) (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))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12)))))), 18946#(and (= 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) (- 8))))) (not (= (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) (- 8))) (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 (= (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) (- 8))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 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))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 18947#(and (not (= (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) (- 8))) (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) (not (= 0 |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| |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) (- 8)))))), 18948#(and (= 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) (- 8))))) (not (= (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) (- 8))) (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)), 18949#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))), 18950#(and (= alloc_17_~array.offset 0) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 18951#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 18952#(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)))))), 18953#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 18914#true, 18915#false, 18916#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 18917#(= 0 |ldv_malloc_#t~malloc1.offset|), 18918#(= 0 |ldv_malloc_#res.offset|), 18919#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 18920#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 18921#(= entry_point_~array~0.offset 0), 18922#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 18923#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 18924#(= 0 |alloc_17_#in~array.offset|), 18925#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 18926#(= alloc_17_~array.offset 0), 18927#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 18928#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 18929#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 18930#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 18931#(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_~i~0)))))), 18932#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 18933#(= |#valid| |old(#valid)|), 18934#(and (= (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)), 18935#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (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|))))), 18936#(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) (- 4))) |alloc_17_#t~ret3.base|))), 18937#(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 (= (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))) alloc_17_~p~0.base))), 18938#(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) (- 4))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 18939#(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) (- 8))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 18940#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 18941#(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|))))), 18942#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))) |alloc_17_#t~ret3.base|)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 |alloc_17_#t~ret3.base|))), 18943#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| 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) (+ (* 4 alloc_17_~i~0) (- 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) (+ (* 4 alloc_17_~i~0) (- 8))) (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) (+ (* 4 alloc_17_~i~0) (- 8))) alloc_17_~p~0.base)))] [2018-02-04 03:12:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 117 proven. 204 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-02-04 03:12:54,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 03:12:54,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 03:12:54,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1437, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:12:54,367 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand 40 states. [2018-02-04 03:12:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:55,727 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2018-02-04 03:12:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:12:55,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 153 [2018-02-04 03:12:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:55,728 INFO L225 Difference]: With dead ends: 194 [2018-02-04 03:12:55,728 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 03:12:55,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=535, Invalid=5471, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 03:12:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 03:12:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-02-04 03:12:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 03:12:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2018-02-04 03:12:55,731 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 153 [2018-02-04 03:12:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:55,732 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2018-02-04 03:12:55,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 03:12:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2018-02-04 03:12:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 03:12:55,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:55,733 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:55,733 INFO L371 AbstractCegarLoop]: === Iteration 64 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash 776960945, now seen corresponding path program 7 times [2018-02-04 03:12:55,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:55,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-02-04 03:12:55,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:55,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:12:55,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-02-04 03:12:55,841 INFO L182 omatonBuilderFactory]: Interpolants [19424#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 4)), 19425#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 5)), 19426#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 6)), 19427#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 7)), 19428#(<= |alloc_17_#in~len| 7), 19417#true, 19418#false, 19419#(<= 10 entry_point_~len~0), 19420#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 19421#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 19422#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 19423#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3))] [2018-02-04 03:12:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-02-04 03:12:55,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:12:55,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:12:55,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:12:55,841 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 12 states. [2018-02-04 03:12:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:55,889 INFO L93 Difference]: Finished difference Result 327 states and 347 transitions. [2018-02-04 03:12:55,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:12:55,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 161 [2018-02-04 03:12:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:55,890 INFO L225 Difference]: With dead ends: 327 [2018-02-04 03:12:55,890 INFO L226 Difference]: Without dead ends: 324 [2018-02-04 03:12:55,890 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:12:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-04 03:12:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 199. [2018-02-04 03:12:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 03:12:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 214 transitions. [2018-02-04 03:12:55,893 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 214 transitions. Word has length 161 [2018-02-04 03:12:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:55,893 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 214 transitions. [2018-02-04 03:12:55,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:12:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 214 transitions. [2018-02-04 03:12:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 03:12:55,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:55,893 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:55,893 INFO L371 AbstractCegarLoop]: === Iteration 65 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash 651180410, now seen corresponding path program 6 times [2018-02-04 03:12:55,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:55,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:12:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 29 proven. 209 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:12:56,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:12:56,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:12:56,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:12:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-02-04 03:12:56,738 INFO L182 omatonBuilderFactory]: Interpolants [19968#(= alloc_17_~array.offset 0), 19969#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 19970#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 19971#(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)), 19972#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 19973#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))), 19974#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))))), 19975#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 16))))), 19976#(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) (+ (* 4 alloc_17_~j~0) (- 12))))), 19977#(and (= alloc_17_~array.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 8))))), 19978#(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))))))), 19979#(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)))))), 19980#(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)), 19981#(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))))), 19982#(= 0 |alloc_17_#t~mem6.offset|), 19957#true, 19958#false, 19959#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 19960#(= 0 |ldv_malloc_#t~malloc1.offset|), 19961#(= 0 |ldv_malloc_#res.offset|), 19962#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 19963#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 19964#(= entry_point_~array~0.offset 0), 19965#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= 0 entry_point_~array~0.offset)), 19966#(= 0 |alloc_17_#in~array.offset|), 19967#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0))] [2018-02-04 03:12:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 29 proven. 209 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 03:12:56,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:12:56,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:12:56,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:12:56,739 INFO L87 Difference]: Start difference. First operand 199 states and 214 transitions. Second operand 26 states. [2018-02-04 03:12:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:12:57,358 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2018-02-04 03:12:57,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:12:57,358 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 160 [2018-02-04 03:12:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:12:57,359 INFO L225 Difference]: With dead ends: 209 [2018-02-04 03:12:57,359 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 03:12:57,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 19 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=424, Invalid=2332, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 03:12:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 03:12:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2018-02-04 03:12:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 03:12:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 217 transitions. [2018-02-04 03:12:57,361 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 217 transitions. Word has length 160 [2018-02-04 03:12:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:12:57,361 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 217 transitions. [2018-02-04 03:12:57,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:12:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2018-02-04 03:12:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 03:12:57,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:12:57,362 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:12:57,362 INFO L371 AbstractCegarLoop]: === Iteration 66 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:12:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash 651180411, now seen corresponding path program 8 times [2018-02-04 03:12:57,363 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:12:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:12:57,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:13:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 62 proven. 290 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-04 03:13:00,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:13:00,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 03:13:00,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:13:00,572 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:13:00,572 INFO L182 omatonBuilderFactory]: Interpolants [20480#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (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|))))) (<= 4294967296 |ldv_malloc_#in~size|)), 20481#(and (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) (+ (* 4 alloc_17_~i~0) (- 12))) (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) (- 12))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 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) (+ (* 4 alloc_17_~i~0) (- 12))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))) |alloc_17_#t~ret3.base|))), 20482#(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) (+ (* 4 alloc_17_~i~0) (- 12))) (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))))) (= alloc_17_~array.offset 0) (not (= 0 alloc_17_~p~0.base)) (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) (+ (* 4 alloc_17_~i~0) (- 12))) (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) (- 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) (+ (* 4 alloc_17_~i~0) (- 12))) alloc_17_~p~0.base)) (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) (- 8))))) (= 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) (- 12)))))), 20483#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))) (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) (+ (* 4 alloc_17_~i~0) (- 12))) (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) (- 12))) (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))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 20484#(and (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) (+ (* 4 alloc_17_~i~0) (- 16))) (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) (+ (* 4 alloc_17_~i~0) (- 16))))) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 16))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 12))))) (not (= 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) (- 12))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 16))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 20485#(and (not (= (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) (- 12))) (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) (- 8))))) (not (= (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) (- 12))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ 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) (- 8))))) (= 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 (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (* 4 alloc_17_~j~0) (- 12))) (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) (- 12))))) (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)))))), 20486#(and (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) (- 8))))) (not (= (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) (- 12))) (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) (- 8))))) (= alloc_17_~array.offset 0) (not (= (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) (- 12))) (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 |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) (- 12))))) (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)))))), 20487#(and (not (= (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) (- 12))) (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) (- 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) (- 8))))) (= alloc_17_~array.offset 0) (not (= (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) (- 12))) (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) (- 12))))) (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)))))), 20488#(and (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (= alloc_17_~array.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 8))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 8))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 20489#(and (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (= 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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 8))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 8))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 20490#(and (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 8))))) (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 8))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) (- 4)))))), 20491#(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 (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))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~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)))))), 20492#(and (= alloc_17_~array.offset 0) (not (= 0 |alloc_17_#t~mem6.base|)) (or (not (= 1 (select |#valid| |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))))))), 20493#(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)))))), 20494#(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)))))), 20495#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 20447#true, 20448#false, 20449#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 20450#(= 0 |ldv_malloc_#t~malloc1.offset|), 20451#(= 0 |ldv_malloc_#res.offset|), 20452#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret8.offset|)), 20453#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 20454#(= entry_point_~array~0.offset 0), 20455#(and (<= (+ (* 4 entry_point_~i~1) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 20456#(and (<= (* 4 entry_point_~i~1) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 20457#(= 0 |alloc_17_#in~array.offset|), 20458#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 20459#(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))), 20460#(and (= (* 4 alloc_17_~i~0) 4) (= alloc_17_~array.offset 0)), 20461#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 20462#(= (select |#valid| |ldv_malloc_#res.base|) 1), 20463#(and (= (* 4 alloc_17_~i~0) 4) (= alloc_17_~array.offset 0) (= (select |#valid| |alloc_17_#t~ret3.base|) 1)), 20464#(and (= (* 4 alloc_17_~i~0) 4) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 20465#(and (= (* 4 alloc_17_~i~0) 4) (= 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))))), 20466#(and (= alloc_17_~array.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4))) 1) (= (* 4 alloc_17_~i~0) 8)), 20467#(= |#valid| |old(#valid)|), 20468#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 20469#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 20470#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)))) (not (= 0 |alloc_17_#t~ret3.base|)) (<= 2 alloc_17_~i~0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) |alloc_17_#t~ret3.base|))), 20471#(and (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) (+ alloc_17_~array.offset 4)) 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) (+ alloc_17_~array.offset 4)))) (= alloc_17_~array.offset 0) (not (= 0 alloc_17_~p~0.base)) (= (* 4 alloc_17_~i~0) 8)), 20472#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= (* 4 alloc_17_~i~0) 8)), 20473#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= (* 4 alloc_17_~i~0) 12) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 20474#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= (* 4 alloc_17_~i~0) 12) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= 0 |alloc_17_#t~ret3.base|)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) |alloc_17_#t~ret3.base|))), 20475#(and (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) (+ alloc_17_~array.offset 4)) alloc_17_~p~0.base)) (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))))) (= 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) (+ alloc_17_~array.offset 4)))) (= (* 4 alloc_17_~i~0) 12) (= alloc_17_~array.offset 0) (not (= 0 alloc_17_~p~0.base)) (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) (+ alloc_17_~array.offset 4)) (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)))))), 20476#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= (* 4 alloc_17_~i~0) 12) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 20477#(and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) (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) (- 8))))) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (= (* 4 alloc_17_~i~0) 16) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 20478#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (<= |ldv_malloc_#in~size| ldv_malloc_~size) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|)))))), 20479#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (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)) (<= 4294967296 |ldv_malloc_#in~size|))] [2018-02-04 03:13:00,572 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 62 proven. 290 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-04 03:13:00,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 03:13:00,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 03:13:00,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2234, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 03:13:00,573 INFO L87 Difference]: Start difference. First operand 201 states and 217 transitions. Second operand 49 states. [2018-02-04 03:13:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:13:03,430 INFO L93 Difference]: Finished difference Result 229 states and 245 transitions. [2018-02-04 03:13:03,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 03:13:03,430 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 160 [2018-02-04 03:13:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:13:03,431 INFO L225 Difference]: With dead ends: 229 [2018-02-04 03:13:03,431 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 03:13:03,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 9 SyntacticMatches, 13 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=395, Invalid=7795, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 03:13:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 03:13:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-02-04 03:13:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 03:13:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 245 transitions. [2018-02-04 03:13:03,433 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 245 transitions. Word has length 160 [2018-02-04 03:13:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:13:03,433 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 245 transitions. [2018-02-04 03:13:03,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 03:13:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 245 transitions. [2018-02-04 03:13:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 03:13:03,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:13:03,434 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:13:03,434 INFO L371 AbstractCegarLoop]: === Iteration 67 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:13:03,434 INFO L82 PathProgramCache]: Analyzing trace with hash -718326854, now seen corresponding path program 5 times [2018-02-04 03:13:03,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:13:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:13:03,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-04 03:14:27,839 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 03:14:27,842 INFO L168 Benchmark]: Toolchain (without parser) took 183999.31 ms. Allocated memory was 402.7 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 359.5 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-02-04 03:14:27,843 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:14:27,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.03 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.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:14:27,843 INFO L168 Benchmark]: Boogie Preprocessor took 24.58 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 345.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:14:27,843 INFO L168 Benchmark]: RCFGBuilder took 190.02 ms. Allocated memory is still 402.7 MB. Free memory was 345.0 MB in the beginning and 322.9 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-02-04 03:14:27,843 INFO L168 Benchmark]: TraceAbstraction took 183627.60 ms. Allocated memory was 402.7 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 322.9 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-02-04 03:14:27,844 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.16 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.03 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.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 24.58 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 345.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 190.02 ms. Allocated memory is still 402.7 MB. Free memory was 345.0 MB in the beginning and 322.9 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 183627.60 ms. Allocated memory was 402.7 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 322.9 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-14-27-849.csv Completed graceful shutdown