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_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:19:27,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:19:27,756 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:19:27,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:19:27,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:19:27,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:19:27,767 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:19:27,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:19:27,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:19:27,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:19:27,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:19:27,772 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:19:27,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:19:27,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:19:27,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:19:27,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:19:27,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:19:27,778 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:19:27,779 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:19:27,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:19:27,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:19:27,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:19:27,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:19:27,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:19:27,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:19:27,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:19:27,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:19:27,785 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:19:27,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:19:27,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:19:27,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:19:27,786 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:19:27,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:19:27,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:19:27,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:19:27,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:19:27,797 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:19:27,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:19:27,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:19:27,797 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:19:27,797 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:19:27,797 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:19:27,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:19:27,798 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:19:27,798 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:19:27,798 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:19:27,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:19:27,798 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:19:27,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:19:27,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:19:27,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:19:27,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:19:27,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:19:27,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:19:27,799 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:19:27,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:19:27,835 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:19:27,838 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:19:27,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:19:27,839 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:19:27,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-04 03:19:28,008 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:19:28,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:19:28,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:19:28,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:19:28,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:19:28,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a858dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28, skipping insertion in model container [2018-02-04 03:19:28,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,033 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:19:28,065 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:19:28,150 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:19:28,168 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:19:28,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28 WrapperNode [2018-02-04 03:19:28,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:19:28,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:19:28,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:19:28,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:19:28,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (1/1) ... [2018-02-04 03:19:28,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:19:28,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:19:28,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:19:28,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:19:28,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (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:19:28,232 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:19:28,232 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:19:28,232 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-02-04 03:19:28,233 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:19:28,233 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 03:19:28,233 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 03:19:28,233 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:19:28,233 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:19:28,233 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-02-04 03:19:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:19:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-04 03:19:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 03:19:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 03:19:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:19:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:19:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:19:28,234 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:19:28,428 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:19:28,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:19:28 BoogieIcfgContainer [2018-02-04 03:19:28,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:19:28,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:19:28,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:19:28,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:19:28,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:19:28" (1/3) ... [2018-02-04 03:19:28,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251fa353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:19:28, skipping insertion in model container [2018-02-04 03:19:28,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:19:28" (2/3) ... [2018-02-04 03:19:28,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251fa353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:19:28, skipping insertion in model container [2018-02-04 03:19:28,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:19:28" (3/3) ... [2018-02-04 03:19:28,436 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-04 03:19:28,443 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:19:28,449 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 03:19:28,474 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:19:28,474 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:19:28,474 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:19:28,474 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:19:28,474 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:19:28,474 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:19:28,475 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:19:28,475 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:19:28,475 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:19:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-02-04 03:19:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:19:28,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:28,494 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:28,494 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-02-04 03:19:28,538 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:28,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:28,654 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:19:28,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:28,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:19:28,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:28,657 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:19:28,658 INFO L182 omatonBuilderFactory]: Interpolants [85#true, 86#false, 87#(= |#valid| |old(#valid)|)] [2018-02-04 03:19:28,658 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:19:28,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:19:28,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:19:28,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:19:28,668 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-02-04 03:19:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:28,865 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-02-04 03:19:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:19:28,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-04 03:19:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:28,874 INFO L225 Difference]: With dead ends: 133 [2018-02-04 03:19:28,874 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:19:28,875 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:19:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:19:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-02-04 03:19:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 03:19:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-02-04 03:19:28,908 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-02-04 03:19:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:28,908 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-02-04 03:19:28,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:19:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-02-04 03:19:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:19:28,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:28,910 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:28,910 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:28,910 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-02-04 03:19:28,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:28,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:28,978 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:19:28,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:28,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:19:28,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:28,979 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:19:28,979 INFO L182 omatonBuilderFactory]: Interpolants [304#true, 305#false, 306#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 307#(and (= 0 |entry_point_#t~ret12.base|) (= 0 |entry_point_#t~ret12.offset|)), 308#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-04 03:19:28,979 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:19:28,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:19:28,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:19:28,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:19:28,981 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-02-04 03:19:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:29,008 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-04 03:19:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:19:29,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 03:19:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:29,009 INFO L225 Difference]: With dead ends: 85 [2018-02-04 03:19:29,009 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 03:19:29,010 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:19:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 03:19:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 03:19:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 03:19:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 03:19:29,017 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-02-04 03:19:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:29,017 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 03:19:29,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:19:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 03:19:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:19:29,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:29,018 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:29,018 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-02-04 03:19:29,020 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:29,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:29,075 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:19:29,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:29,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:19:29,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:29,076 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:19:29,076 INFO L182 omatonBuilderFactory]: Interpolants [480#(not (= entry_point_~array~0.base 0)), 475#true, 476#false, 477#(not (= |ldv_malloc_#t~malloc2.base| 0)), 478#(not (= |ldv_malloc_#res.base| 0)), 479#(not (= |entry_point_#t~ret12.base| 0))] [2018-02-04 03:19:29,076 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:19:29,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:19:29,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:19:29,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:19:29,076 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-04 03:19:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:29,119 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-04 03:19:29,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:19:29,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 03:19:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:29,121 INFO L225 Difference]: With dead ends: 81 [2018-02-04 03:19:29,121 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 03:19:29,121 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:19:29,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 03:19:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 03:19:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 03:19:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 03:19:29,127 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-02-04 03:19:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:29,127 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 03:19:29,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:19:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 03:19:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:19:29,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:29,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:29,128 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:29,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-02-04 03:19:29,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:29,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:29,180 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:19:29,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:29,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:19:29,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:29,181 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:19:29,181 INFO L182 omatonBuilderFactory]: Interpolants [645#true, 646#false, 647#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 648#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 649#(= 1 (select |#valid| |entry_point_#t~ret12.base|)), 650#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:19:29,182 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:19:29,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:19:29,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:19:29,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:19:29,182 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-02-04 03:19:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:29,271 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 03:19:29,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:19:29,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 03:19:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:29,273 INFO L225 Difference]: With dead ends: 80 [2018-02-04 03:19:29,273 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 03:19:29,273 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:19:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 03:19:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 03:19:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 03:19:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-04 03:19:29,279 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-02-04 03:19:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:29,280 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-04 03:19:29,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:19:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-04 03:19:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:19:29,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:29,280 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:29,280 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-02-04 03:19:29,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:29,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:29,546 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:19:29,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:29,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:19:29,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:29,551 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:19:29,551 INFO L182 omatonBuilderFactory]: Interpolants [816#(<= 1 |entry_point_#t~ret11|), 817#(and (<= entry_point_~len~0 16777215) (<= 1 entry_point_~len~0)), 818#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 819#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 820#(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|))), 821#(and (<= 4 (select |#length| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|)), 822#(and (= entry_point_~array~0.offset 0) (<= 4 (select |#length| entry_point_~array~0.base))), 823#(and (= entry_point_~array~0.offset 0) (<= 4 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 813#true, 814#false, 815#(<= 1 |ldv_positive_#res|)] [2018-02-04 03:19:29,551 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:19:29,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:19:29,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:19:29,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:19:29,552 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-02-04 03:19:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:29,723 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-04 03:19:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:19:29,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-04 03:19:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:29,724 INFO L225 Difference]: With dead ends: 84 [2018-02-04 03:19:29,724 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 03:19:29,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:19:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 03:19:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 03:19:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 03:19:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 03:19:29,729 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-02-04 03:19:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:29,730 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 03:19:29,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:19:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 03:19:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:19:29,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:29,731 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:29,731 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:29,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-02-04 03:19:29,732 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:29,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:29,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:29,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:19:29,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:29,970 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:19:29,971 INFO L182 omatonBuilderFactory]: Interpolants [1008#(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))), 1009#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 1010#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1011#(and (<= (+ (* 4 entry_point_~i~2) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1001#true, 1002#false, 1003#(<= entry_point_~len~0 16777215), 1004#(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))), 1005#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 4294967296) |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (= 0 |ldv_malloc_#t~malloc2.offset|))), 1006#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 4294967296) |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1007#(or (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|)))] [2018-02-04 03:19:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:29,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:19:29,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:19:29,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:19:29,972 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 11 states. [2018-02-04 03:19:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:30,276 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-04 03:19:30,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:19:30,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-04 03:19:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:30,277 INFO L225 Difference]: With dead ends: 83 [2018-02-04 03:19:30,278 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 03:19:30,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:19:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 03:19:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 03:19:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 03:19:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 03:19:30,282 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-02-04 03:19:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:30,283 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 03:19:30,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:19:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 03:19:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:19:30,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:30,285 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:30,285 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-02-04 03:19:30,287 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:30,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:30,347 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:19:30,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:30,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:19:30,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:30,347 INFO L182 omatonBuilderFactory]: Interpolants [1190#true, 1191#false, 1192#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1193#(and (= 0 |alloc_17_#t~ret4.offset|) (= 0 |alloc_17_#t~ret4.base|)), 1194#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-04 03:19:30,347 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:19:30,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:19:30,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:19:30,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:19:30,348 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-02-04 03:19:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:30,357 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-04 03:19:30,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:19:30,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-04 03:19:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:30,358 INFO L225 Difference]: With dead ends: 85 [2018-02-04 03:19:30,359 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 03:19:30,359 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:19:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 03:19:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-04 03:19:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 03:19:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 03:19:30,363 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-04 03:19:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:30,363 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 03:19:30,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:19:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 03:19:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:19:30,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:30,368 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:30,368 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:30,368 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-02-04 03:19:30,369 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:30,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:30,428 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:19:30,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:30,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:19:30,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:30,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:19:30,429 INFO L182 omatonBuilderFactory]: Interpolants [1363#true, 1364#false, 1365#(= 1 (select |#valid| entry_point_~array~0.base)), 1366#(= |#valid| |old(#valid)|), 1367#(= 1 (select |#valid| |free_17_#in~array.base|)), 1368#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:19:30,429 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:19:30,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:19:30,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:19:30,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:19:30,430 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-02-04 03:19:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:30,569 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-04 03:19:30,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:19:30,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-04 03:19:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:30,571 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:19:30,571 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:19:30,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:19:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:19:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-02-04 03:19:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:19:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 03:19:30,575 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-02-04 03:19:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:30,576 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 03:19:30,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:19:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 03:19:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:19:30,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:30,577 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:30,577 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:30,577 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-02-04 03:19:30,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:30,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:30,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:30,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:19:30,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:30,623 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:19:30,624 INFO L182 omatonBuilderFactory]: Interpolants [1609#true, 1610#false, 1611#(<= 1 |ldv_positive_#res|), 1612#(<= 1 |entry_point_#t~ret11|), 1613#(<= 1 entry_point_~len~0), 1614#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 1615#(<= |alloc_17_#in~len| 0)] [2018-02-04 03:19:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:30,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:19:30,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:19:30,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:19:30,624 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states. [2018-02-04 03:19:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:30,663 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-04 03:19:30,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:19:30,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 03:19:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:30,665 INFO L225 Difference]: With dead ends: 133 [2018-02-04 03:19:30,665 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 03:19:30,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:19:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 03:19:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2018-02-04 03:19:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 03:19:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-04 03:19:30,670 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41 [2018-02-04 03:19:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:30,670 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-04 03:19:30,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:19:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-04 03:19:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:19:30,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:30,671 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:30,672 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:30,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-02-04 03:19:30,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:30,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:30,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:30,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:19:30,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:30,767 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:19:30,767 INFO L182 omatonBuilderFactory]: Interpolants [1858#true, 1859#false, 1860#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 1861#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1862#(= 1 (select |#valid| |entry_point_#t~ret12.base|)), 1863#(= 1 (select |#valid| entry_point_~array~0.base)), 1864#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 1865#(= 1 (select |#valid| alloc_17_~array.base)), 1866#(= |#valid| |old(#valid)|), 1867#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 1868#(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:19:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:30,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:19:30,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:19:30,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:19:30,768 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 11 states. [2018-02-04 03:19:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:31,011 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-02-04 03:19:31,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:19:31,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 03:19:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:31,013 INFO L225 Difference]: With dead ends: 153 [2018-02-04 03:19:31,013 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 03:19:31,014 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:19:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 03:19:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 112. [2018-02-04 03:19:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:19:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2018-02-04 03:19:31,020 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 42 [2018-02-04 03:19:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:31,020 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2018-02-04 03:19:31,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:19:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2018-02-04 03:19:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:19:31,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:31,021 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:31,021 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386837, now seen corresponding path program 1 times [2018-02-04 03:19:31,022 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:31,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:31,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:31,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:19:31,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:31,161 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:19:31,162 INFO L182 omatonBuilderFactory]: Interpolants [2148#true, 2149#false, 2150#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 2151#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 2152#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 2153#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 2154#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1) (<= 4 (select |#length| entry_point_~array~0.base))), 2155#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (<= 4 (select |#length| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 2156#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 4 (select |#length| alloc_17_~array.base))), 2157#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2158#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 2159#(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|))))), 2160#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 4 (select |#length| alloc_17_~array.base)))] [2018-02-04 03:19:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:31,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:19:31,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:19:31,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:31,163 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 13 states. [2018-02-04 03:19:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:31,581 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2018-02-04 03:19:31,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:19:31,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-02-04 03:19:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:31,582 INFO L225 Difference]: With dead ends: 186 [2018-02-04 03:19:31,582 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 03:19:31,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:19:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 03:19:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 116. [2018-02-04 03:19:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:19:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-02-04 03:19:31,586 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 42 [2018-02-04 03:19:31,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:31,586 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-02-04 03:19:31,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:19:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-02-04 03:19:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:19:31,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:31,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:31,587 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:31,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1548167688, now seen corresponding path program 1 times [2018-02-04 03:19:31,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:31,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:31,636 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:19:31,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:31,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:19:31,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:31,637 INFO L182 omatonBuilderFactory]: Interpolants [2481#true, 2482#false, 2483#(= alloc_17_~i~0 0), 2484#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-04 03:19:31,637 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:19:31,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:19:31,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:19:31,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:19:31,637 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 4 states. [2018-02-04 03:19:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:31,668 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-04 03:19:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:19:31,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-04 03:19:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:31,669 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:19:31,669 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:19:31,669 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:19:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:19:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2018-02-04 03:19:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 03:19:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-02-04 03:19:31,673 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 43 [2018-02-04 03:19:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:31,675 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-02-04 03:19:31,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:19:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2018-02-04 03:19:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:19:31,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:31,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:31,676 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1943737008, now seen corresponding path program 1 times [2018-02-04 03:19:31,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:31,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:31,774 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:19:31,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:31,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:19:31,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:31,775 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:19:31,775 INFO L182 omatonBuilderFactory]: Interpolants [2736#(= 0 entry_point_~array~0.offset), 2737#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 2738#(= |old(#length)| |#length|), 2739#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 2740#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 2731#true, 2732#false, 2733#(= 0 |ldv_malloc_#t~malloc2.offset|), 2734#(= 0 |ldv_malloc_#res.offset|), 2735#(= 0 |entry_point_#t~ret12.offset|)] [2018-02-04 03:19:31,775 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:19:31,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:19:31,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:19:31,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:19:31,776 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 10 states. [2018-02-04 03:19:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:31,929 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2018-02-04 03:19:31,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:19:31,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-02-04 03:19:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:31,930 INFO L225 Difference]: With dead ends: 140 [2018-02-04 03:19:31,931 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 03:19:31,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:19:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 03:19:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2018-02-04 03:19:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 03:19:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2018-02-04 03:19:31,934 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 51 [2018-02-04 03:19:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:31,934 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2018-02-04 03:19:31,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:19:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-02-04 03:19:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:19:31,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:31,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:31,935 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 126305131, now seen corresponding path program 1 times [2018-02-04 03:19:31,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:31,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:32,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:32,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:19:32,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:32,075 INFO L182 omatonBuilderFactory]: Interpolants [3014#true, 3015#false, 3016#(= 0 |ldv_malloc_#t~malloc2.offset|), 3017#(= 0 |ldv_malloc_#res.offset|), 3018#(= 0 |entry_point_#t~ret12.offset|), 3019#(= entry_point_~array~0.offset 0), 3020#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 3021#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~i~2 0)), 3022#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 3023#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 3024#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 3025#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 3026#(= 0 |free_17_#t~mem10.offset|)] [2018-02-04 03:19:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:32,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:19:32,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:19:32,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:32,075 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 13 states. [2018-02-04 03:19:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:32,325 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-02-04 03:19:32,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:19:32,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-04 03:19:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:32,326 INFO L225 Difference]: With dead ends: 164 [2018-02-04 03:19:32,326 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 03:19:32,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:19:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 03:19:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-02-04 03:19:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 03:19:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2018-02-04 03:19:32,332 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 52 [2018-02-04 03:19:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:32,332 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2018-02-04 03:19:32,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:19:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2018-02-04 03:19:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:19:32,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:32,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:32,334 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:32,334 INFO L82 PathProgramCache]: Analyzing trace with hash 126305132, now seen corresponding path program 1 times [2018-02-04 03:19:32,335 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:32,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:32,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:32,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:19:32,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:32,529 INFO L182 omatonBuilderFactory]: Interpolants [3360#true, 3361#false, 3362#(= 0 |ldv_malloc_#t~malloc2.offset|), 3363#(= 0 |ldv_malloc_#res.offset|), 3364#(= 0 |entry_point_#t~ret12.offset|), 3365#(= entry_point_~array~0.offset 0), 3366#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 3367#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 3368#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 3369#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 3370#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 3371#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 3372#(= 0 |free_17_#t~mem10.base|)] [2018-02-04 03:19:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:32,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:19:32,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:19:32,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:32,530 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand 13 states. [2018-02-04 03:19:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:32,837 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2018-02-04 03:19:32,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:19:32,837 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-02-04 03:19:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:32,838 INFO L225 Difference]: With dead ends: 163 [2018-02-04 03:19:32,838 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 03:19:32,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:19:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 03:19:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2018-02-04 03:19:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 03:19:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2018-02-04 03:19:32,841 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 52 [2018-02-04 03:19:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:32,842 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2018-02-04 03:19:32,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:19:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-02-04 03:19:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 03:19:32,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:32,842 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:32,842 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:32,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2101833613, now seen corresponding path program 1 times [2018-02-04 03:19:32,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:32,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:32,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:32,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:19:32,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:32,866 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:19:32,867 INFO L182 omatonBuilderFactory]: Interpolants [3701#true, 3702#false, 3703#(not (= |ldv_malloc_#t~malloc2.base| 0)), 3704#(not (= |ldv_malloc_#res.base| 0)), 3705#(not (= |alloc_17_#t~ret4.base| 0)), 3706#(not (= alloc_17_~p~0.base 0))] [2018-02-04 03:19:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:32,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:19:32,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:19:32,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:19:32,867 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 6 states. [2018-02-04 03:19:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:32,886 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-04 03:19:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:19:32,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-02-04 03:19:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:32,887 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:19:32,887 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:19:32,887 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:19:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:19:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-04 03:19:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 03:19:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2018-02-04 03:19:32,890 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 53 [2018-02-04 03:19:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:32,890 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2018-02-04 03:19:32,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:19:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2018-02-04 03:19:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 03:19:32,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:32,890 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:32,890 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:32,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243012, now seen corresponding path program 1 times [2018-02-04 03:19:32,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:32,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 03:19:32,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:32,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:19:32,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:32,924 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:19:32,925 INFO L182 omatonBuilderFactory]: Interpolants [3959#true, 3960#false, 3961#(= alloc_17_~array.base |alloc_17_#in~array.base|), 3962#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 3963#(= 1 (select |#valid| entry_point_~array~0.base)), 3964#(= 1 (select |#valid| |free_17_#in~array.base|)), 3965#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:19:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 03:19:32,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:19:32,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:19:32,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:19:32,925 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand 7 states. [2018-02-04 03:19:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:33,025 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2018-02-04 03:19:33,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:19:33,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-02-04 03:19:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:33,026 INFO L225 Difference]: With dead ends: 142 [2018-02-04 03:19:33,026 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 03:19:33,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:19:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 03:19:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-04 03:19:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 03:19:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-02-04 03:19:33,030 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 54 [2018-02-04 03:19:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:33,030 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-02-04 03:19:33,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:19:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-02-04 03:19:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 03:19:33,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:33,031 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:33,031 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243011, now seen corresponding path program 1 times [2018-02-04 03:19:33,032 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:33,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:33,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:33,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:19:33,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:33,177 INFO L182 omatonBuilderFactory]: Interpolants [4241#true, 4242#false, 4243#(= 0 |ldv_malloc_#t~malloc2.offset|), 4244#(= 0 |ldv_malloc_#res.offset|), 4245#(= 0 |entry_point_#t~ret12.offset|), 4246#(= 0 entry_point_~array~0.offset), 4247#(and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 4248#(or (and (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| |alloc_17_#in~array.base|)) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0))), 4249#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= (* 4 alloc_17_~i~0) (select |#length| |alloc_17_#in~array.base|)))), 4250#(or (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 4251#(and (= 0 entry_point_~array~0.offset) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base))), 4252#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 4253#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 4254#(and (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-04 03:19:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:33,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:19:33,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:19:33,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:19:33,178 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 14 states. [2018-02-04 03:19:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:33,418 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2018-02-04 03:19:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:19:33,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-02-04 03:19:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:33,419 INFO L225 Difference]: With dead ends: 161 [2018-02-04 03:19:33,419 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 03:19:33,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:19:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 03:19:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-02-04 03:19:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 03:19:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-02-04 03:19:33,424 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 54 [2018-02-04 03:19:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:33,424 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-02-04 03:19:33,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:19:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-02-04 03:19:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:19:33,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:33,425 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:33,425 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762242, now seen corresponding path program 1 times [2018-02-04 03:19:33,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:33,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:19:33,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:33,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:19:33,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:33,910 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:19:33,910 INFO L182 omatonBuilderFactory]: Interpolants [4576#false, 4577#(= 0 |ldv_malloc_#t~malloc2.offset|), 4578#(= 0 |ldv_malloc_#res.offset|), 4579#(= 0 |entry_point_#t~ret12.offset|), 4580#(= 0 entry_point_~array~0.offset), 4581#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 4582#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 4583#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 4584#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (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))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 4585#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (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))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 4586#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 4587#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (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 (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 4588#(or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 4589#(or (<= 2 |alloc_17_#in~len|) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 4590#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 4591#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 4592#(and (or (and (or (<= free_17_~len 1) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))))), 4593#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (and (<= free_17_~i~1 0) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 4594#(= 0 |free_17_#t~mem10.offset|), 4575#true] [2018-02-04 03:19:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:19:33,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:19:33,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:19:33,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:19:33,911 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 20 states. [2018-02-04 03:19:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:34,230 INFO L93 Difference]: Finished difference Result 259 states and 317 transitions. [2018-02-04 03:19:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:19:34,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-04 03:19:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:34,232 INFO L225 Difference]: With dead ends: 259 [2018-02-04 03:19:34,232 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 03:19:34,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:19:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 03:19:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 219. [2018-02-04 03:19:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 03:19:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 281 transitions. [2018-02-04 03:19:34,240 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 281 transitions. Word has length 55 [2018-02-04 03:19:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:34,240 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 281 transitions. [2018-02-04 03:19:34,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:19:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 281 transitions. [2018-02-04 03:19:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:19:34,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:34,242 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:34,242 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762241, now seen corresponding path program 1 times [2018-02-04 03:19:34,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:34,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:34,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:34,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:19:34,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:34,702 INFO L182 omatonBuilderFactory]: Interpolants [5088#false, 5089#(= 0 |ldv_malloc_#t~malloc2.offset|), 5090#(= 0 |ldv_malloc_#res.offset|), 5091#(= 0 |entry_point_#t~ret12.offset|), 5092#(= 0 entry_point_~array~0.offset), 5093#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 5094#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 5095#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 5096#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (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))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 5097#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (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))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 5098#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 5099#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 5100#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))))), 5101#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 5102#(or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 5103#(or (<= 2 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 5104#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= entry_point_~len~0 1)), 5105#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1)), 5106#(and (or (and (or (<= free_17_~len 1) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))))), 5107#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (and (<= free_17_~i~1 0) (= free_17_~array.offset 0)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 5108#(= 1 (select |#valid| |free_17_#t~mem10.base|)), 5087#true] [2018-02-04 03:19:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:34,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:19:34,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:19:34,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:19:34,703 INFO L87 Difference]: Start difference. First operand 219 states and 281 transitions. Second operand 22 states. [2018-02-04 03:19:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:35,038 INFO L93 Difference]: Finished difference Result 235 states and 304 transitions. [2018-02-04 03:19:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:19:35,038 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-02-04 03:19:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:35,039 INFO L225 Difference]: With dead ends: 235 [2018-02-04 03:19:35,039 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 03:19:35,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:19:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 03:19:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 202. [2018-02-04 03:19:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-04 03:19:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 257 transitions. [2018-02-04 03:19:35,045 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 257 transitions. Word has length 55 [2018-02-04 03:19:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:35,045 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 257 transitions. [2018-02-04 03:19:35,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:19:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2018-02-04 03:19:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 03:19:35,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:35,046 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:35,047 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:35,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2041198635, now seen corresponding path program 2 times [2018-02-04 03:19:35,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:35,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:35,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:35,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:19:35,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:35,148 INFO L182 omatonBuilderFactory]: Interpolants [5568#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 5569#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 5570#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 5571#(<= |alloc_17_#in~len| 1), 5560#true, 5561#false, 5562#(= 0 |ldv_malloc_#t~malloc2.offset|), 5563#(= 0 |ldv_malloc_#res.offset|), 5564#(= 0 |entry_point_#t~ret12.offset|), 5565#(= entry_point_~array~0.offset 0), 5566#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 5567#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-04 03:19:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:35,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:19:35,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:19:35,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:19:35,148 INFO L87 Difference]: Start difference. First operand 202 states and 257 transitions. Second operand 12 states. [2018-02-04 03:19:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:35,295 INFO L93 Difference]: Finished difference Result 225 states and 282 transitions. [2018-02-04 03:19:35,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:19:35,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-02-04 03:19:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:35,297 INFO L225 Difference]: With dead ends: 225 [2018-02-04 03:19:35,297 INFO L226 Difference]: Without dead ends: 225 [2018-02-04 03:19:35,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:19:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-04 03:19:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 202. [2018-02-04 03:19:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-04 03:19:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 256 transitions. [2018-02-04 03:19:35,301 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 256 transitions. Word has length 59 [2018-02-04 03:19:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:35,302 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 256 transitions. [2018-02-04 03:19:35,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:19:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 256 transitions. [2018-02-04 03:19:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:19:35,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:35,302 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:35,302 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2012095048, now seen corresponding path program 1 times [2018-02-04 03:19:35,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:35,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:19:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:35,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:35,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:19:35,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:35,422 INFO L182 omatonBuilderFactory]: Interpolants [6016#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4))), 6017#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))), 6005#true, 6006#false, 6007#(= 0 |ldv_malloc_#t~malloc2.offset|), 6008#(= 0 |ldv_malloc_#res.offset|), 6009#(= 0 |entry_point_#t~ret12.offset|), 6010#(= 0 entry_point_~array~0.offset), 6011#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 6012#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 6013#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 6014#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 1)), 6015#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 1))] [2018-02-04 03:19:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:19:35,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:19:35,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:19:35,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:35,422 INFO L87 Difference]: Start difference. First operand 202 states and 256 transitions. Second operand 13 states. [2018-02-04 03:19:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:35,528 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2018-02-04 03:19:35,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:19:35,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-02-04 03:19:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:35,530 INFO L225 Difference]: With dead ends: 207 [2018-02-04 03:19:35,530 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 03:19:35,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:19:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 03:19:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 174. [2018-02-04 03:19:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 03:19:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-02-04 03:19:35,534 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 55 [2018-02-04 03:19:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:35,535 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-02-04 03:19:35,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:19:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-02-04 03:19:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:19:35,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:35,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:35,536 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1345976352, now seen corresponding path program 1 times [2018-02-04 03:19:35,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:35,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:35,580 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:19:35,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:19:35,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:19:35,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:35,581 INFO L182 omatonBuilderFactory]: Interpolants [6407#true, 6408#false, 6409#(<= 1 |ldv_positive_#res|), 6410#(<= 1 |entry_point_#t~ret11|), 6411#(<= 1 entry_point_~len~0), 6412#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 6413#(<= |free_17_#in~len| 0)] [2018-02-04 03:19:35,581 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:19:35,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:19:35,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:19:35,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:19:35,582 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 7 states. [2018-02-04 03:19:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:35,612 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2018-02-04 03:19:35,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:19:35,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-02-04 03:19:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:35,613 INFO L225 Difference]: With dead ends: 186 [2018-02-04 03:19:35,613 INFO L226 Difference]: Without dead ends: 178 [2018-02-04 03:19:35,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:19:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-04 03:19:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2018-02-04 03:19:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:19:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 189 transitions. [2018-02-04 03:19:35,618 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 189 transitions. Word has length 56 [2018-02-04 03:19:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:35,618 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 189 transitions. [2018-02-04 03:19:35,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:19:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2018-02-04 03:19:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 03:19:35,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:35,619 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:35,619 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1550179515, now seen corresponding path program 1 times [2018-02-04 03:19:35,620 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:35,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:35,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:35,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:19:35,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:35,725 INFO L182 omatonBuilderFactory]: Interpolants [6767#true, 6768#false, 6769#(= 0 |ldv_malloc_#t~malloc2.offset|), 6770#(= 0 |ldv_malloc_#res.offset|), 6771#(= 0 |entry_point_#t~ret12.offset|), 6772#(= 0 entry_point_~array~0.offset), 6773#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 6774#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 6775#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 6776#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 1)), 6777#(and (<= free_17_~len 1) (= free_17_~array.offset 0)), 6778#(<= free_17_~len (+ free_17_~i~1 1)), 6779#(<= free_17_~len free_17_~i~1)] [2018-02-04 03:19:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:35,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:19:35,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:19:35,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:35,726 INFO L87 Difference]: Start difference. First operand 165 states and 189 transitions. Second operand 13 states. [2018-02-04 03:19:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:35,817 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2018-02-04 03:19:35,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:19:35,817 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-04 03:19:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:35,818 INFO L225 Difference]: With dead ends: 184 [2018-02-04 03:19:35,818 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 03:19:35,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:19:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 03:19:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2018-02-04 03:19:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 03:19:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 202 transitions. [2018-02-04 03:19:35,823 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 202 transitions. Word has length 57 [2018-02-04 03:19:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:35,823 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 202 transitions. [2018-02-04 03:19:35,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:19:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 202 transitions. [2018-02-04 03:19:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 03:19:35,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:35,824 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:35,824 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:35,824 INFO L82 PathProgramCache]: Analyzing trace with hash 631093502, now seen corresponding path program 1 times [2018-02-04 03:19:35,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:35,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:36,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:36,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:19:36,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:36,284 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:19:36,284 INFO L182 omatonBuilderFactory]: Interpolants [7151#true, 7152#false, 7153#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 7154#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 7155#(or (and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))) (<= 2 entry_point_~len~0)), 7156#(or (<= 2 entry_point_~len~0) (and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0))), 7157#(or (and (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 1)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (not (= entry_point_~array~0.base 0))) (= entry_point_~array~0.offset 0)) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7158#(or (and (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (not (= entry_point_~array~0.base 0))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 0)) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7159#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))) (and (<= 2 entry_point_~len~0) (= entry_point_~i~2 0))), 7160#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 7161#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 7162#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7163#(= |#valid| |old(#valid)|), 7164#(and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (or (and (not (= free_17_~array.offset 0)) (= |free_17_#in~array.offset| free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0))), 7165#(or (and (= |#valid| |old(#valid)|) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|))) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 7166#(or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))), 7167#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:19:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:36,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:19:36,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:19:36,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:19:36,285 INFO L87 Difference]: Start difference. First operand 178 states and 202 transitions. Second operand 17 states. [2018-02-04 03:19:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:36,799 INFO L93 Difference]: Finished difference Result 218 states and 257 transitions. [2018-02-04 03:19:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:19:36,799 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-02-04 03:19:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:36,800 INFO L225 Difference]: With dead ends: 218 [2018-02-04 03:19:36,800 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 03:19:36,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 03:19:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 183. [2018-02-04 03:19:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 03:19:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-02-04 03:19:36,805 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 59 [2018-02-04 03:19:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:36,805 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-02-04 03:19:36,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:19:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-02-04 03:19:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 03:19:36,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:36,806 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 03:19:36,806 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1742435855, now seen corresponding path program 2 times [2018-02-04 03:19:36,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:36,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:19:37,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:37,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:19:37,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:37,158 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:19:37,158 INFO L182 omatonBuilderFactory]: Interpolants [7587#true, 7588#false, 7589#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 7590#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7591#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 7592#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7593#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7594#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7595#(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)), 7596#(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|)), 7597#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7598#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7599#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 7600#(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|))))), 7601#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7602#(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)), 7603#(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)), 7604#(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)), 7605#(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:19:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:19:37,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:19:37,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:19:37,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:19:37,159 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 19 states. [2018-02-04 03:19:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:37,837 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2018-02-04 03:19:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:19:37,838 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-02-04 03:19:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:37,838 INFO L225 Difference]: With dead ends: 219 [2018-02-04 03:19:37,838 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 03:19:37,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 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:19:37,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 03:19:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 182. [2018-02-04 03:19:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 03:19:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2018-02-04 03:19:37,843 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 59 [2018-02-04 03:19:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:37,843 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2018-02-04 03:19:37,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:19:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2018-02-04 03:19:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 03:19:37,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:37,844 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:37,844 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash -805582722, now seen corresponding path program 1 times [2018-02-04 03:19:37,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:37,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 03:19:37,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:37,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:19:37,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:37,960 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:19:37,960 INFO L182 omatonBuilderFactory]: Interpolants [8039#true, 8040#false, 8041#(= 0 |ldv_malloc_#t~malloc2.offset|), 8042#(= 0 |ldv_malloc_#res.offset|), 8043#(= 0 |entry_point_#t~ret12.offset|), 8044#(= 0 entry_point_~array~0.offset), 8045#(= 0 |alloc_17_#in~array.offset|), 8046#(= alloc_17_~array.offset 0), 8047#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))), 8048#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8049#(= |old(#length)| |#length|), 8050#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8051#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (<= 0 alloc_17_~j~0) (= alloc_17_~array.offset 0))] [2018-02-04 03:19:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 03:19:37,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:19:37,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:19:37,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:37,961 INFO L87 Difference]: Start difference. First operand 182 states and 207 transitions. Second operand 13 states. [2018-02-04 03:19:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:38,198 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-02-04 03:19:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:19:38,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-02-04 03:19:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:38,199 INFO L225 Difference]: With dead ends: 180 [2018-02-04 03:19:38,199 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 03:19:38,199 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:19:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 03:19:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-02-04 03:19:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 03:19:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 205 transitions. [2018-02-04 03:19:38,203 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 205 transitions. Word has length 60 [2018-02-04 03:19:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:38,203 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 205 transitions. [2018-02-04 03:19:38,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:19:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2018-02-04 03:19:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:19:38,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:38,204 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:38,204 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash 796739391, now seen corresponding path program 1 times [2018-02-04 03:19:38,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:38,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:19:38,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:38,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:19:38,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:19:38,600 INFO L182 omatonBuilderFactory]: Interpolants [8448#(and (= alloc_17_~array.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 8449#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))), 8450#(= 0 |alloc_17_#t~mem7.offset|), 8431#true, 8432#false, 8433#(= 0 |ldv_malloc_#t~malloc2.offset|), 8434#(= 0 |ldv_malloc_#res.offset|), 8435#(= 0 |entry_point_#t~ret12.offset|), 8436#(= 0 entry_point_~array~0.offset), 8437#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 8438#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 8439#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 8440#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 8441#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 8442#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (<= alloc_17_~len 2) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8443#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (= 0 |alloc_17_#t~ret4.offset|) (<= alloc_17_~len 2)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8444#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~len 2) (= 0 alloc_17_~p~0.offset)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8445#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8446#(and (= alloc_17_~array.offset 0) (or (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3)) (and (<= alloc_17_~len 2) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))))), 8447#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)))] [2018-02-04 03:19:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:19:38,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:19:38,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:19:38,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:19:38,602 INFO L87 Difference]: Start difference. First operand 180 states and 205 transitions. Second operand 20 states. [2018-02-04 03:19:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:39,105 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-02-04 03:19:39,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:19:39,309 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-02-04 03:19:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:39,309 INFO L225 Difference]: With dead ends: 251 [2018-02-04 03:19:39,310 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 03:19:39,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:19:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 03:19:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-02-04 03:19:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 03:19:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 266 transitions. [2018-02-04 03:19:39,313 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 266 transitions. Word has length 61 [2018-02-04 03:19:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:39,313 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 266 transitions. [2018-02-04 03:19:39,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:19:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 266 transitions. [2018-02-04 03:19:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:19:39,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:39,314 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:39,314 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash 796739392, now seen corresponding path program 1 times [2018-02-04 03:19:39,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:39,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:39,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:39,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:19:39,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:39,777 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:19:39,777 INFO L182 omatonBuilderFactory]: Interpolants [8962#true, 8963#false, 8964#(= 0 |ldv_malloc_#t~malloc2.offset|), 8965#(= 0 |ldv_malloc_#res.offset|), 8966#(= 0 |entry_point_#t~ret12.offset|), 8967#(= 0 entry_point_~array~0.offset), 8968#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 8969#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 8970#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 8971#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 8972#(and (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 8973#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (= alloc_17_~array.offset 0) (or (<= alloc_17_~len 2) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 8974#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 8975#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 8976#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (<= alloc_17_~len 2) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8977#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (<= alloc_17_~len 2)) (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (<= alloc_17_~len 2)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.offset 0)), 8978#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0) (or (= 1 (select |#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))) (<= alloc_17_~len 2)), 8979#(and (or (and (<= alloc_17_~len 2) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3))) (= alloc_17_~array.offset 0)), 8980#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 8981#(= |#valid| |old(#valid)|), 8982#(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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))) (<= alloc_17_~j~0 0)), 8983#(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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))), 8984#(= 1 (select |#valid| |alloc_17_#t~mem7.base|))] [2018-02-04 03:19:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:39,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:19:39,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:19:39,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:19:39,778 INFO L87 Difference]: Start difference. First operand 231 states and 266 transitions. Second operand 23 states. [2018-02-04 03:19:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:40,599 INFO L93 Difference]: Finished difference Result 260 states and 299 transitions. [2018-02-04 03:19:40,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:19:40,599 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-02-04 03:19:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:40,600 INFO L225 Difference]: With dead ends: 260 [2018-02-04 03:19:40,600 INFO L226 Difference]: Without dead ends: 260 [2018-02-04 03:19:40,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=1587, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:19:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-04 03:19:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 233. [2018-02-04 03:19:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 03:19:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2018-02-04 03:19:40,605 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 61 [2018-02-04 03:19:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:40,605 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2018-02-04 03:19:40,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:19:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2018-02-04 03:19:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:19:40,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:40,606 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:40,606 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:40,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1218510372, now seen corresponding path program 2 times [2018-02-04 03:19:40,607 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:40,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:40,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:40,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:19:40,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:40,910 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:19:40,911 INFO L182 omatonBuilderFactory]: Interpolants [9518#true, 9519#false, 9520#(= 0 |ldv_malloc_#t~malloc2.offset|), 9521#(= 0 |ldv_malloc_#res.offset|), 9522#(= 0 |entry_point_#t~ret12.offset|), 9523#(= 0 entry_point_~array~0.offset), 9524#(and (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 entry_point_~array~0.offset)), 9525#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 entry_point_~array~0.offset)), 9526#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 9527#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (< 1 entry_point_~i~2)), 9528#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 9529#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9530#(= |#valid| |old(#valid)|), 9531#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 9532#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 1 (select |#valid| free_17_~array.base))), 9533#(and (= 1 (select |#valid| free_17_~array.base)) (= 0 |free_17_#t~mem10.base|)), 9534#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:19:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:40,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:19:40,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:19:40,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:19:40,911 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand 17 states. [2018-02-04 03:19:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:41,295 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2018-02-04 03:19:41,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:19:41,295 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-02-04 03:19:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:41,296 INFO L225 Difference]: With dead ends: 263 [2018-02-04 03:19:41,296 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 03:19:41,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:19:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 03:19:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2018-02-04 03:19:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 03:19:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2018-02-04 03:19:41,303 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 61 [2018-02-04 03:19:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:41,303 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2018-02-04 03:19:41,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:19:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2018-02-04 03:19:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 03:19:41,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:41,304 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:41,304 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1218510371, now seen corresponding path program 1 times [2018-02-04 03:19:41,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:41,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:19:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:41,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:41,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:19:41,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:41,492 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:19:41,492 INFO L182 omatonBuilderFactory]: Interpolants [10063#true, 10064#false, 10065#(= 0 |ldv_malloc_#t~malloc2.offset|), 10066#(= 0 |ldv_malloc_#res.offset|), 10067#(= 0 |entry_point_#t~ret12.offset|), 10068#(= entry_point_~array~0.offset 0), 10069#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10070#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10071#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10072#(= |old(#length)| |#length|), 10073#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 10074#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10075#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 10076#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10077#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-04 03:19:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:41,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:19:41,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:19:41,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:19:41,493 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand 15 states. [2018-02-04 03:19:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:41,794 INFO L93 Difference]: Finished difference Result 258 states and 289 transitions. [2018-02-04 03:19:41,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:19:41,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-02-04 03:19:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:41,795 INFO L225 Difference]: With dead ends: 258 [2018-02-04 03:19:41,795 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 03:19:41,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:19:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 03:19:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-02-04 03:19:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 03:19:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 285 transitions. [2018-02-04 03:19:41,801 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 285 transitions. Word has length 61 [2018-02-04 03:19:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:41,801 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 285 transitions. [2018-02-04 03:19:41,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:19:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2018-02-04 03:19:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:19:41,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:41,802 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:41,802 INFO L371 AbstractCegarLoop]: === Iteration 32 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1523736181, now seen corresponding path program 1 times [2018-02-04 03:19:41,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:41,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:42,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:42,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:19:42,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:42,499 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:19:42,500 INFO L182 omatonBuilderFactory]: Interpolants [10624#(or (and (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= (select |#valid| |free_17_#in~array.base|) 0)) (= |#valid| |old(#valid)|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (<= 2 |free_17_#in~len|)), 10625#(= 1 (select |#valid| entry_point_~array~0.base)), 10601#true, 10602#false, 10603#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 10604#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 10605#(and (= 0 |entry_point_#t~ret12.offset|) (= 1 (select |#valid| |entry_point_#t~ret12.base|))), 10606#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 10607#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 10608#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 10609#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1)), 10610#(= |#valid| |old(#valid)|), 10611#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (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))) (= |#valid| |old(#valid)|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10612#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (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))) (= |#valid| |old(#valid)|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10613#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 10614#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10615#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10616#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (or (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 10617#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (and (<= 2 alloc_17_~len) (= alloc_17_~len |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 10618#(and (or (<= 2 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= 1 (select |#valid| |alloc_17_#in~array.base|))), 10619#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 10620#(and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))))), 10621#(and (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (<= (+ free_17_~i~1 1) free_17_~len)) (= free_17_~len |free_17_#in~len|))))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)), 10622#(and (or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (and (= |free_17_#t~mem10.base| |free_17_#in~array.base|) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|))) (= |#valid| |old(#valid)|)), 10623#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (and (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|) (= (select |#valid| |free_17_#in~array.base|) 0)) (= |#valid| |old(#valid)|) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)))] [2018-02-04 03:19:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:42,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:19:42,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:19:42,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:42,501 INFO L87 Difference]: Start difference. First operand 251 states and 285 transitions. Second operand 25 states. [2018-02-04 03:19:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:42,965 INFO L93 Difference]: Finished difference Result 306 states and 359 transitions. [2018-02-04 03:19:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:19:42,965 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-04 03:19:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:42,966 INFO L225 Difference]: With dead ends: 306 [2018-02-04 03:19:42,966 INFO L226 Difference]: Without dead ends: 306 [2018-02-04 03:19:42,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:19:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-04 03:19:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 236. [2018-02-04 03:19:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 03:19:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 270 transitions. [2018-02-04 03:19:42,972 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 270 transitions. Word has length 62 [2018-02-04 03:19:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:42,973 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 270 transitions. [2018-02-04 03:19:42,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:19:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 270 transitions. [2018-02-04 03:19:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:19:42,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:42,974 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:42,974 INFO L371 AbstractCegarLoop]: === Iteration 33 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1834734922, now seen corresponding path program 1 times [2018-02-04 03:19:42,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:42,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:43,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:43,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:19:43,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:43,426 INFO L182 omatonBuilderFactory]: Interpolants [11182#true, 11183#false, 11184#(= |#valid| |old(#valid)|), 11185#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 11186#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 11187#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret12.base| (select |#valid| |entry_point_#t~ret12.base|))) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0)), 11188#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11189#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 11190#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 11191#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 1) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11192#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (<= entry_point_~len~0 1) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 11193#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 11194#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))))), 11195#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (<= (+ free_17_~i~1 1) free_17_~len)) (= free_17_~len |free_17_#in~len|)))))), 11196#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 11197#(or (and (<= 2 free_17_~len) (= free_17_~len |free_17_#in~len|)) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 11198#(or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (<= 2 |free_17_#in~len|)), 11199#(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)))] [2018-02-04 03:19:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:43,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:19:43,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:19:43,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:19:43,427 INFO L87 Difference]: Start difference. First operand 236 states and 270 transitions. Second operand 18 states. [2018-02-04 03:19:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:43,802 INFO L93 Difference]: Finished difference Result 272 states and 317 transitions. [2018-02-04 03:19:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:19:43,802 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-04 03:19:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:43,803 INFO L225 Difference]: With dead ends: 272 [2018-02-04 03:19:43,804 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 03:19:43,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:19:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 03:19:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 230. [2018-02-04 03:19:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 03:19:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 263 transitions. [2018-02-04 03:19:43,807 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 263 transitions. Word has length 62 [2018-02-04 03:19:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:43,808 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 263 transitions. [2018-02-04 03:19:43,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:19:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 263 transitions. [2018-02-04 03:19:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:19:43,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:43,808 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:43,808 INFO L371 AbstractCegarLoop]: === Iteration 34 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 880884190, now seen corresponding path program 1 times [2018-02-04 03:19:43,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:43,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:44,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:44,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:19:44,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:44,002 INFO L182 omatonBuilderFactory]: Interpolants [11712#true, 11713#false, 11714#(= 0 |ldv_malloc_#t~malloc2.offset|), 11715#(= 0 |ldv_malloc_#res.offset|), 11716#(= 0 |entry_point_#t~ret12.offset|), 11717#(= entry_point_~array~0.offset 0), 11718#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 11719#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 11720#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 11721#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 11722#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 11723#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 11724#(and (= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 11725#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 11726#(= 0 |free_17_#t~mem10.offset|)] [2018-02-04 03:19:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:44,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:19:44,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:19:44,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:19:44,003 INFO L87 Difference]: Start difference. First operand 230 states and 263 transitions. Second operand 15 states. [2018-02-04 03:19:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:44,355 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2018-02-04 03:19:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:19:44,355 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-04 03:19:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:44,356 INFO L225 Difference]: With dead ends: 244 [2018-02-04 03:19:44,356 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 03:19:44,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:19:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 03:19:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-02-04 03:19:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 03:19:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2018-02-04 03:19:44,361 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 62 [2018-02-04 03:19:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:44,361 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2018-02-04 03:19:44,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:19:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2018-02-04 03:19:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 03:19:44,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:44,362 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:44,362 INFO L371 AbstractCegarLoop]: === Iteration 35 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash 880884191, now seen corresponding path program 1 times [2018-02-04 03:19:44,363 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:44,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:44,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:44,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:19:44,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:44,561 INFO L182 omatonBuilderFactory]: Interpolants [12229#true, 12230#false, 12231#(= 0 |ldv_malloc_#t~malloc2.offset|), 12232#(= 0 |ldv_malloc_#res.offset|), 12233#(= 0 |entry_point_#t~ret12.offset|), 12234#(= entry_point_~array~0.offset 0), 12235#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 12236#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 12237#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 12238#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 12239#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12240#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 12241#(and (= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))), 12242#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 12243#(= 0 |free_17_#t~mem10.base|)] [2018-02-04 03:19:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:44,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:19:44,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:19:44,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:19:44,562 INFO L87 Difference]: Start difference. First operand 231 states and 265 transitions. Second operand 15 states. [2018-02-04 03:19:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:44,903 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2018-02-04 03:19:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:19:44,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-04 03:19:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:44,904 INFO L225 Difference]: With dead ends: 243 [2018-02-04 03:19:44,904 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 03:19:44,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 03:19:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2018-02-04 03:19:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 03:19:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 264 transitions. [2018-02-04 03:19:44,908 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 264 transitions. Word has length 62 [2018-02-04 03:19:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:44,908 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 264 transitions. [2018-02-04 03:19:44,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:19:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 264 transitions. [2018-02-04 03:19:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 03:19:44,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:44,909 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:44,909 INFO L371 AbstractCegarLoop]: === Iteration 36 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1162377056, now seen corresponding path program 1 times [2018-02-04 03:19:44,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:44,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:45,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:45,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:19:45,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:45,331 INFO L182 omatonBuilderFactory]: Interpolants [12739#true, 12740#false, 12741#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 12742#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 12743#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 12744#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12745#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= entry_point_~i~2 0)), 12746#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12747#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12748#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 12749#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|) (<= |alloc_17_#in~len| 2)), 12750#(and (= alloc_17_~array.offset 0) (or (= (select |#valid| alloc_17_~array.base) 1) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (<= alloc_17_~len 2)), 12751#(= |#valid| |old(#valid)|), 12752#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 12753#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12754#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 12755#(and (= alloc_17_~array.offset 0) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base alloc_17_~p~0.base)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 12756#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 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_~i~0))))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (<= alloc_17_~len 2)), 12757#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~len 2) (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 3)))), 12758#(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)))), 12759#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))), 12760#(and (<= 0 alloc_17_~j~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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 0)), 12761#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 12762#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:19:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:45,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:19:45,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:19:45,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:19:45,332 INFO L87 Difference]: Start difference. First operand 231 states and 264 transitions. Second operand 24 states. [2018-02-04 03:19:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:46,053 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2018-02-04 03:19:46,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:19:46,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-02-04 03:19:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:46,054 INFO L225 Difference]: With dead ends: 253 [2018-02-04 03:19:46,054 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 03:19:46,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:19:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 03:19:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2018-02-04 03:19:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 03:19:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 266 transitions. [2018-02-04 03:19:46,057 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 266 transitions. Word has length 63 [2018-02-04 03:19:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:46,057 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 266 transitions. [2018-02-04 03:19:46,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:19:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 266 transitions. [2018-02-04 03:19:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 03:19:46,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:46,058 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:46,058 INFO L371 AbstractCegarLoop]: === Iteration 37 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash -115145315, now seen corresponding path program 1 times [2018-02-04 03:19:46,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:46,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:46,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:46,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:19:46,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:19:46,642 INFO L182 omatonBuilderFactory]: Interpolants [13287#true, 13288#false, 13289#(= |#valid| |old(#valid)|), 13290#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 13291#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13292#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0) (= 1 (select |#valid| |entry_point_#t~ret12.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13293#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 13294#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 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))))), 13295#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 13296#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0))), 13297#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (not (= |alloc_17_#t~ret4.base| 0)) (= (store |old(#valid)| |alloc_17_#t~ret4.base| (select |#valid| |alloc_17_#t~ret4.base|)) |#valid|) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= (select |old(#valid)| |alloc_17_#t~ret4.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 13298#(and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (and (not (= alloc_17_~p~0.base 0)) (= |#valid| (store |old(#valid)| alloc_17_~p~0.base (select |#valid| alloc_17_~p~0.base))) (= (select |old(#valid)| alloc_17_~p~0.base) 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 13299#(or (and (= alloc_17_~i~0 0) (not (= |alloc_17_#in~array.offset| 0))) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 0) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 1))), 13300#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 0) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) 1))), 13301#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 13302#(and (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (or (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= free_17_~array.offset 0)) (= |free_17_#in~array.offset| free_17_~array.offset)))), 13303#(or (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 13304#(or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (not (= |free_17_#in~array.offset| 0)) (and (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))))), 13305#(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)))] [2018-02-04 03:19:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:19:46,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:19:46,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:19:46,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:19:46,643 INFO L87 Difference]: Start difference. First operand 233 states and 266 transitions. Second operand 19 states. [2018-02-04 03:19:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:47,351 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2018-02-04 03:19:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:19:47,351 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-02-04 03:19:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:47,352 INFO L225 Difference]: With dead ends: 292 [2018-02-04 03:19:47,352 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 03:19:47,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 03:19:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 235. [2018-02-04 03:19:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-04 03:19:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 280 transitions. [2018-02-04 03:19:47,355 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 280 transitions. Word has length 65 [2018-02-04 03:19:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:47,355 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 280 transitions. [2018-02-04 03:19:47,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:19:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 280 transitions. [2018-02-04 03:19:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 03:19:47,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:47,356 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:47,356 INFO L371 AbstractCegarLoop]: === Iteration 38 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash 32703062, now seen corresponding path program 2 times [2018-02-04 03:19:47,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:47,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 03:19:47,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:47,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:19:47,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:19:47,588 INFO L182 omatonBuilderFactory]: Interpolants [13856#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 13857#(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)), 13858#(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))))), 13859#(= 0 |alloc_17_#t~mem7.offset|), 13845#true, 13846#false, 13847#(= 0 |ldv_malloc_#t~malloc2.offset|), 13848#(= 0 |ldv_malloc_#res.offset|), 13849#(= 0 |entry_point_#t~ret12.offset|), 13850#(= 0 entry_point_~array~0.offset), 13851#(= 0 |alloc_17_#in~array.offset|), 13852#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 13853#(and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 13854#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 13855#(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:19:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 03:19:47,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:19:47,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:19:47,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:19:47,589 INFO L87 Difference]: Start difference. First operand 235 states and 280 transitions. Second operand 15 states. [2018-02-04 03:19:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:47,840 INFO L93 Difference]: Finished difference Result 267 states and 316 transitions. [2018-02-04 03:19:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:19:47,840 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-02-04 03:19:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:47,840 INFO L225 Difference]: With dead ends: 267 [2018-02-04 03:19:47,840 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 03:19:47,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 03:19:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 242. [2018-02-04 03:19:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 03:19:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 290 transitions. [2018-02-04 03:19:47,843 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 290 transitions. Word has length 65 [2018-02-04 03:19:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:47,844 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 290 transitions. [2018-02-04 03:19:47,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:19:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 290 transitions. [2018-02-04 03:19:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 03:19:47,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:47,844 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:47,844 INFO L371 AbstractCegarLoop]: === Iteration 39 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:47,844 INFO L82 PathProgramCache]: Analyzing trace with hash 32703063, now seen corresponding path program 2 times [2018-02-04 03:19:47,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:47,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 03:19:48,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:48,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:19:48,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:48,092 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:19:48,093 INFO L182 omatonBuilderFactory]: Interpolants [14400#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 14401#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 14402#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))), 14403#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 14404#(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)))))), 14405#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 14406#(= |#valid| |old(#valid)|), 14407#(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)), 14408#(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)))))), 14409#(= 1 (select |#valid| |alloc_17_#t~mem7.base|)), 14392#true, 14393#false, 14394#(= 0 |ldv_malloc_#t~malloc2.offset|), 14395#(= 0 |ldv_malloc_#res.offset|), 14396#(= 0 |entry_point_#t~ret12.offset|), 14397#(= 0 entry_point_~array~0.offset), 14398#(= 0 |alloc_17_#in~array.offset|), 14399#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0))] [2018-02-04 03:19:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 03:19:48,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:19:48,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:19:48,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:19:48,093 INFO L87 Difference]: Start difference. First operand 242 states and 290 transitions. Second operand 18 states. [2018-02-04 03:19:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:48,496 INFO L93 Difference]: Finished difference Result 251 states and 297 transitions. [2018-02-04 03:19:48,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:19:48,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-02-04 03:19:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:48,497 INFO L225 Difference]: With dead ends: 251 [2018-02-04 03:19:48,497 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 03:19:48,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:19:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 03:19:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2018-02-04 03:19:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 03:19:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2018-02-04 03:19:48,500 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 65 [2018-02-04 03:19:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:48,500 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2018-02-04 03:19:48,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:19:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2018-02-04 03:19:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 03:19:48,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:48,501 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:48,501 INFO L371 AbstractCegarLoop]: === Iteration 40 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:48,501 INFO L82 PathProgramCache]: Analyzing trace with hash -375554797, now seen corresponding path program 2 times [2018-02-04 03:19:48,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:48,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:48,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:48,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:19:48,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:48,615 INFO L182 omatonBuilderFactory]: Interpolants [14931#true, 14932#false, 14933#(= 0 |ldv_malloc_#t~malloc2.offset|), 14934#(= 0 |ldv_malloc_#res.offset|), 14935#(= 0 |entry_point_#t~ret12.offset|), 14936#(= entry_point_~array~0.offset 0), 14937#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 14938#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 14939#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 14940#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 14941#(and (= free_17_~len |free_17_#in~len|) (<= free_17_~i~1 1)), 14942#(<= |free_17_#in~len| 1)] [2018-02-04 03:19:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:48,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:19:48,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:19:48,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:19:48,616 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand 12 states. [2018-02-04 03:19:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:48,680 INFO L93 Difference]: Finished difference Result 267 states and 313 transitions. [2018-02-04 03:19:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:19:48,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-02-04 03:19:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:48,681 INFO L225 Difference]: With dead ends: 267 [2018-02-04 03:19:48,681 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 03:19:48,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:19:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 03:19:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 229. [2018-02-04 03:19:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 03:19:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 271 transitions. [2018-02-04 03:19:48,683 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 271 transitions. Word has length 66 [2018-02-04 03:19:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:48,684 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 271 transitions. [2018-02-04 03:19:48,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:19:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 271 transitions. [2018-02-04 03:19:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 03:19:48,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:48,684 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:48,684 INFO L371 AbstractCegarLoop]: === Iteration 41 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:48,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1965154507, now seen corresponding path program 1 times [2018-02-04 03:19:48,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:48,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 03:19:48,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:48,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:19:48,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:19:48,719 INFO L182 omatonBuilderFactory]: Interpolants [15446#true, 15447#false, 15448#(= alloc_17_~array.base |alloc_17_#in~array.base|), 15449#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 15450#(= |#valid| |old(#valid)|), 15451#(= 1 (select |#valid| entry_point_~array~0.base)), 15452#(= 1 (select |#valid| |free_17_#in~array.base|)), 15453#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:19:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 03:19:48,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:19:48,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:19:48,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:19:48,720 INFO L87 Difference]: Start difference. First operand 229 states and 271 transitions. Second operand 8 states. [2018-02-04 03:19:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:48,851 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2018-02-04 03:19:48,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:19:48,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-02-04 03:19:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:48,852 INFO L225 Difference]: With dead ends: 232 [2018-02-04 03:19:48,852 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 03:19:48,852 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 03:19:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215. [2018-02-04 03:19:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 03:19:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2018-02-04 03:19:48,855 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 68 [2018-02-04 03:19:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:48,855 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2018-02-04 03:19:48,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:19:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2018-02-04 03:19:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 03:19:48,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:48,856 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:48,856 INFO L371 AbstractCegarLoop]: === Iteration 42 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:48,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1965154506, now seen corresponding path program 1 times [2018-02-04 03:19:48,857 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:48,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 03:19:48,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:48,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:19:48,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:48,952 INFO L182 omatonBuilderFactory]: Interpolants [15920#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 15921#(not (= |alloc_17_#in~array.offset| 0)), 15911#true, 15912#false, 15913#(= 0 |ldv_malloc_#t~malloc2.offset|), 15914#(= 0 |ldv_malloc_#res.offset|), 15915#(= 0 |entry_point_#t~ret12.offset|), 15916#(= 0 entry_point_~array~0.offset), 15917#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 15918#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 15919#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0))] [2018-02-04 03:19:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 03:19:48,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:19:48,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:19:48,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:19:48,953 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand 11 states. [2018-02-04 03:19:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:49,090 INFO L93 Difference]: Finished difference Result 223 states and 260 transitions. [2018-02-04 03:19:49,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:19:49,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-04 03:19:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:49,092 INFO L225 Difference]: With dead ends: 223 [2018-02-04 03:19:49,092 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 03:19:49,092 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:19:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 03:19:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-04 03:19:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 03:19:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 253 transitions. [2018-02-04 03:19:49,095 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 253 transitions. Word has length 68 [2018-02-04 03:19:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:49,096 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 253 transitions. [2018-02-04 03:19:49,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:19:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 253 transitions. [2018-02-04 03:19:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 03:19:49,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:49,096 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:49,096 INFO L371 AbstractCegarLoop]: === Iteration 43 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:49,097 INFO L82 PathProgramCache]: Analyzing trace with hash 916929714, now seen corresponding path program 3 times [2018-02-04 03:19:49,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:49,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:49,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:49,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:19:49,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:49,237 INFO L182 omatonBuilderFactory]: Interpolants [16384#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 16385#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0)), 16386#(<= free_17_~len (+ free_17_~i~1 1)), 16387#(<= free_17_~len free_17_~i~1), 16372#true, 16373#false, 16374#(= 0 |ldv_malloc_#t~malloc2.offset|), 16375#(= 0 |ldv_malloc_#res.offset|), 16376#(= 0 |entry_point_#t~ret12.offset|), 16377#(= 0 entry_point_~array~0.offset), 16378#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 16379#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 16380#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 16381#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 16382#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 2)), 16383#(and (<= free_17_~len 2) (= free_17_~array.offset 0))] [2018-02-04 03:19:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:49,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:19:49,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:19:49,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:19:49,238 INFO L87 Difference]: Start difference. First operand 217 states and 253 transitions. Second operand 16 states. [2018-02-04 03:19:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:49,330 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2018-02-04 03:19:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:19:49,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-02-04 03:19:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:49,331 INFO L225 Difference]: With dead ends: 287 [2018-02-04 03:19:49,331 INFO L226 Difference]: Without dead ends: 287 [2018-02-04 03:19:49,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:19:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-04 03:19:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2018-02-04 03:19:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 03:19:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 323 transitions. [2018-02-04 03:19:49,336 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 323 transitions. Word has length 67 [2018-02-04 03:19:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:49,336 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 323 transitions. [2018-02-04 03:19:49,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:19:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 323 transitions. [2018-02-04 03:19:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 03:19:49,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:49,337 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:49,337 INFO L371 AbstractCegarLoop]: === Iteration 44 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:49,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1362872503, now seen corresponding path program 2 times [2018-02-04 03:19:49,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:49,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 03:19:49,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:49,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:19:49,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:49,689 INFO L182 omatonBuilderFactory]: Interpolants [16960#true, 16961#false, 16962#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 16963#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 16964#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 16965#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 16966#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 16967#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 16968#(= |#valid| |old(#valid)|), 16969#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 16970#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 16971#(and (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 16972#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 16973#(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)))))), 16974#(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)))), 16975#(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)), 16976#(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))), 16977#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 16978#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-04 03:19:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-04 03:19:49,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:19:49,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:19:49,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:19:49,690 INFO L87 Difference]: Start difference. First operand 274 states and 323 transitions. Second operand 19 states. [2018-02-04 03:19:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:50,141 INFO L93 Difference]: Finished difference Result 289 states and 337 transitions. [2018-02-04 03:19:50,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:19:50,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-04 03:19:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:50,142 INFO L225 Difference]: With dead ends: 289 [2018-02-04 03:19:50,142 INFO L226 Difference]: Without dead ends: 289 [2018-02-04 03:19:50,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:19:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-04 03:19:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2018-02-04 03:19:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 03:19:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 325 transitions. [2018-02-04 03:19:50,147 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 325 transitions. Word has length 67 [2018-02-04 03:19:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:50,147 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 325 transitions. [2018-02-04 03:19:50,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:19:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 325 transitions. [2018-02-04 03:19:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 03:19:50,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:50,148 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:50,148 INFO L371 AbstractCegarLoop]: === Iteration 45 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2118087437, now seen corresponding path program 1 times [2018-02-04 03:19:50,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:50,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:19:50,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:50,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:19:50,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:19:50,182 INFO L182 omatonBuilderFactory]: Interpolants [17562#true, 17563#false, 17564#(= alloc_17_~i~0 0), 17565#(<= alloc_17_~i~0 1), 17566#(<= alloc_17_~j~0 0), 17567#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-04 03:19:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:19:50,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:19:50,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:19:50,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:19:50,182 INFO L87 Difference]: Start difference. First operand 276 states and 325 transitions. Second operand 6 states. [2018-02-04 03:19:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:50,238 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2018-02-04 03:19:50,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:19:50,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-02-04 03:19:50,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:50,239 INFO L225 Difference]: With dead ends: 299 [2018-02-04 03:19:50,239 INFO L226 Difference]: Without dead ends: 299 [2018-02-04 03:19:50,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:19:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-04 03:19:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 285. [2018-02-04 03:19:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 03:19:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 333 transitions. [2018-02-04 03:19:50,242 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 333 transitions. Word has length 68 [2018-02-04 03:19:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:50,242 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 333 transitions. [2018-02-04 03:19:50,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:19:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 333 transitions. [2018-02-04 03:19:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 03:19:50,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:50,242 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:50,242 INFO L371 AbstractCegarLoop]: === Iteration 46 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash 701115179, now seen corresponding path program 2 times [2018-02-04 03:19:50,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:50,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:50,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:50,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:19:50,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:50,530 INFO L182 omatonBuilderFactory]: Interpolants [18158#true, 18159#false, 18160#(= 0 |ldv_malloc_#t~malloc2.offset|), 18161#(= 0 |ldv_malloc_#res.offset|), 18162#(= 0 |entry_point_#t~ret12.offset|), 18163#(= entry_point_~array~0.offset 0), 18164#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 18165#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 18166#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 18167#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 18168#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 18169#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 18170#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 18171#(and (or (not (= free_17_~array.offset 0)) (<= free_17_~i~1 1)) (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|)), 18172#(and (= 1 (select |#valid| |free_17_#in~array.base|)) (or (not (= |free_17_#in~array.offset| 0)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1)))))), 18173#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1))))) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))), 18174#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:19:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:50,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:19:50,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:19:50,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:19:50,531 INFO L87 Difference]: Start difference. First operand 285 states and 333 transitions. Second operand 17 states. [2018-02-04 03:19:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:50,907 INFO L93 Difference]: Finished difference Result 329 states and 388 transitions. [2018-02-04 03:19:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:19:50,907 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-02-04 03:19:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:50,908 INFO L225 Difference]: With dead ends: 329 [2018-02-04 03:19:50,908 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 03:19:50,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:19:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 03:19:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 292. [2018-02-04 03:19:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 03:19:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 341 transitions. [2018-02-04 03:19:50,911 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 341 transitions. Word has length 69 [2018-02-04 03:19:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:50,911 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 341 transitions. [2018-02-04 03:19:50,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:19:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 341 transitions. [2018-02-04 03:19:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:19:50,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:50,912 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:50,912 INFO L371 AbstractCegarLoop]: === Iteration 47 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash 881428740, now seen corresponding path program 3 times [2018-02-04 03:19:50,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:50,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 03:19:51,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:51,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:19:51,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 03:19:51,344 INFO L182 omatonBuilderFactory]: Interpolants [18848#(= 0 |free_17_#t~mem10.offset|), 18831#true, 18832#false, 18833#(= 0 |ldv_malloc_#t~malloc2.offset|), 18834#(= 0 |ldv_malloc_#res.offset|), 18835#(= 0 |entry_point_#t~ret12.offset|), 18836#(= 0 entry_point_~array~0.offset), 18837#(and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 18838#(and (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18839#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18840#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 18841#(or (and (= 0 (select (select |#memory_$Pointer$.offset| 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|)) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 18842#(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))), 18843#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 18844#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18845#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 18846#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 18847#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))))] [2018-02-04 03:19:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 03:19:51,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:19:51,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:19:51,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:19:51,345 INFO L87 Difference]: Start difference. First operand 292 states and 341 transitions. Second operand 18 states. [2018-02-04 03:19:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:51,708 INFO L93 Difference]: Finished difference Result 447 states and 524 transitions. [2018-02-04 03:19:51,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:19:51,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-02-04 03:19:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:51,710 INFO L225 Difference]: With dead ends: 447 [2018-02-04 03:19:51,710 INFO L226 Difference]: Without dead ends: 447 [2018-02-04 03:19:51,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:19:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-02-04 03:19:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 422. [2018-02-04 03:19:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 03:19:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 508 transitions. [2018-02-04 03:19:51,714 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 508 transitions. Word has length 72 [2018-02-04 03:19:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:51,714 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 508 transitions. [2018-02-04 03:19:51,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:19:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 508 transitions. [2018-02-04 03:19:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:19:51,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:51,715 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:51,715 INFO L371 AbstractCegarLoop]: === Iteration 48 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash 881428741, now seen corresponding path program 2 times [2018-02-04 03:19:51,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:51,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:19:52,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:52,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:19:52,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:19:52,327 INFO L182 omatonBuilderFactory]: Interpolants [19744#(and (= alloc_17_~i~0 0) (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19745#(and (or (and (= 1 (select |#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|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19746#(and (or (and (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)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19747#(= |#valid| |old(#valid)|), 19748#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 19749#(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|))))), 19750#(and (or (and (= 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))) (= 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))), 19751#(or (not (= |alloc_17_#in~array.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 19752#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 19753#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|)), 19754#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 19755#(= 1 (select |#valid| |free_17_#t~mem10.base|)), 19733#true, 19734#false, 19735#(= 0 |ldv_malloc_#t~malloc2.offset|), 19736#(= 0 |ldv_malloc_#res.offset|), 19737#(= 0 |entry_point_#t~ret12.offset|), 19738#(= 0 entry_point_~array~0.offset), 19739#(and (= alloc_17_~i~0 0) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19740#(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))), 19741#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 19742#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 19743#(and (= alloc_17_~i~0 0) (or (and (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))] [2018-02-04 03:19:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:19:52,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:19:52,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:19:52,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:19:52,328 INFO L87 Difference]: Start difference. First operand 422 states and 508 transitions. Second operand 23 states. [2018-02-04 03:19:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:52,992 INFO L93 Difference]: Finished difference Result 435 states and 516 transitions. [2018-02-04 03:19:52,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:19:52,992 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-04 03:19:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:52,994 INFO L225 Difference]: With dead ends: 435 [2018-02-04 03:19:52,994 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 03:19:52,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:19:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 03:19:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 422. [2018-02-04 03:19:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 03:19:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 506 transitions. [2018-02-04 03:19:53,000 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 506 transitions. Word has length 72 [2018-02-04 03:19:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:53,001 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 506 transitions. [2018-02-04 03:19:53,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:19:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 506 transitions. [2018-02-04 03:19:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 03:19:53,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:53,002 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:53,002 INFO L371 AbstractCegarLoop]: === Iteration 49 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1957426551, now seen corresponding path program 4 times [2018-02-04 03:19:53,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:53,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:53,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:53,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:19:53,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:53,321 INFO L182 omatonBuilderFactory]: Interpolants [20641#true, 20642#false, 20643#(= 0 |ldv_malloc_#t~malloc2.offset|), 20644#(= 0 |ldv_malloc_#res.offset|), 20645#(= 0 |entry_point_#t~ret12.offset|), 20646#(= entry_point_~array~0.offset 0), 20647#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 20648#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 20649#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 20650#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset 4))) (<= entry_point_~i~2 1))), 20651#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= entry_point_~i~2 2)) (= entry_point_~array~0.offset 0)), 20652#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= entry_point_~len~0 2)) (= entry_point_~array~0.offset 0)), 20653#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 20654#(and (= 0 |free_17_#in~array.offset|) (or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)) (<= |free_17_#in~len| 2))), 20655#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (<= free_17_~len 2)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 20656#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4))) (= free_17_~array.offset 0)), 20657#(and (or (<= free_17_~len (+ free_17_~i~1 1)) (= 0 |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 20658#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len (+ free_17_~i~1 1))), 20659#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len free_17_~i~1)), 20660#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:19:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:53,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:19:53,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:19:53,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:19:53,322 INFO L87 Difference]: Start difference. First operand 422 states and 506 transitions. Second operand 20 states. [2018-02-04 03:19:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:53,739 INFO L93 Difference]: Finished difference Result 433 states and 514 transitions. [2018-02-04 03:19:53,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:19:53,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2018-02-04 03:19:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:53,741 INFO L225 Difference]: With dead ends: 433 [2018-02-04 03:19:53,741 INFO L226 Difference]: Without dead ends: 433 [2018-02-04 03:19:53,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:19:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-04 03:19:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 423. [2018-02-04 03:19:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-02-04 03:19:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 507 transitions. [2018-02-04 03:19:53,747 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 507 transitions. Word has length 71 [2018-02-04 03:19:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:53,748 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 507 transitions. [2018-02-04 03:19:53,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:19:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 507 transitions. [2018-02-04 03:19:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:19:53,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:53,749 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:53,749 INFO L371 AbstractCegarLoop]: === Iteration 50 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 496408573, now seen corresponding path program 3 times [2018-02-04 03:19:53,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:53,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:19:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:54,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:54,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:19:54,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:54,326 INFO L182 omatonBuilderFactory]: Interpolants [21568#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 21569#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (and (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~i~1 0)))), 21570#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 1 free_17_~i~1) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (<= free_17_~i~1 1)))), 21571#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1)))))), 21572#(or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 21573#(and (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base))), 21554#true, 21555#false, 21556#(= |#valid| |old(#valid)|), 21557#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (store |#valid| |ldv_malloc_#t~malloc2.base| (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)) |old(#valid)|) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 21558#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 21559#(and (= |old(#valid)| (store |#valid| |entry_point_#t~ret12.base| (select |old(#valid)| |entry_point_#t~ret12.base|))) (= 0 (select |old(#valid)| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 21560#(and (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21561#(and (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 21562#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 21563#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 21564#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21565#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 21566#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21567#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0))))] [2018-02-04 03:19:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:54,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:19:54,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:19:54,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:19:54,327 INFO L87 Difference]: Start difference. First operand 423 states and 507 transitions. Second operand 20 states. [2018-02-04 03:19:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:54,723 INFO L93 Difference]: Finished difference Result 478 states and 588 transitions. [2018-02-04 03:19:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:19:54,724 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-02-04 03:19:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:54,725 INFO L225 Difference]: With dead ends: 478 [2018-02-04 03:19:54,725 INFO L226 Difference]: Without dead ends: 445 [2018-02-04 03:19:54,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:19:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-04 03:19:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 393. [2018-02-04 03:19:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-04 03:19:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 475 transitions. [2018-02-04 03:19:54,729 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 475 transitions. Word has length 72 [2018-02-04 03:19:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:54,729 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 475 transitions. [2018-02-04 03:19:54,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:19:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 475 transitions. [2018-02-04 03:19:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:19:54,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:54,730 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:54,730 INFO L371 AbstractCegarLoop]: === Iteration 51 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:54,730 INFO L82 PathProgramCache]: Analyzing trace with hash -550680879, now seen corresponding path program 2 times [2018-02-04 03:19:54,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:54,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:55,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:55,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:19:55,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:55,317 INFO L182 omatonBuilderFactory]: Interpolants [22464#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 22465#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 22466#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))), 22467#(or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))), 22468#(or (and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 22469#(and (<= entry_point_~i~2 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))), 22470#(and (or (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 11)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (select |#length| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) (- 4)))))))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 12)) (= entry_point_~array~0.offset 0)), 22471#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (select |#length| entry_point_~array~0.base) (- 4))))) (<= (select |#length| entry_point_~array~0.base) 11)) (<= (select |#length| entry_point_~array~0.base) 12) (= entry_point_~array~0.offset 0)), 22472#(and (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22473#(= |old(#length)| |#length|), 22474#(and (<= (select |#length| |free_17_#in~array.base|) 12) (or (<= (select |#length| |free_17_#in~array.base|) 11) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ (select |#length| |free_17_#in~array.base|) (- 4)))))), 22475#(and (<= (select |#length| free_17_~array.base) 12) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) 11))), 22476#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12))), 22477#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)))), 22478#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 22479#(= 0 |free_17_#t~mem10.offset|), 22457#true, 22458#false, 22459#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 22460#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0)))), 22461#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|)))), 22462#(or (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)) (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0)), 22463#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)))] [2018-02-04 03:19:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:55,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:19:55,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:19:55,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:19:55,318 INFO L87 Difference]: Start difference. First operand 393 states and 475 transitions. Second operand 23 states. [2018-02-04 03:19:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:56,297 INFO L93 Difference]: Finished difference Result 436 states and 525 transitions. [2018-02-04 03:19:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:19:56,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-04 03:19:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:56,298 INFO L225 Difference]: With dead ends: 436 [2018-02-04 03:19:56,298 INFO L226 Difference]: Without dead ends: 436 [2018-02-04 03:19:56,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:19:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-04 03:19:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 424. [2018-02-04 03:19:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-04 03:19:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 515 transitions. [2018-02-04 03:19:56,302 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 515 transitions. Word has length 72 [2018-02-04 03:19:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:56,303 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 515 transitions. [2018-02-04 03:19:56,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:19:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 515 transitions. [2018-02-04 03:19:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 03:19:56,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:56,303 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:56,303 INFO L371 AbstractCegarLoop]: === Iteration 52 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash -550680878, now seen corresponding path program 2 times [2018-02-04 03:19:56,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:56,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:56,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:56,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:19:56,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:56,772 INFO L182 omatonBuilderFactory]: Interpolants [23392#(= |old(#length)| |#length|), 23393#(and (<= (select |#length| |free_17_#in~array.base|) 12) (or (<= (select |#length| |free_17_#in~array.base|) 11) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (select |#length| |free_17_#in~array.base|) (- 4)))))), 23394#(and (or (<= (select |#length| free_17_~array.base) 11) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) 12)), 23395#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12))), 23396#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8))), 23397#(or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 23398#(= 0 |free_17_#t~mem10.base|), 23376#true, 23377#false, 23378#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 23379#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0)))), 23380#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|)))), 23381#(or (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)) (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0)), 23382#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0))), 23383#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 23384#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))), 23385#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))), 23386#(or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))), 23387#(or (and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 23388#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))), 23389#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (select |#length| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) (- 4))))))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 11))) (= entry_point_~array~0.offset 0) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 12))), 23390#(and (<= (select |#length| entry_point_~array~0.base) 12) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (select |#length| entry_point_~array~0.base) (- 4))))) (<= (select |#length| entry_point_~array~0.base) 11))), 23391#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|))] [2018-02-04 03:19:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:19:56,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:19:56,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:19:56,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:19:56,773 INFO L87 Difference]: Start difference. First operand 424 states and 515 transitions. Second operand 23 states. [2018-02-04 03:19:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:57,650 INFO L93 Difference]: Finished difference Result 435 states and 524 transitions. [2018-02-04 03:19:57,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:19:57,650 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-02-04 03:19:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:57,651 INFO L225 Difference]: With dead ends: 435 [2018-02-04 03:19:57,651 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 03:19:57,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:19:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 03:19:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-02-04 03:19:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-04 03:19:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 514 transitions. [2018-02-04 03:19:57,655 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 514 transitions. Word has length 72 [2018-02-04 03:19:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:57,655 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 514 transitions. [2018-02-04 03:19:57,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:19:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 514 transitions. [2018-02-04 03:19:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:19:57,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:57,655 INFO L351 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:57,656 INFO L371 AbstractCegarLoop]: === Iteration 53 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash -698710182, now seen corresponding path program 3 times [2018-02-04 03:19:57,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:57,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:57,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:57,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:19:57,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:57,861 INFO L182 omatonBuilderFactory]: Interpolants [24288#true, 24289#false, 24290#(= 0 |ldv_malloc_#t~malloc2.offset|), 24291#(= 0 |ldv_malloc_#res.offset|), 24292#(= 0 |entry_point_#t~ret12.offset|), 24293#(= entry_point_~array~0.offset 0), 24294#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 24295#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 24296#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 24297#(and (<= entry_point_~i~2 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 24298#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (- entry_point_~array~0.offset) 8) entry_point_~array~0.offset)))), 24299#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 8) entry_point_~array~0.offset)))), 24300#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 24301#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 24302#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 24303#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 24304#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 24305#(= 0 |free_17_#t~mem10.offset|)] [2018-02-04 03:19:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:57,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:19:57,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:19:57,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:19:57,862 INFO L87 Difference]: Start difference. First operand 424 states and 514 transitions. Second operand 18 states. [2018-02-04 03:19:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:58,215 INFO L93 Difference]: Finished difference Result 442 states and 529 transitions. [2018-02-04 03:19:58,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:19:58,216 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2018-02-04 03:19:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:58,217 INFO L225 Difference]: With dead ends: 442 [2018-02-04 03:19:58,217 INFO L226 Difference]: Without dead ends: 442 [2018-02-04 03:19:58,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:19:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-04 03:19:58,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 425. [2018-02-04 03:19:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 03:19:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 516 transitions. [2018-02-04 03:19:58,220 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 516 transitions. Word has length 76 [2018-02-04 03:19:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:58,220 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 516 transitions. [2018-02-04 03:19:58,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:19:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 516 transitions. [2018-02-04 03:19:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:19:58,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:58,221 INFO L351 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:58,221 INFO L371 AbstractCegarLoop]: === Iteration 54 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash -698710181, now seen corresponding path program 3 times [2018-02-04 03:19:58,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:58,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:58,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:58,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:19:58,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:58,504 INFO L182 omatonBuilderFactory]: Interpolants [25216#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 25217#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 entry_point_~len~0)), 25218#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 25219#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 25220#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 25221#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 25222#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 25223#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 25224#(= 0 |free_17_#t~mem10.base|), 25204#true, 25205#false, 25206#(= 0 |ldv_malloc_#t~malloc2.offset|), 25207#(= 0 |ldv_malloc_#res.offset|), 25208#(= 0 |entry_point_#t~ret12.offset|), 25209#(= 0 entry_point_~array~0.offset), 25210#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 25211#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 25212#(and (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25213#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 25214#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 25215#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0) (<= (+ entry_point_~i~2 1) entry_point_~len~0))] [2018-02-04 03:19:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:19:58,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:19:58,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:19:58,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:19:58,504 INFO L87 Difference]: Start difference. First operand 425 states and 516 transitions. Second operand 21 states. [2018-02-04 03:19:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:59,004 INFO L93 Difference]: Finished difference Result 441 states and 528 transitions. [2018-02-04 03:19:59,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:19:59,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-04 03:19:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:59,005 INFO L225 Difference]: With dead ends: 441 [2018-02-04 03:19:59,005 INFO L226 Difference]: Without dead ends: 441 [2018-02-04 03:19:59,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:19:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-04 03:19:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 425. [2018-02-04 03:19:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 03:19:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 515 transitions. [2018-02-04 03:19:59,009 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 515 transitions. Word has length 76 [2018-02-04 03:19:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:59,009 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 515 transitions. [2018-02-04 03:19:59,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:19:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 515 transitions. [2018-02-04 03:19:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 03:19:59,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:59,010 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:59,010 INFO L371 AbstractCegarLoop]: === Iteration 55 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:59,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2142667465, now seen corresponding path program 1 times [2018-02-04 03:19:59,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:59,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:19:59,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:59,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:19:59,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:59,156 INFO L182 omatonBuilderFactory]: Interpolants [26118#true, 26119#false, 26120#(= 0 |ldv_malloc_#t~malloc2.offset|), 26121#(= 0 |ldv_malloc_#res.offset|), 26122#(= 0 |entry_point_#t~ret12.offset|), 26123#(= 0 entry_point_~array~0.offset), 26124#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 26125#(and (or (<= 0 alloc_17_~j~0) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 26126#(and (or (not (= alloc_17_~array.offset 0)) (<= (+ alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 26127#(or (<= 4 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 26128#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 26129#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 26130#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-04 03:19:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:19:59,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:19:59,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:19:59,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:19:59,157 INFO L87 Difference]: Start difference. First operand 425 states and 515 transitions. Second operand 13 states. [2018-02-04 03:19:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:59,323 INFO L93 Difference]: Finished difference Result 436 states and 517 transitions. [2018-02-04 03:19:59,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:19:59,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2018-02-04 03:19:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:59,350 INFO L225 Difference]: With dead ends: 436 [2018-02-04 03:19:59,350 INFO L226 Difference]: Without dead ends: 436 [2018-02-04 03:19:59,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:19:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-04 03:19:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 383. [2018-02-04 03:19:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 03:19:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 455 transitions. [2018-02-04 03:19:59,356 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 455 transitions. Word has length 75 [2018-02-04 03:19:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:59,357 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 455 transitions. [2018-02-04 03:19:59,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:19:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 455 transitions. [2018-02-04 03:19:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:19:59,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:59,358 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:59,358 INFO L371 AbstractCegarLoop]: === Iteration 56 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:59,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1998182003, now seen corresponding path program 1 times [2018-02-04 03:19:59,359 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:59,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:19:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:19:59,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:19:59,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:19:59,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:19:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:19:59,629 INFO L182 omatonBuilderFactory]: Interpolants [26956#true, 26957#false, 26958#(= 0 |ldv_malloc_#t~malloc2.offset|), 26959#(= 0 |ldv_malloc_#res.offset|), 26960#(= 0 |entry_point_#t~ret12.offset|), 26961#(= 0 entry_point_~array~0.offset), 26962#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 26963#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 26964#(and (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 26965#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 26966#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 26967#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 26968#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 26969#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 26970#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 26971#(= 0 |free_17_#t~mem10.base|)] [2018-02-04 03:19:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:19:59,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:19:59,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:19:59,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:19:59,630 INFO L87 Difference]: Start difference. First operand 383 states and 455 transitions. Second operand 16 states. [2018-02-04 03:19:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:19:59,837 INFO L93 Difference]: Finished difference Result 434 states and 511 transitions. [2018-02-04 03:19:59,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:19:59,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-02-04 03:19:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:19:59,838 INFO L225 Difference]: With dead ends: 434 [2018-02-04 03:19:59,838 INFO L226 Difference]: Without dead ends: 434 [2018-02-04 03:19:59,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:19:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-04 03:19:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 383. [2018-02-04 03:19:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 03:19:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 455 transitions. [2018-02-04 03:19:59,841 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 455 transitions. Word has length 76 [2018-02-04 03:19:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:19:59,841 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 455 transitions. [2018-02-04 03:19:59,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:19:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 455 transitions. [2018-02-04 03:19:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 03:19:59,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:19:59,842 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:19:59,842 INFO L371 AbstractCegarLoop]: === Iteration 57 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:19:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash 189822284, now seen corresponding path program 1 times [2018-02-04 03:19:59,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:19:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:19:59,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:00,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:00,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:20:00,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:00,462 INFO L182 omatonBuilderFactory]: Interpolants [27803#true, 27804#false, 27805#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 27806#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 27807#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 27808#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 27809#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1) (= entry_point_~i~2 0)), 27810#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1)), 27811#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 27812#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2) (= (select |#valid| entry_point_~array~0.base) 1)), 27813#(= |#valid| |old(#valid)|), 27814#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)))), 27815#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 27816#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 27817#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 27818#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))), 27819#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 27820#(and (or (and (= 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|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))))), 27821#(or (and (not (= (+ (* 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)))) (and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 27822#(or (and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 9 (+ (* 4 alloc_17_~len) 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))) (and (not (= (+ (* 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))))), 27823#(or (and (= 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))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 9 (+ (* 4 alloc_17_~len) 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)))), 27824#(or (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= |alloc_17_#in~array.offset| 0)) (<= 3 alloc_17_~len)))), 27825#(or (<= 3 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 27826#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 27827#(and (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 27828#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 27829#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 27830#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:00,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:20:00,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:20:00,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:20:00,462 INFO L87 Difference]: Start difference. First operand 383 states and 455 transitions. Second operand 28 states. [2018-02-04 03:20:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:01,434 INFO L93 Difference]: Finished difference Result 406 states and 478 transitions. [2018-02-04 03:20:01,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:20:01,434 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 77 [2018-02-04 03:20:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:01,435 INFO L225 Difference]: With dead ends: 406 [2018-02-04 03:20:01,435 INFO L226 Difference]: Without dead ends: 406 [2018-02-04 03:20:01,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=1654, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:20:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-04 03:20:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 397. [2018-02-04 03:20:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-04 03:20:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 471 transitions. [2018-02-04 03:20:01,439 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 471 transitions. Word has length 77 [2018-02-04 03:20:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:01,439 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 471 transitions. [2018-02-04 03:20:01,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:20:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 471 transitions. [2018-02-04 03:20:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 03:20:01,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:01,439 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:01,439 INFO L371 AbstractCegarLoop]: === Iteration 58 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash 189822285, now seen corresponding path program 1 times [2018-02-04 03:20:01,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:01,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-04 03:20:01,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:01,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:20:01,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:01,620 INFO L182 omatonBuilderFactory]: Interpolants [28672#(and (or (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))) (= alloc_17_~len |alloc_17_#in~len|)), 28673#(and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= |alloc_17_#in~array.offset| 0)) (<= (* 4 alloc_17_~i~0) (select |#length| |alloc_17_#in~array.base|)))), 28674#(or (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 28675#(and (= 0 entry_point_~array~0.offset) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base))), 28676#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 28677#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 28678#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 28679#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 28680#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 28665#true, 28666#false, 28667#(= 0 |ldv_malloc_#t~malloc2.offset|), 28668#(= 0 |ldv_malloc_#res.offset|), 28669#(= 0 |entry_point_#t~ret12.offset|), 28670#(= 0 entry_point_~array~0.offset), 28671#(and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|))] [2018-02-04 03:20:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-04 03:20:01,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:20:01,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:20:01,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:20:01,620 INFO L87 Difference]: Start difference. First operand 397 states and 471 transitions. Second operand 16 states. [2018-02-04 03:20:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:01,954 INFO L93 Difference]: Finished difference Result 434 states and 506 transitions. [2018-02-04 03:20:01,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:20:01,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-02-04 03:20:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:01,955 INFO L225 Difference]: With dead ends: 434 [2018-02-04 03:20:01,955 INFO L226 Difference]: Without dead ends: 434 [2018-02-04 03:20:01,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:20:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-04 03:20:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 425. [2018-02-04 03:20:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 03:20:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 502 transitions. [2018-02-04 03:20:01,959 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 502 transitions. Word has length 77 [2018-02-04 03:20:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:01,959 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 502 transitions. [2018-02-04 03:20:01,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:20:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 502 transitions. [2018-02-04 03:20:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 03:20:01,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:01,959 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:01,959 INFO L371 AbstractCegarLoop]: === Iteration 59 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:01,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1589523566, now seen corresponding path program 1 times [2018-02-04 03:20:01,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:01,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:02,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:02,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:20:02,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:02,222 INFO L182 omatonBuilderFactory]: Interpolants [29568#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 29569#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 29570#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 29571#(= 0 |free_17_#t~mem10.offset|), 29554#true, 29555#false, 29556#(= 0 |ldv_malloc_#t~malloc2.offset|), 29557#(= 0 |ldv_malloc_#res.offset|), 29558#(= 0 |entry_point_#t~ret12.offset|), 29559#(= entry_point_~array~0.offset 0), 29560#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 29561#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 29562#(and (= alloc_17_~i~0 0) (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29563#(and (or (not (= alloc_17_~array.offset 0)) (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29564#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29565#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 29566#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))))), 29567#(and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))))] [2018-02-04 03:20:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:02,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:20:02,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:20:02,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:20:02,222 INFO L87 Difference]: Start difference. First operand 425 states and 502 transitions. Second operand 18 states. [2018-02-04 03:20:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:02,590 INFO L93 Difference]: Finished difference Result 459 states and 530 transitions. [2018-02-04 03:20:02,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:20:02,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-04 03:20:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:02,591 INFO L225 Difference]: With dead ends: 459 [2018-02-04 03:20:02,591 INFO L226 Difference]: Without dead ends: 459 [2018-02-04 03:20:02,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:20:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-04 03:20:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 429. [2018-02-04 03:20:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-04 03:20:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 509 transitions. [2018-02-04 03:20:02,595 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 509 transitions. Word has length 78 [2018-02-04 03:20:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:02,595 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 509 transitions. [2018-02-04 03:20:02,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:20:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 509 transitions. [2018-02-04 03:20:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 03:20:02,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:02,596 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:02,596 INFO L371 AbstractCegarLoop]: === Iteration 60 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1589523567, now seen corresponding path program 1 times [2018-02-04 03:20:02,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:02,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:03,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:03,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:20:03,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:03,423 INFO L182 omatonBuilderFactory]: Interpolants [30482#true, 30483#false, 30484#(= 0 |ldv_malloc_#t~malloc2.offset|), 30485#(= 0 |ldv_malloc_#res.offset|), 30486#(= 0 |entry_point_#t~ret12.offset|), 30487#(= 0 entry_point_~array~0.offset), 30488#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 30489#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 30490#(and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 30491#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 30492#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 30493#(and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 30494#(and (or (and (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 30495#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= 1 (select |#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|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~i~0 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))), 30496#(or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 30497#(= |#valid| |old(#valid)|), 30498#(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)|)))))), 30499#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 30500#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)))), 30501#(or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0))) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 30502#(or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (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) 0)) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 1 (select |#valid| 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) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= |alloc_17_#in~array.offset| alloc_17_~array.offset) (not (= alloc_17_~array.offset 0)))), 30503#(or (not (= |alloc_17_#in~array.offset| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 30504#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 30505#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)))), 30506#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 4) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~i~1 0) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))) (= free_17_~array.offset 0)), 30507#(and (not (= |free_17_#t~mem10.base| 0)) (= free_17_~i~1 0) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))))) (= free_17_~array.offset 0)), 30508#(and (= free_17_~i~1 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))))) (= free_17_~array.offset 0)), 30509#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))) (= free_17_~array.offset 0)), 30510#(= 1 (select |#valid| |free_17_#t~mem10.base|))] [2018-02-04 03:20:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:03,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:20:03,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:20:03,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:20:03,424 INFO L87 Difference]: Start difference. First operand 429 states and 509 transitions. Second operand 29 states. [2018-02-04 03:20:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:04,337 INFO L93 Difference]: Finished difference Result 436 states and 511 transitions. [2018-02-04 03:20:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:20:04,337 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2018-02-04 03:20:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:04,338 INFO L225 Difference]: With dead ends: 436 [2018-02-04 03:20:04,338 INFO L226 Difference]: Without dead ends: 436 [2018-02-04 03:20:04,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:20:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-04 03:20:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 429. [2018-02-04 03:20:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-04 03:20:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 507 transitions. [2018-02-04 03:20:04,342 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 507 transitions. Word has length 78 [2018-02-04 03:20:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:04,342 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 507 transitions. [2018-02-04 03:20:04,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:20:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 507 transitions. [2018-02-04 03:20:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 03:20:04,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:04,342 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2018-02-04 03:20:04,342 INFO L371 AbstractCegarLoop]: === Iteration 61 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash 10795767, now seen corresponding path program 3 times [2018-02-04 03:20:04,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:04,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:20:04,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:04,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:20:04,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:20:04,522 INFO L182 omatonBuilderFactory]: Interpolants [31400#true, 31401#false, 31402#(= 0 |ldv_malloc_#t~malloc2.offset|), 31403#(= 0 |ldv_malloc_#res.offset|), 31404#(= 0 |entry_point_#t~ret12.offset|), 31405#(= 0 entry_point_~array~0.offset), 31406#(= 0 |alloc_17_#in~array.offset|), 31407#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 31408#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0)), 31409#(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))), 31410#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 31411#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#res.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 31412#(and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.offset 0)), 31413#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 31414#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (- (* (- 4) alloc_17_~i~0))))), 31415#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (- (+ (* (- 4) alloc_17_~i~0) 4)))) (= alloc_17_~array.offset 0)), 31416#(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))))), 31417#(= 0 |alloc_17_#t~mem7.offset|)] [2018-02-04 03:20:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:20:04,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:20:04,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:20:04,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:20:04,522 INFO L87 Difference]: Start difference. First operand 429 states and 507 transitions. Second operand 18 states. [2018-02-04 03:20:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:04,911 INFO L93 Difference]: Finished difference Result 445 states and 526 transitions. [2018-02-04 03:20:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:20:04,912 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-04 03:20:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:04,913 INFO L225 Difference]: With dead ends: 445 [2018-02-04 03:20:04,913 INFO L226 Difference]: Without dead ends: 445 [2018-02-04 03:20:04,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:20:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-04 03:20:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 433. [2018-02-04 03:20:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-04 03:20:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 513 transitions. [2018-02-04 03:20:04,916 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 513 transitions. Word has length 78 [2018-02-04 03:20:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:04,917 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 513 transitions. [2018-02-04 03:20:04,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:20:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 513 transitions. [2018-02-04 03:20:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:20:04,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:04,917 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1] [2018-02-04 03:20:04,917 INFO L371 AbstractCegarLoop]: === Iteration 62 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1552577, now seen corresponding path program 3 times [2018-02-04 03:20:04,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:04,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 03:20:05,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:05,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:20:05,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:05,270 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:20:05,270 INFO L182 omatonBuilderFactory]: Interpolants [32352#(= 1 (select |#valid| |alloc_17_#t~mem7.base|)), 32332#true, 32333#false, 32334#(= 0 |ldv_malloc_#t~malloc2.offset|), 32335#(= 0 |ldv_malloc_#res.offset|), 32336#(= 0 |entry_point_#t~ret12.offset|), 32337#(= entry_point_~array~0.offset 0), 32338#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 32339#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 3)) (= entry_point_~array~0.offset 0)), 32340#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 4)) (= entry_point_~array~0.offset 0)), 32341#(= 0 |alloc_17_#in~array.offset|), 32342#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 32343#(= alloc_17_~array.offset 0), 32344#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 32345#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 32346#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))), 32347#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 32348#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 32349#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 32350#(= |#valid| |old(#valid)|), 32351#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))))] [2018-02-04 03:20:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 03:20:05,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:20:05,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:20:05,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:20:05,271 INFO L87 Difference]: Start difference. First operand 433 states and 513 transitions. Second operand 21 states. [2018-02-04 03:20:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:05,729 INFO L93 Difference]: Finished difference Result 435 states and 511 transitions. [2018-02-04 03:20:05,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:20:05,730 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-04 03:20:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:05,731 INFO L225 Difference]: With dead ends: 435 [2018-02-04 03:20:05,731 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 03:20:05,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:20:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 03:20:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 433. [2018-02-04 03:20:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-04 03:20:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 511 transitions. [2018-02-04 03:20:05,735 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 511 transitions. Word has length 82 [2018-02-04 03:20:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:05,735 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 511 transitions. [2018-02-04 03:20:05,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:20:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 511 transitions. [2018-02-04 03:20:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 03:20:05,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:05,736 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:05,736 INFO L371 AbstractCegarLoop]: === Iteration 63 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1884049311, now seen corresponding path program 5 times [2018-02-04 03:20:05,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:05,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:05,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:05,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:20:05,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:05,860 INFO L182 omatonBuilderFactory]: Interpolants [33256#true, 33257#false, 33258#(= 0 |ldv_malloc_#t~malloc2.offset|), 33259#(= 0 |ldv_malloc_#res.offset|), 33260#(= 0 |entry_point_#t~ret12.offset|), 33261#(= 0 entry_point_~array~0.offset), 33262#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 33263#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 33264#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 33265#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 33266#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 3)), 33267#(and (<= |free_17_#in~len| 3) (= 0 |free_17_#in~array.offset|)), 33268#(and (<= free_17_~len 3) (= free_17_~array.offset 0)), 33269#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 33270#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 33271#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0)), 33272#(<= free_17_~len (+ free_17_~i~1 1)), 33273#(<= free_17_~len free_17_~i~1)] [2018-02-04 03:20:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:05,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:20:05,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:20:05,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:20:05,861 INFO L87 Difference]: Start difference. First operand 433 states and 511 transitions. Second operand 18 states. [2018-02-04 03:20:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:05,988 INFO L93 Difference]: Finished difference Result 552 states and 650 transitions. [2018-02-04 03:20:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:20:05,988 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-04 03:20:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:05,989 INFO L225 Difference]: With dead ends: 552 [2018-02-04 03:20:05,989 INFO L226 Difference]: Without dead ends: 552 [2018-02-04 03:20:05,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-02-04 03:20:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 532. [2018-02-04 03:20:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-02-04 03:20:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 640 transitions. [2018-02-04 03:20:05,993 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 640 transitions. Word has length 77 [2018-02-04 03:20:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:05,993 INFO L432 AbstractCegarLoop]: Abstraction has 532 states and 640 transitions. [2018-02-04 03:20:05,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:20:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 640 transitions. [2018-02-04 03:20:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:20:05,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:05,994 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:05,994 INFO L371 AbstractCegarLoop]: === Iteration 64 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash 221183158, now seen corresponding path program 6 times [2018-02-04 03:20:05,995 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:06,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:06,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:06,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:20:06,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:06,260 INFO L182 omatonBuilderFactory]: Interpolants [34373#true, 34374#false, 34375#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 34376#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 34377#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 34378#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 34379#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 34380#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 34381#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 34382#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 34383#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)))))), 34384#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8))))) (= entry_point_~array~0.offset 0)), 34385#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 34386#(and (= 0 |free_17_#in~array.offset|) (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8)))), 34387#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 8)))), 34388#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 34389#(not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))), 34390#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 34391#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:06,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:20:06,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:20:06,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:20:06,261 INFO L87 Difference]: Start difference. First operand 532 states and 640 transitions. Second operand 19 states. [2018-02-04 03:20:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:06,814 INFO L93 Difference]: Finished difference Result 550 states and 656 transitions. [2018-02-04 03:20:06,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:20:06,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-02-04 03:20:06,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:06,815 INFO L225 Difference]: With dead ends: 550 [2018-02-04 03:20:06,815 INFO L226 Difference]: Without dead ends: 550 [2018-02-04 03:20:06,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=1235, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:20:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-02-04 03:20:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 537. [2018-02-04 03:20:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-02-04 03:20:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 646 transitions. [2018-02-04 03:20:06,821 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 646 transitions. Word has length 81 [2018-02-04 03:20:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:06,821 INFO L432 AbstractCegarLoop]: Abstraction has 537 states and 646 transitions. [2018-02-04 03:20:06,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:20:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 646 transitions. [2018-02-04 03:20:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 03:20:06,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:06,822 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2018-02-04 03:20:06,823 INFO L371 AbstractCegarLoop]: === Iteration 65 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1784798488, now seen corresponding path program 3 times [2018-02-04 03:20:06,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:06,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:07,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:07,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:20:07,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:07,304 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:20:07,304 INFO L182 omatonBuilderFactory]: Interpolants [35520#(= 0 |ldv_malloc_#t~malloc2.offset|), 35521#(= 0 |ldv_malloc_#res.offset|), 35522#(= 0 |entry_point_#t~ret12.offset|), 35523#(= entry_point_~array~0.offset 0), 35524#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 35525#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 35526#(= 0 |alloc_17_#in~array.offset|), 35527#(= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0), 35528#(and (= (select |#valid| alloc_17_~array.base) 1) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)), 35529#(= (select |#valid| alloc_17_~array.base) 1), 35530#(= |#valid| |old(#valid)|), 35531#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 35532#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 35533#(not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)), 35534#(not (= alloc_17_~array.base alloc_17_~p~0.base)), 35535#(and (= 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)))))), 35536#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4)))))) (= 1 (select |#valid| alloc_17_~array.base))), 35537#(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))), 35538#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 35518#true, 35519#false] [2018-02-04 03:20:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:07,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:20:07,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:20:07,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:20:07,305 INFO L87 Difference]: Start difference. First operand 537 states and 646 transitions. Second operand 21 states. [2018-02-04 03:20:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:07,715 INFO L93 Difference]: Finished difference Result 543 states and 650 transitions. [2018-02-04 03:20:07,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:20:07,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-02-04 03:20:07,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:07,717 INFO L225 Difference]: With dead ends: 543 [2018-02-04 03:20:07,717 INFO L226 Difference]: Without dead ends: 543 [2018-02-04 03:20:07,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:20:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-04 03:20:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2018-02-04 03:20:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-02-04 03:20:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 650 transitions. [2018-02-04 03:20:07,721 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 650 transitions. Word has length 80 [2018-02-04 03:20:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:07,721 INFO L432 AbstractCegarLoop]: Abstraction has 541 states and 650 transitions. [2018-02-04 03:20:07,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:20:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 650 transitions. [2018-02-04 03:20:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 03:20:07,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:07,722 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:07,722 INFO L371 AbstractCegarLoop]: === Iteration 66 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1904855336, now seen corresponding path program 3 times [2018-02-04 03:20:07,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:07,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:07,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:07,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:20:07,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:07,970 INFO L182 omatonBuilderFactory]: Interpolants [36672#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= free_17_~i~1 2) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))))), 36673#(or (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 8))) (* 4 free_17_~i~1))) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 36674#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 8))) (* 4 free_17_~i~1))) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 36675#(= 1 (select |#valid| entry_point_~array~0.base)), 36658#true, 36659#false, 36660#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 36661#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 36662#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 36663#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 36664#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 36665#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 36666#(and (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (not (= entry_point_~array~0.base 0)) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 36667#(and (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 36668#(and (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 8) entry_point_~array~0.offset))))), 36669#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 36670#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 36671#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (<= free_17_~i~1 1))))] [2018-02-04 03:20:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:07,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:20:07,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:20:07,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:20:07,971 INFO L87 Difference]: Start difference. First operand 541 states and 650 transitions. Second operand 18 states. [2018-02-04 03:20:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:08,630 INFO L93 Difference]: Finished difference Result 643 states and 783 transitions. [2018-02-04 03:20:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:20:08,630 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-02-04 03:20:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:08,632 INFO L225 Difference]: With dead ends: 643 [2018-02-04 03:20:08,632 INFO L226 Difference]: Without dead ends: 643 [2018-02-04 03:20:08,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:20:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-02-04 03:20:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 544. [2018-02-04 03:20:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-02-04 03:20:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 653 transitions. [2018-02-04 03:20:08,637 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 653 transitions. Word has length 79 [2018-02-04 03:20:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:08,637 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 653 transitions. [2018-02-04 03:20:08,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:20:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 653 transitions. [2018-02-04 03:20:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:20:08,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:08,638 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:08,638 INFO L371 AbstractCegarLoop]: === Iteration 67 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1733256636, now seen corresponding path program 4 times [2018-02-04 03:20:08,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:08,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:08,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:08,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:20:08,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:08,824 INFO L182 omatonBuilderFactory]: Interpolants [37920#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 37921#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 12))), 37922#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 37923#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 37924#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 37925#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 37926#(= 0 |free_17_#t~mem10.offset|), 37908#true, 37909#false, 37910#(= 0 |ldv_malloc_#t~malloc2.offset|), 37911#(= 0 |ldv_malloc_#res.offset|), 37912#(= 0 |entry_point_#t~ret12.offset|), 37913#(= entry_point_~array~0.offset 0), 37914#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 37915#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 37916#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 37917#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 37918#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 37919#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0))] [2018-02-04 03:20:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:08,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:20:08,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:20:08,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:20:08,824 INFO L87 Difference]: Start difference. First operand 544 states and 653 transitions. Second operand 19 states. [2018-02-04 03:20:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:09,283 INFO L93 Difference]: Finished difference Result 566 states and 672 transitions. [2018-02-04 03:20:09,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:20:09,283 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-02-04 03:20:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:09,284 INFO L225 Difference]: With dead ends: 566 [2018-02-04 03:20:09,284 INFO L226 Difference]: Without dead ends: 566 [2018-02-04 03:20:09,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:20:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-02-04 03:20:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 545. [2018-02-04 03:20:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-02-04 03:20:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 655 transitions. [2018-02-04 03:20:09,288 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 655 transitions. Word has length 82 [2018-02-04 03:20:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:09,289 INFO L432 AbstractCegarLoop]: Abstraction has 545 states and 655 transitions. [2018-02-04 03:20:09,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:20:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 655 transitions. [2018-02-04 03:20:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:20:09,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:09,289 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:09,289 INFO L371 AbstractCegarLoop]: === Iteration 68 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1733256635, now seen corresponding path program 4 times [2018-02-04 03:20:09,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:09,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:09,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:09,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:20:09,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:09,474 INFO L182 omatonBuilderFactory]: Interpolants [39073#true, 39074#false, 39075#(= 0 |ldv_malloc_#t~malloc2.offset|), 39076#(= 0 |ldv_malloc_#res.offset|), 39077#(= 0 |entry_point_#t~ret12.offset|), 39078#(= entry_point_~array~0.offset 0), 39079#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 39080#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 39081#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 39082#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 39083#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 39084#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset)))), 39085#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 39086#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 39087#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 39088#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 39089#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 39090#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 39091#(= 0 |free_17_#t~mem10.base|)] [2018-02-04 03:20:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:09,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:20:09,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:20:09,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:20:09,474 INFO L87 Difference]: Start difference. First operand 545 states and 655 transitions. Second operand 19 states. [2018-02-04 03:20:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:09,907 INFO L93 Difference]: Finished difference Result 565 states and 671 transitions. [2018-02-04 03:20:09,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:20:09,907 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-02-04 03:20:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:09,908 INFO L225 Difference]: With dead ends: 565 [2018-02-04 03:20:09,908 INFO L226 Difference]: Without dead ends: 565 [2018-02-04 03:20:09,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:20:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-02-04 03:20:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 545. [2018-02-04 03:20:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-02-04 03:20:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 654 transitions. [2018-02-04 03:20:09,913 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 654 transitions. Word has length 82 [2018-02-04 03:20:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:09,913 INFO L432 AbstractCegarLoop]: Abstraction has 545 states and 654 transitions. [2018-02-04 03:20:09,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:20:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 654 transitions. [2018-02-04 03:20:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:20:09,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:09,913 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:09,913 INFO L371 AbstractCegarLoop]: === Iteration 69 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:09,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1362138814, now seen corresponding path program 2 times [2018-02-04 03:20:09,914 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:09,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:20:09,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:09,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:20:09,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:09,954 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:20:09,954 INFO L182 omatonBuilderFactory]: Interpolants [40227#true, 40228#false, 40229#(= entry_point_~i~2 0), 40230#(<= entry_point_~i~2 1), 40231#(<= entry_point_~i~2 2), 40232#(<= entry_point_~len~0 2), 40233#(<= |alloc_17_#in~len| 2), 40234#(<= alloc_17_~len 2), 40235#(<= alloc_17_~i~0 1), 40236#(<= alloc_17_~j~0 0), 40237#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-04 03:20:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:20:09,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:20:09,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:20:09,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:20:09,955 INFO L87 Difference]: Start difference. First operand 545 states and 654 transitions. Second operand 11 states. [2018-02-04 03:20:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:10,037 INFO L93 Difference]: Finished difference Result 541 states and 644 transitions. [2018-02-04 03:20:10,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:20:10,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-02-04 03:20:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:10,038 INFO L225 Difference]: With dead ends: 541 [2018-02-04 03:20:10,038 INFO L226 Difference]: Without dead ends: 541 [2018-02-04 03:20:10,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:20:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-04 03:20:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 525. [2018-02-04 03:20:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-02-04 03:20:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 628 transitions. [2018-02-04 03:20:10,042 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 628 transitions. Word has length 81 [2018-02-04 03:20:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:10,042 INFO L432 AbstractCegarLoop]: Abstraction has 525 states and 628 transitions. [2018-02-04 03:20:10,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:20:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 628 transitions. [2018-02-04 03:20:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:20:10,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:10,043 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:10,043 INFO L371 AbstractCegarLoop]: === Iteration 70 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash 60644510, now seen corresponding path program 1 times [2018-02-04 03:20:10,043 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:10,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:20:10,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:10,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:20:10,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:10,246 INFO L182 omatonBuilderFactory]: Interpolants [41318#true, 41319#false, 41320#(= 0 |ldv_malloc_#t~malloc2.offset|), 41321#(= 0 |ldv_malloc_#res.offset|), 41322#(= 0 |entry_point_#t~ret12.offset|), 41323#(= 0 entry_point_~array~0.offset), 41324#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 41325#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 41326#(and (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 41327#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 41328#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 41329#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 41330#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 41331#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 41332#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 41333#(and (= 1 (select |#valid| free_17_~array.base)) (= 0 |free_17_#t~mem10.base|)), 41334#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:20:10,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:20:10,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:20:10,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:20:10,247 INFO L87 Difference]: Start difference. First operand 525 states and 628 transitions. Second operand 17 states. [2018-02-04 03:20:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:10,482 INFO L93 Difference]: Finished difference Result 531 states and 628 transitions. [2018-02-04 03:20:10,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:20:10,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-02-04 03:20:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:10,483 INFO L225 Difference]: With dead ends: 531 [2018-02-04 03:20:10,483 INFO L226 Difference]: Without dead ends: 531 [2018-02-04 03:20:10,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-02-04 03:20:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 526. [2018-02-04 03:20:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-02-04 03:20:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 625 transitions. [2018-02-04 03:20:10,487 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 625 transitions. Word has length 81 [2018-02-04 03:20:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:10,487 INFO L432 AbstractCegarLoop]: Abstraction has 526 states and 625 transitions. [2018-02-04 03:20:10,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:20:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 625 transitions. [2018-02-04 03:20:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:20:10,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:10,488 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:10,488 INFO L371 AbstractCegarLoop]: === Iteration 71 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash 60644511, now seen corresponding path program 1 times [2018-02-04 03:20:10,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:10,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:20:10,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:10,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:20:10,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:10,727 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:20:10,727 INFO L182 omatonBuilderFactory]: Interpolants [42408#true, 42409#false, 42410#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 42411#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 42412#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 42413#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 42414#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 42415#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 42416#(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)), 42417#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 42418#(and (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 42419#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 42420#(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|))))), 42421#(and (or (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= 0 (select |old(#valid)| alloc_17_~array.base))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 42422#(= |old(#length)| |#length|), 42423#(or (= 0 (select |old(#valid)| |alloc_17_#in~array.base|)) (= (select |old(#length)| |alloc_17_#in~array.base|) (select |#length| |alloc_17_#in~array.base|))), 42424#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 42425#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 42426#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 42427#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 42428#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 42429#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-04 03:20:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:20:10,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:20:10,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:20:10,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:20:10,727 INFO L87 Difference]: Start difference. First operand 526 states and 625 transitions. Second operand 22 states. [2018-02-04 03:20:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:11,232 INFO L93 Difference]: Finished difference Result 624 states and 729 transitions. [2018-02-04 03:20:11,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:20:11,232 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2018-02-04 03:20:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:11,233 INFO L225 Difference]: With dead ends: 624 [2018-02-04 03:20:11,233 INFO L226 Difference]: Without dead ends: 624 [2018-02-04 03:20:11,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:20:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-02-04 03:20:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 609. [2018-02-04 03:20:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-02-04 03:20:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 720 transitions. [2018-02-04 03:20:11,239 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 720 transitions. Word has length 81 [2018-02-04 03:20:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:11,239 INFO L432 AbstractCegarLoop]: Abstraction has 609 states and 720 transitions. [2018-02-04 03:20:11,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:20:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 720 transitions. [2018-02-04 03:20:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 03:20:11,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:11,240 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:11,240 INFO L371 AbstractCegarLoop]: === Iteration 72 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:11,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1473043869, now seen corresponding path program 2 times [2018-02-04 03:20:11,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:11,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:20:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 03:20:11,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:11,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:20:11,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:11,333 INFO L182 omatonBuilderFactory]: Interpolants [43693#true, 43694#false, 43695#(= 0 |ldv_malloc_#t~malloc2.offset|), 43696#(= 0 |ldv_malloc_#res.offset|), 43697#(= 0 |entry_point_#t~ret12.offset|), 43698#(= entry_point_~array~0.offset 0), 43699#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 43700#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 43701#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 43702#(and (= entry_point_~array~0.offset 0) (<= 12 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 43703#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 43704#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 43705#(and (<= alloc_17_~i~0 2) (= alloc_17_~len |alloc_17_#in~len|)), 43706#(<= |alloc_17_#in~len| 2)] [2018-02-04 03:20:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 03:20:11,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:20:11,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:20:11,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:20:11,333 INFO L87 Difference]: Start difference. First operand 609 states and 720 transitions. Second operand 14 states. [2018-02-04 03:20:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:11,455 INFO L93 Difference]: Finished difference Result 578 states and 674 transitions. [2018-02-04 03:20:11,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:20:11,455 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2018-02-04 03:20:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:11,457 INFO L225 Difference]: With dead ends: 578 [2018-02-04 03:20:11,457 INFO L226 Difference]: Without dead ends: 575 [2018-02-04 03:20:11,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:20:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-04 03:20:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 560. [2018-02-04 03:20:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-02-04 03:20:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 659 transitions. [2018-02-04 03:20:11,461 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 659 transitions. Word has length 81 [2018-02-04 03:20:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:11,461 INFO L432 AbstractCegarLoop]: Abstraction has 560 states and 659 transitions. [2018-02-04 03:20:11,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:20:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 659 transitions. [2018-02-04 03:20:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:20:11,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:11,462 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:11,462 INFO L371 AbstractCegarLoop]: === Iteration 73 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:11,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1879979869, now seen corresponding path program 1 times [2018-02-04 03:20:11,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:11,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:20:12,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:12,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:20:12,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:20:12,112 INFO L182 omatonBuilderFactory]: Interpolants [44864#(and (or (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 44865#(and (or (and (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 44866#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 44867#(and (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 44868#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= 1 alloc_17_~j~0) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (<= 1 alloc_17_~j~0) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))), 44869#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= 0 alloc_17_~j~0) (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= 0 alloc_17_~j~0) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))))), 44870#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))))), 44871#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 44872#(and (= free_17_~array.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0)) (<= (+ free_17_~i~1 1) 0))), 44873#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 44874#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 44875#(= 0 |free_17_#t~mem10.base|), 44851#true, 44852#false, 44853#(= 0 |ldv_malloc_#t~malloc2.offset|), 44854#(= 0 |ldv_malloc_#res.offset|), 44855#(= 0 |entry_point_#t~ret12.offset|), 44856#(= 0 entry_point_~array~0.offset), 44857#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 44858#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 44859#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 44860#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 4) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 44861#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 44862#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 44863#(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)))] [2018-02-04 03:20:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:20:12,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:20:12,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:20:12,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:12,113 INFO L87 Difference]: Start difference. First operand 560 states and 659 transitions. Second operand 25 states. [2018-02-04 03:20:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:12,955 INFO L93 Difference]: Finished difference Result 569 states and 662 transitions. [2018-02-04 03:20:12,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:20:12,956 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 82 [2018-02-04 03:20:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:12,957 INFO L225 Difference]: With dead ends: 569 [2018-02-04 03:20:12,957 INFO L226 Difference]: Without dead ends: 569 [2018-02-04 03:20:12,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 03:20:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-02-04 03:20:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 539. [2018-02-04 03:20:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-02-04 03:20:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 635 transitions. [2018-02-04 03:20:12,962 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 635 transitions. Word has length 82 [2018-02-04 03:20:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:12,962 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 635 transitions. [2018-02-04 03:20:12,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:20:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 635 transitions. [2018-02-04 03:20:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 03:20:12,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:12,963 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:12,963 INFO L371 AbstractCegarLoop]: === Iteration 74 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:12,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1857638704, now seen corresponding path program 4 times [2018-02-04 03:20:12,963 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:12,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:13,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:13,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:20:13,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:13,946 INFO L182 omatonBuilderFactory]: Interpolants [46016#true, 46017#false, 46018#(= |#valid| |old(#valid)|), 46019#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 46020#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 46021#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret12.base| (select |#valid| |entry_point_#t~ret12.base|))) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0)), 46022#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46023#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 46024#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 46025#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46026#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46027#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= entry_point_~i~2 2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset 4))) (<= entry_point_~i~2 1))), 46028#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= (* 4 entry_point_~i~2) 8) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (* 4 entry_point_~i~2) 7)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46029#(and (or (<= (* 4 entry_point_~i~2) 11) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (<= (* 4 entry_point_~i~2) 12) (or (<= (* 4 entry_point_~i~2) 11) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) (- 4)))) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46030#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= entry_point_~len~0 2)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset))) (<= (* 4 entry_point_~len~0) 11)) (<= (* 4 entry_point_~len~0) 12) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 46031#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 46032#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~len |free_17_#in~len|)), 46033#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~len |free_17_#in~len|)), 46034#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= free_17_~array.offset 0)) (and (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))))) (= free_17_~len |free_17_#in~len|)), 46035#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (< 3 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~len |free_17_#in~len|)), 46036#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (< 3 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~len |free_17_#in~len|)), 46037#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))))) (not (= free_17_~array.offset 0)) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~len |free_17_#in~len|)), 46038#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (<= 9 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|)) (and (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))))) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~len |free_17_#in~len|)), 46039#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|)) (<= 13 (+ free_17_~array.offset (* 4 free_17_~len))) (and (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))))) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ free_17_~i~1 1) free_17_~len))) (= free_17_~len |free_17_#in~len|)), 46040#(and (or (and (or (<= 13 (* 4 free_17_~len)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1))))) (or (<= 13 (* 4 free_17_~len)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= |#valid| |old(#valid)|)) (<= 12 (* 4 free_17_~len))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))) (= free_17_~len |free_17_#in~len|)), 46041#(and (or (= |#valid| |old(#valid)|) (and (or (<= 13 (* 4 free_17_~len)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))))) (<= 12 (* 4 free_17_~len))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1))))) (<= 12 (* 4 free_17_~len)))) (= free_17_~len |free_17_#in~len|)), 46042#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (<= 12 (* 4 |free_17_#in~len|))) (= |#valid| |old(#valid)|) (and (<= 12 (* 4 |free_17_#in~len|)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4)))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (<= 4 |free_17_#in~len|))] [2018-02-04 03:20:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:13,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:20:13,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:20:13,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:20:13,947 INFO L87 Difference]: Start difference. First operand 539 states and 635 transitions. Second operand 27 states. [2018-02-04 03:20:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:14,838 INFO L93 Difference]: Finished difference Result 586 states and 684 transitions. [2018-02-04 03:20:14,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:20:14,839 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-02-04 03:20:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:14,840 INFO L225 Difference]: With dead ends: 586 [2018-02-04 03:20:14,840 INFO L226 Difference]: Without dead ends: 557 [2018-02-04 03:20:14,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:20:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-04 03:20:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 514. [2018-02-04 03:20:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-02-04 03:20:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 609 transitions. [2018-02-04 03:20:14,844 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 609 transitions. Word has length 82 [2018-02-04 03:20:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:14,844 INFO L432 AbstractCegarLoop]: Abstraction has 514 states and 609 transitions. [2018-02-04 03:20:14,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:20:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 609 transitions. [2018-02-04 03:20:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 03:20:14,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:14,845 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:14,845 INFO L371 AbstractCegarLoop]: === Iteration 75 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash 502230069, now seen corresponding path program 4 times [2018-02-04 03:20:14,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:14,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:15,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:15,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:20:15,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:15,023 INFO L182 omatonBuilderFactory]: Interpolants [47169#true, 47170#false, 47171#(= 0 |ldv_malloc_#t~malloc2.offset|), 47172#(= 0 |ldv_malloc_#res.offset|), 47173#(= 0 |entry_point_#t~ret12.offset|), 47174#(= 0 entry_point_~array~0.offset), 47175#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 47176#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 47177#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 47178#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 2)), 47179#(and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 47180#(and (or (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 47181#(and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 47182#(and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 47183#(and (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 12 (+ (* 4 alloc_17_~len) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 47184#(and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= |alloc_17_#in~array.offset| 0)) (<= 3 alloc_17_~len))), 47185#(or (<= 3 |alloc_17_#in~len|) (not (= |alloc_17_#in~array.offset| 0)))] [2018-02-04 03:20:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:15,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:20:15,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:20:15,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:20:15,024 INFO L87 Difference]: Start difference. First operand 514 states and 609 transitions. Second operand 17 states. [2018-02-04 03:20:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:15,156 INFO L93 Difference]: Finished difference Result 463 states and 544 transitions. [2018-02-04 03:20:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:20:15,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-02-04 03:20:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:15,158 INFO L225 Difference]: With dead ends: 463 [2018-02-04 03:20:15,158 INFO L226 Difference]: Without dead ends: 422 [2018-02-04 03:20:15,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:20:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-04 03:20:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 416. [2018-02-04 03:20:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-02-04 03:20:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 494 transitions. [2018-02-04 03:20:15,161 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 494 transitions. Word has length 85 [2018-02-04 03:20:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:15,161 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 494 transitions. [2018-02-04 03:20:15,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:20:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 494 transitions. [2018-02-04 03:20:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 03:20:15,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:15,161 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:15,161 INFO L371 AbstractCegarLoop]: === Iteration 76 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:15,161 INFO L82 PathProgramCache]: Analyzing trace with hash -323339655, now seen corresponding path program 5 times [2018-02-04 03:20:15,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:15,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:20:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:15,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:15,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:20:15,273 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:15,274 INFO L182 omatonBuilderFactory]: Interpolants [48071#true, 48072#false, 48073#(= 0 |ldv_malloc_#t~malloc2.offset|), 48074#(= 0 |ldv_malloc_#res.offset|), 48075#(= 0 |entry_point_#t~ret12.offset|), 48076#(= entry_point_~array~0.offset 0), 48077#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 48078#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 48079#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 48080#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 48081#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 48082#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 48083#(and (= free_17_~len |free_17_#in~len|) (<= free_17_~i~1 1)), 48084#(and (<= free_17_~i~1 2) (= free_17_~len |free_17_#in~len|)), 48085#(and (<= free_17_~i~1 3) (= free_17_~len |free_17_#in~len|)), 48086#(<= |free_17_#in~len| 3)] [2018-02-04 03:20:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:15,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:20:15,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:20:15,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:20:15,274 INFO L87 Difference]: Start difference. First operand 416 states and 494 transitions. Second operand 16 states. [2018-02-04 03:20:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:15,388 INFO L93 Difference]: Finished difference Result 522 states and 618 transitions. [2018-02-04 03:20:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:20:15,389 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-02-04 03:20:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:15,390 INFO L225 Difference]: With dead ends: 522 [2018-02-04 03:20:15,390 INFO L226 Difference]: Without dead ends: 504 [2018-02-04 03:20:15,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:20:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-02-04 03:20:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 456. [2018-02-04 03:20:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-02-04 03:20:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 552 transitions. [2018-02-04 03:20:15,393 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 552 transitions. Word has length 86 [2018-02-04 03:20:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:15,393 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 552 transitions. [2018-02-04 03:20:15,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:20:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 552 transitions. [2018-02-04 03:20:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 03:20:15,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:15,394 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:15,394 INFO L371 AbstractCegarLoop]: === Iteration 77 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1735840101, now seen corresponding path program 2 times [2018-02-04 03:20:15,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:15,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:15,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:15,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:20:15,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:15,858 INFO L182 omatonBuilderFactory]: Interpolants [49088#(= |#valid| |old(#valid)|), 49089#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 49090#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 49091#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret4.base|)) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 49092#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 49093#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (or (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (+ (* (- 4) alloc_17_~len) 4))))))) (<= 9 (* 4 alloc_17_~len))) (<= 8 (* 4 alloc_17_~len))) (not (= |alloc_17_#in~array.offset| 0)))), 49094#(or (and (or (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (+ (* 4 (- |alloc_17_#in~len|)) 4))))) (<= 9 (* 4 |alloc_17_#in~len|))) (<= 8 (* 4 |alloc_17_#in~len|))) (not (= |alloc_17_#in~array.offset| 0))), 49095#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))))), 49096#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 49097#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~i~1 0))), 49098#(and (or (not (= free_17_~array.offset 0)) (<= free_17_~i~1 1)) (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|)), 49099#(or (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4))))) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 49100#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4))))) |free_17_#in~array.base|) (not (= |free_17_#in~array.offset| 0))), 49101#(= 1 (select |#valid| entry_point_~array~0.base)), 49074#true, 49075#false, 49076#(= 0 |ldv_malloc_#t~malloc2.offset|), 49077#(= 0 |ldv_malloc_#res.offset|), 49078#(= 0 |entry_point_#t~ret12.offset|), 49079#(= entry_point_~array~0.offset 0), 49080#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 49081#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 49082#(and (or (= 8 (* 4 entry_point_~i~2)) (<= (* 4 entry_point_~i~2) 7)) (= entry_point_~array~0.offset 0)), 49083#(and (= entry_point_~array~0.offset 0) (or (= 8 (* 4 entry_point_~len~0)) (<= (* 4 entry_point_~len~0) 7))), 49084#(and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 49085#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (or (and (= (select |#valid| alloc_17_~array.base) 1) (= 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))), 49086#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (or (and (= (select |#valid| alloc_17_~array.base) 1) (= 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))), 49087#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (= (select |#valid| alloc_17_~array.base) 1) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~len |alloc_17_#in~len|) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))] [2018-02-04 03:20:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:20:15,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:20:15,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:20:15,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:20:15,859 INFO L87 Difference]: Start difference. First operand 456 states and 552 transitions. Second operand 28 states. [2018-02-04 03:20:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:16,869 INFO L93 Difference]: Finished difference Result 489 states and 576 transitions. [2018-02-04 03:20:16,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:20:16,869 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-02-04 03:20:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:16,871 INFO L225 Difference]: With dead ends: 489 [2018-02-04 03:20:16,871 INFO L226 Difference]: Without dead ends: 489 [2018-02-04 03:20:16,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=2512, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 03:20:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-02-04 03:20:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 461. [2018-02-04 03:20:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-02-04 03:20:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 558 transitions. [2018-02-04 03:20:16,874 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 558 transitions. Word has length 85 [2018-02-04 03:20:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:16,875 INFO L432 AbstractCegarLoop]: Abstraction has 461 states and 558 transitions. [2018-02-04 03:20:16,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:20:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 558 transitions. [2018-02-04 03:20:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:20:16,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:16,875 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:16,875 INFO L371 AbstractCegarLoop]: === Iteration 78 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1615103595, now seen corresponding path program 1 times [2018-02-04 03:20:16,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:16,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 03:20:17,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:17,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:20:17,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:20:17,221 INFO L182 omatonBuilderFactory]: Interpolants [50112#(and (= alloc_17_~array.offset 0) (or (= alloc_17_~i~0 0) (<= (+ alloc_17_~i~0 1) 0))), 50113#(and (= alloc_17_~array.offset 0) (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~i~0 0)) (<= (+ alloc_17_~i~0 1) 0))), 50114#(and (= alloc_17_~array.offset 0) (or (and (= alloc_17_~i~0 0) (= 0 alloc_17_~p~0.offset)) (<= (+ alloc_17_~i~0 1) 0))), 50115#(and (= alloc_17_~array.offset 0) (or (and (= alloc_17_~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (<= (+ alloc_17_~i~0 1) 0))), 50116#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (or (<= alloc_17_~i~0 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)))), 50117#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)))), 50118#(and (= alloc_17_~array.offset 0) (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)) (<= alloc_17_~j~0 1)) (<= alloc_17_~j~0 0))), 50119#(and (= alloc_17_~array.offset 0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 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)), 50120#(and (<= 0 alloc_17_~j~0) (= alloc_17_~array.offset 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)), 50121#(= 0 |alloc_17_#t~mem7.offset|), 50104#true, 50105#false, 50106#(= 0 |ldv_malloc_#t~malloc2.offset|), 50107#(= 0 |ldv_malloc_#res.offset|), 50108#(= 0 |entry_point_#t~ret12.offset|), 50109#(= entry_point_~array~0.offset 0), 50110#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 50111#(= 0 |alloc_17_#in~array.offset|)] [2018-02-04 03:20:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 03:20:17,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:20:17,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:20:17,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:20:17,222 INFO L87 Difference]: Start difference. First operand 461 states and 558 transitions. Second operand 18 states. [2018-02-04 03:20:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:17,556 INFO L93 Difference]: Finished difference Result 468 states and 562 transitions. [2018-02-04 03:20:17,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:20:17,556 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-02-04 03:20:17,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:17,558 INFO L225 Difference]: With dead ends: 468 [2018-02-04 03:20:17,558 INFO L226 Difference]: Without dead ends: 468 [2018-02-04 03:20:17,558 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:20:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-04 03:20:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 461. [2018-02-04 03:20:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-02-04 03:20:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 557 transitions. [2018-02-04 03:20:17,564 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 557 transitions. Word has length 89 [2018-02-04 03:20:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:17,564 INFO L432 AbstractCegarLoop]: Abstraction has 461 states and 557 transitions. [2018-02-04 03:20:17,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:20:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 557 transitions. [2018-02-04 03:20:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:20:17,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:17,565 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:17,565 INFO L371 AbstractCegarLoop]: === Iteration 79 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1615103596, now seen corresponding path program 3 times [2018-02-04 03:20:17,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:17,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 03:20:18,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:18,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 03:20:18,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:18,568 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:20:18,568 INFO L182 omatonBuilderFactory]: Interpolants [51085#true, 51086#false, 51087#(= 0 |ldv_malloc_#t~malloc2.offset|), 51088#(= 0 |ldv_malloc_#res.offset|), 51089#(= 0 |entry_point_#t~ret12.offset|), 51090#(= entry_point_~array~0.offset 0), 51091#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 51092#(and (or (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 2)) (= (+ entry_point_~len~0 3) (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2))) (= entry_point_~array~0.offset 0)), 51093#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 4)) (= entry_point_~array~0.offset 0)), 51094#(= 0 |alloc_17_#in~array.offset|), 51095#(and (= alloc_17_~array.offset 0) (or (= alloc_17_~i~0 0) (<= (+ alloc_17_~i~0 1) 0))), 51096#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 51097#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 51098#(and (= alloc_17_~array.offset 0) (or (and (= alloc_17_~i~0 0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))) (<= (+ alloc_17_~i~0 1) 0))), 51099#(and (or (and (= alloc_17_~i~0 0) (= 1 (select |#valid| alloc_17_~p~0.base))) (<= (+ alloc_17_~i~0 1) 0)) (= alloc_17_~array.offset 0)), 51100#(and (or (and (= alloc_17_~i~0 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))) (<= (+ alloc_17_~i~0 1) 0)) (= alloc_17_~array.offset 0)), 51101#(and (= alloc_17_~array.offset 0) (or (<= alloc_17_~i~0 0) (and (<= alloc_17_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 51102#(= |#valid| |old(#valid)|), 51103#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 51104#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 51105#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 1) (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (not (= |alloc_17_#t~ret4.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_~i~0 0))), 51106#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 1) (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| 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 (= 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)))) (<= alloc_17_~i~0 0))), 51107#(and (= alloc_17_~array.offset 0) (or (<= alloc_17_~i~0 0) (and (<= alloc_17_~i~0 1) (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))) (= 1 (select |#valid| (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)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 51108#(and (= alloc_17_~array.offset 0) (or (<= alloc_17_~i~0 1) (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) 0)) (<= alloc_17_~i~0 2) (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))) (= 1 (select |#valid| (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)))))), 51109#(and (= alloc_17_~array.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= alloc_17_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) 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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (<= alloc_17_~j~0 0))), 51110#(and (or (and (<= alloc_17_~j~0 1) (= 1 (select (store |#valid| |alloc_17_#t~mem7.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (= |alloc_17_#t~mem7.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) 0)) (= 1 (select |#valid| |alloc_17_#t~mem7.base|))) (<= alloc_17_~j~0 0)) (= alloc_17_~array.offset 0)), 51111#(and (or (and (<= alloc_17_~j~0 1) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (<= alloc_17_~j~0 0)) (= alloc_17_~array.offset 0)), 51112#(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)), 51113#(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)))))), 51114#(= (select |#valid| |alloc_17_#t~mem7.base|) 1)] [2018-02-04 03:20:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 03:20:18,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 03:20:18,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 03:20:18,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:20:18,568 INFO L87 Difference]: Start difference. First operand 461 states and 557 transitions. Second operand 30 states. [2018-02-04 03:20:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:19,360 INFO L93 Difference]: Finished difference Result 468 states and 560 transitions. [2018-02-04 03:20:19,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:20:19,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 89 [2018-02-04 03:20:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:19,361 INFO L225 Difference]: With dead ends: 468 [2018-02-04 03:20:19,361 INFO L226 Difference]: Without dead ends: 468 [2018-02-04 03:20:19,361 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=393, Invalid=2687, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:20:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-04 03:20:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 461. [2018-02-04 03:20:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-02-04 03:20:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 556 transitions. [2018-02-04 03:20:19,365 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 556 transitions. Word has length 89 [2018-02-04 03:20:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:19,365 INFO L432 AbstractCegarLoop]: Abstraction has 461 states and 556 transitions. [2018-02-04 03:20:19,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 03:20:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 556 transitions. [2018-02-04 03:20:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 03:20:19,365 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:19,365 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:19,365 INFO L371 AbstractCegarLoop]: === Iteration 80 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:19,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1759368180, now seen corresponding path program 7 times [2018-02-04 03:20:19,366 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:19,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:19,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:19,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:20:19,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:19,490 INFO L182 omatonBuilderFactory]: Interpolants [52096#true, 52097#false, 52098#(= 0 |ldv_malloc_#t~malloc2.offset|), 52099#(= 0 |ldv_malloc_#res.offset|), 52100#(= 0 |entry_point_#t~ret12.offset|), 52101#(= 0 entry_point_~array~0.offset), 52102#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 52103#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 52104#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 52105#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 52106#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 4)), 52107#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 4)), 52108#(and (<= |free_17_#in~len| 4) (= 0 |free_17_#in~array.offset|)), 52109#(and (<= free_17_~len 4) (= free_17_~array.offset 0)), 52110#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 16)) (= free_17_~array.offset 0)), 52111#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 52112#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 52113#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0)), 52114#(<= free_17_~len (+ free_17_~i~1 1)), 52115#(<= free_17_~len free_17_~i~1)] [2018-02-04 03:20:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:19,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:20:19,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:20:19,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:20:19,490 INFO L87 Difference]: Start difference. First operand 461 states and 556 transitions. Second operand 20 states. [2018-02-04 03:20:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:19,648 INFO L93 Difference]: Finished difference Result 649 states and 775 transitions. [2018-02-04 03:20:19,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:20:19,649 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2018-02-04 03:20:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:19,650 INFO L225 Difference]: With dead ends: 649 [2018-02-04 03:20:19,650 INFO L226 Difference]: Without dead ends: 649 [2018-02-04 03:20:19,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:20:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-02-04 03:20:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 621. [2018-02-04 03:20:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-02-04 03:20:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 761 transitions. [2018-02-04 03:20:19,655 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 761 transitions. Word has length 87 [2018-02-04 03:20:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:19,656 INFO L432 AbstractCegarLoop]: Abstraction has 621 states and 761 transitions. [2018-02-04 03:20:19,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:20:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 761 transitions. [2018-02-04 03:20:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 03:20:19,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:19,657 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:19,657 INFO L371 AbstractCegarLoop]: === Iteration 81 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1631361932, now seen corresponding path program 1 times [2018-02-04 03:20:19,658 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:19,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:20:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:20:20,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:20,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:20:20,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:20,080 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:20:20,080 INFO L182 omatonBuilderFactory]: Interpolants [53408#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 53409#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 53410#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 53411#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 53412#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 53413#(= |#valid| |old(#valid)|), 53414#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 53415#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 53416#(and (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 53417#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 53418#(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)))))), 53419#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 1) alloc_17_~i~0)), 53420#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 2) alloc_17_~i~0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 53421#(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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))), 53422#(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)))), 53423#(and (= alloc_17_~array.offset 0) (or (and (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (<= alloc_17_~j~0 0)) (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))))), 53424#(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))), 53425#(and (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 53426#(= 1 (select |#valid| alloc_17_~array.base)), 53405#true, 53406#false, 53407#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|))] [2018-02-04 03:20:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:20:20,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:20:20,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:20:20,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:20:20,081 INFO L87 Difference]: Start difference. First operand 621 states and 761 transitions. Second operand 22 states. [2018-02-04 03:20:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:20,741 INFO L93 Difference]: Finished difference Result 637 states and 778 transitions. [2018-02-04 03:20:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:20:20,741 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2018-02-04 03:20:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:20,742 INFO L225 Difference]: With dead ends: 637 [2018-02-04 03:20:20,742 INFO L226 Difference]: Without dead ends: 637 [2018-02-04 03:20:20,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:20:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-02-04 03:20:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 628. [2018-02-04 03:20:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-02-04 03:20:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 769 transitions. [2018-02-04 03:20:20,747 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 769 transitions. Word has length 91 [2018-02-04 03:20:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:20,747 INFO L432 AbstractCegarLoop]: Abstraction has 628 states and 769 transitions. [2018-02-04 03:20:20,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:20:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 769 transitions. [2018-02-04 03:20:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:20:20,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:20,748 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:20,748 INFO L371 AbstractCegarLoop]: === Iteration 82 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1464249349, now seen corresponding path program 4 times [2018-02-04 03:20:20,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:20,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:21,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:21,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:20:21,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:21,041 INFO L182 omatonBuilderFactory]: Interpolants [54724#true, 54725#false, 54726#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 54727#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 54728#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 54729#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 54730#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 54731#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 54732#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 54733#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 54734#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))), 54735#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 12 entry_point_~array~0.offset))))), 54736#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 54737#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 54738#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 4)) (not (= free_17_~array.offset 0)))), 54739#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 8) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= free_17_~array.offset 0)))), 54740#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 12)))), 54741#(or (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 12))) (* 4 free_17_~i~1))) |free_17_#in~array.base|)), 54742#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 12))) (* 4 free_17_~i~1))) |free_17_#in~array.base|)), 54743#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:20:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:21,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:20:21,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:20:21,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:20:21,041 INFO L87 Difference]: Start difference. First operand 628 states and 769 transitions. Second operand 20 states. [2018-02-04 03:20:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:21,889 INFO L93 Difference]: Finished difference Result 715 states and 874 transitions. [2018-02-04 03:20:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:20:21,889 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-02-04 03:20:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:21,891 INFO L225 Difference]: With dead ends: 715 [2018-02-04 03:20:21,891 INFO L226 Difference]: Without dead ends: 715 [2018-02-04 03:20:21,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1869, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:20:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-02-04 03:20:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 634. [2018-02-04 03:20:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-02-04 03:20:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 776 transitions. [2018-02-04 03:20:21,897 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 776 transitions. Word has length 89 [2018-02-04 03:20:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:21,897 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 776 transitions. [2018-02-04 03:20:21,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:20:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 776 transitions. [2018-02-04 03:20:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 03:20:21,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:21,898 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:21,898 INFO L371 AbstractCegarLoop]: === Iteration 83 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1006133619, now seen corresponding path program 2 times [2018-02-04 03:20:21,898 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:21,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:23,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:23,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:20:23,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:23,642 INFO L182 omatonBuilderFactory]: Interpolants [56146#true, 56147#false, 56148#(= |#valid| |old(#valid)|), 56149#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 56150#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56151#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56152#(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|))))), 56153#(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) (= entry_point_~i~2 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56154#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= 1 entry_point_~i~2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56155#(and (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56156#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 56157#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 56158#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= (select |old(#valid)| |alloc_17_#t~ret4.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)))), 56159#(and (or (and (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |old(#valid)| 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))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56160#(and (or (and (= (select |#valid| alloc_17_~array.base) 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= 1 (select |#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|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56161#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (= 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|))))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56162#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 56163#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 56164#(and (or (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret4.base|)) (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (not (= |alloc_17_#t~ret4.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~ret4.base| (select |#valid| |alloc_17_#t~ret4.base|))) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= (select |old(#valid)| |alloc_17_#t~ret4.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 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))), 56165#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= alloc_17_~i~0 1) (not (= 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) 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) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) 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) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 56166#(or (not (= |alloc_17_#in~array.offset| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4)))))) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4)))) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 4))))) 0)))), 56167#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (= |#valid| (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) 0))), 56168#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 56169#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0) (= (store |#valid| |free_17_#t~mem10.base| 0) (store |old(#valid)| |free_17_#t~mem10.base| (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#t~mem10.base|))) (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) |free_17_#t~mem10.base|)))), 56170#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) |#valid|)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 56171#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (<= free_17_~i~1 1) (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (and (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0) (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) |#valid|) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)))))))), 56172#(or (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))) (or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= (store |#valid| |free_17_#t~mem10.base| 0) (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (store |#valid| |free_17_#t~mem10.base| 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) |free_17_#t~mem10.base| (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#t~mem10.base|)))))) (not (= |free_17_#in~array.offset| 0))), 56173#(or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))) (and (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4) (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4))))))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)))) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))) (not (= |free_17_#in~array.offset| 0))), 56174#(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:20:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:23,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:20:23,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:20:23,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:20:23,642 INFO L87 Difference]: Start difference. First operand 634 states and 776 transitions. Second operand 29 states. [2018-02-04 03:20:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:25,392 INFO L93 Difference]: Finished difference Result 656 states and 787 transitions. [2018-02-04 03:20:25,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:20:25,392 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-02-04 03:20:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:25,394 INFO L225 Difference]: With dead ends: 656 [2018-02-04 03:20:25,394 INFO L226 Difference]: Without dead ends: 641 [2018-02-04 03:20:25,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:20:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-02-04 03:20:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 623. [2018-02-04 03:20:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-02-04 03:20:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 763 transitions. [2018-02-04 03:20:25,401 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 763 transitions. Word has length 88 [2018-02-04 03:20:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:25,402 INFO L432 AbstractCegarLoop]: Abstraction has 623 states and 763 transitions. [2018-02-04 03:20:25,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:20:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 763 transitions. [2018-02-04 03:20:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 03:20:25,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:25,402 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:25,402 INFO L371 AbstractCegarLoop]: === Iteration 84 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1077113850, now seen corresponding path program 5 times [2018-02-04 03:20:25,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:25,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:25,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:25,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:20:25,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:25,511 INFO L182 omatonBuilderFactory]: Interpolants [57476#true, 57477#false, 57478#(= 0 |ldv_malloc_#t~malloc2.offset|), 57479#(= 0 |ldv_malloc_#res.offset|), 57480#(= 0 |entry_point_#t~ret12.offset|), 57481#(= entry_point_~array~0.offset 0), 57482#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 57483#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 57484#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 57485#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 57486#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 57487#(and (= entry_point_~array~0.offset 0) (<= 20 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 57488#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 57489#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 57490#(and (<= alloc_17_~i~0 2) (= alloc_17_~len |alloc_17_#in~len|)), 57491#(and (<= alloc_17_~i~0 3) (= alloc_17_~len |alloc_17_#in~len|)), 57492#(<= |alloc_17_#in~len| 3)] [2018-02-04 03:20:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 35 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:25,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:20:25,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:20:25,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:20:25,512 INFO L87 Difference]: Start difference. First operand 623 states and 763 transitions. Second operand 17 states. [2018-02-04 03:20:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:25,690 INFO L93 Difference]: Finished difference Result 673 states and 819 transitions. [2018-02-04 03:20:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:20:25,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 97 [2018-02-04 03:20:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:25,692 INFO L225 Difference]: With dead ends: 673 [2018-02-04 03:20:25,692 INFO L226 Difference]: Without dead ends: 673 [2018-02-04 03:20:25,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:20:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-02-04 03:20:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 632. [2018-02-04 03:20:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-02-04 03:20:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 774 transitions. [2018-02-04 03:20:25,697 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 774 transitions. Word has length 97 [2018-02-04 03:20:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:25,697 INFO L432 AbstractCegarLoop]: Abstraction has 632 states and 774 transitions. [2018-02-04 03:20:25,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:20:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 774 transitions. [2018-02-04 03:20:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:20:25,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:25,698 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2018-02-04 03:20:25,698 INFO L371 AbstractCegarLoop]: === Iteration 85 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1241190988, now seen corresponding path program 6 times [2018-02-04 03:20:25,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:25,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:20:26,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:26,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:20:26,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:20:26,317 INFO L182 omatonBuilderFactory]: Interpolants [58816#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0)))), 58817#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0)))), 58818#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~len |alloc_17_#in~len|) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (not (= alloc_17_~array.offset 0)))), 58819#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 58820#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 58821#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| 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|))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 58822#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 58823#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= 0 |alloc_17_#in~array.offset|)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 4 alloc_17_~len))), 58824#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= 0 |alloc_17_#in~array.offset|)) (<= 4 |alloc_17_#in~len|)), 58825#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 58826#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 58827#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 58828#(= 0 |free_17_#t~mem10.offset|), 58804#true, 58805#false, 58806#(= 0 |ldv_malloc_#t~malloc2.offset|), 58807#(= 0 |ldv_malloc_#res.offset|), 58808#(= 0 |entry_point_#t~ret12.offset|), 58809#(= 0 entry_point_~array~0.offset), 58810#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 58811#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 58812#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 58813#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 58814#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 3)), 58815#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0))))] [2018-02-04 03:20:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:20:26,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:20:26,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:20:26,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:26,318 INFO L87 Difference]: Start difference. First operand 632 states and 774 transitions. Second operand 25 states. [2018-02-04 03:20:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:27,097 INFO L93 Difference]: Finished difference Result 645 states and 780 transitions. [2018-02-04 03:20:27,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:20:27,097 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 89 [2018-02-04 03:20:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:27,099 INFO L225 Difference]: With dead ends: 645 [2018-02-04 03:20:27,099 INFO L226 Difference]: Without dead ends: 645 [2018-02-04 03:20:27,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:20:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-02-04 03:20:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 632. [2018-02-04 03:20:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-02-04 03:20:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 772 transitions. [2018-02-04 03:20:27,104 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 772 transitions. Word has length 89 [2018-02-04 03:20:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:27,105 INFO L432 AbstractCegarLoop]: Abstraction has 632 states and 772 transitions. [2018-02-04 03:20:27,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:20:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 772 transitions. [2018-02-04 03:20:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 03:20:27,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:27,105 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:27,105 INFO L371 AbstractCegarLoop]: === Iteration 86 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1660431133, now seen corresponding path program 7 times [2018-02-04 03:20:27,106 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:27,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:27,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:27,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:20:27,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:27,225 INFO L182 omatonBuilderFactory]: Interpolants [60140#true, 60141#false, 60142#(= 0 |ldv_malloc_#t~malloc2.offset|), 60143#(= 0 |ldv_malloc_#res.offset|), 60144#(= 0 |entry_point_#t~ret12.offset|), 60145#(= entry_point_~array~0.offset 0), 60146#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 60147#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 60148#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 60149#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 60150#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 60151#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 60152#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 60153#(and (<= alloc_17_~i~0 2) (= alloc_17_~len |alloc_17_#in~len|)), 60154#(and (<= alloc_17_~i~0 3) (= alloc_17_~len |alloc_17_#in~len|)), 60155#(<= |alloc_17_#in~len| 3)] [2018-02-04 03:20:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:20:27,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:20:27,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:20:27,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:20:27,225 INFO L87 Difference]: Start difference. First operand 632 states and 772 transitions. Second operand 16 states. [2018-02-04 03:20:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:27,362 INFO L93 Difference]: Finished difference Result 668 states and 811 transitions. [2018-02-04 03:20:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:20:27,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2018-02-04 03:20:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:27,365 INFO L225 Difference]: With dead ends: 668 [2018-02-04 03:20:27,365 INFO L226 Difference]: Without dead ends: 668 [2018-02-04 03:20:27,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:20:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-04 03:20:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 632. [2018-02-04 03:20:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-02-04 03:20:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 771 transitions. [2018-02-04 03:20:27,371 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 771 transitions. Word has length 93 [2018-02-04 03:20:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:27,371 INFO L432 AbstractCegarLoop]: Abstraction has 632 states and 771 transitions. [2018-02-04 03:20:27,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:20:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 771 transitions. [2018-02-04 03:20:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:20:27,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:27,372 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2018-02-04 03:20:27,372 INFO L371 AbstractCegarLoop]: === Iteration 87 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:27,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1241190989, now seen corresponding path program 3 times [2018-02-04 03:20:27,373 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:27,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 62 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:20:28,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:28,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 03:20:28,066 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:20:28,067 INFO L182 omatonBuilderFactory]: Interpolants [61462#true, 61463#false, 61464#(= 0 |ldv_malloc_#t~malloc2.offset|), 61465#(= 0 |ldv_malloc_#res.offset|), 61466#(= 0 |entry_point_#t~ret12.offset|), 61467#(= 0 entry_point_~array~0.offset), 61468#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 61469#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 61470#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 61471#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 61472#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 3)), 61473#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0)))), 61474#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 61475#(= (select |#valid| |ldv_malloc_#res.base|) 1), 61476#(and (or (and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 61477#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= alloc_17_~len |alloc_17_#in~len|) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (not (= alloc_17_~array.offset 0)))), 61478#(and (or (and (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (= alloc_17_~len |alloc_17_#in~len|) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 1 (select |#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|)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 61479#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)) 1)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 61480#(= |#valid| |old(#valid)|), 61481#(and (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 61482#(and (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|))))), 61483#(and (or (and (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)))) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 61484#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (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)))) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 61485#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 61486#(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|))))), 61487#(and (or (and (= 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))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 61488#(or (not (= 0 |alloc_17_#in~array.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (and (= alloc_17_~len |alloc_17_#in~len|) (<= 4 alloc_17_~len))), 61489#(or (not (= 0 |alloc_17_#in~array.offset|)) (<= 4 |alloc_17_#in~len|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 61490#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 61491#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|)), 61492#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 61493#(= 1 (select |#valid| |free_17_#t~mem10.base|))] [2018-02-04 03:20:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 62 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:20:28,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 03:20:28,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 03:20:28,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:20:28,067 INFO L87 Difference]: Start difference. First operand 632 states and 771 transitions. Second operand 32 states. [2018-02-04 03:20:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:29,219 INFO L93 Difference]: Finished difference Result 642 states and 778 transitions. [2018-02-04 03:20:29,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:20:29,220 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 89 [2018-02-04 03:20:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:29,221 INFO L225 Difference]: With dead ends: 642 [2018-02-04 03:20:29,221 INFO L226 Difference]: Without dead ends: 642 [2018-02-04 03:20:29,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=271, Invalid=2809, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:20:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-02-04 03:20:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 632. [2018-02-04 03:20:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-02-04 03:20:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 770 transitions. [2018-02-04 03:20:29,226 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 770 transitions. Word has length 89 [2018-02-04 03:20:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:29,226 INFO L432 AbstractCegarLoop]: Abstraction has 632 states and 770 transitions. [2018-02-04 03:20:29,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 03:20:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 770 transitions. [2018-02-04 03:20:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 03:20:29,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:29,227 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:29,227 INFO L371 AbstractCegarLoop]: === Iteration 88 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1024810003, now seen corresponding path program 1 times [2018-02-04 03:20:29,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:29,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:20:30,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:30,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:20:30,336 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:20:30,336 INFO L182 omatonBuilderFactory]: Interpolants [62816#true, 62817#false, 62818#(= 0 |ldv_malloc_#t~malloc2.offset|), 62819#(= 0 |ldv_malloc_#res.offset|), 62820#(= 0 |entry_point_#t~ret12.offset|), 62821#(= entry_point_~array~0.offset 0), 62822#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 62823#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 62824#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 62825#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0)), 62826#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 62827#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 62828#(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))), 62829#(and (or (and (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= 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))), 62830#(and (or (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 62831#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 62832#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))) (not (= alloc_17_~array.offset 0)))), 62833#(or (<= 1 alloc_17_~j~0) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= |alloc_17_#in~array.offset| 0))), 62834#(or (<= 0 alloc_17_~j~0) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= |alloc_17_#in~array.offset| 0))), 62835#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= |alloc_17_#in~array.offset| 0))), 62836#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0)), 62837#(= |#valid| |old(#valid)|), 62838#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 62839#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 62840#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (and (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~i~1 0)))), 62841#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (<= 1 free_17_~i~1) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (<= free_17_~i~1 1)) (not (= free_17_~array.offset 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|)))), 62842#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4)))))))), 62843#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 4))))))) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 62844#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:20:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:20:30,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:20:30,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:20:30,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:20:30,337 INFO L87 Difference]: Start difference. First operand 632 states and 770 transitions. Second operand 29 states. [2018-02-04 03:20:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:31,752 INFO L93 Difference]: Finished difference Result 676 states and 817 transitions. [2018-02-04 03:20:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:20:31,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-02-04 03:20:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:31,754 INFO L225 Difference]: With dead ends: 676 [2018-02-04 03:20:31,754 INFO L226 Difference]: Without dead ends: 676 [2018-02-04 03:20:31,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=261, Invalid=2495, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 03:20:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-02-04 03:20:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 651. [2018-02-04 03:20:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-02-04 03:20:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 798 transitions. [2018-02-04 03:20:31,762 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 798 transitions. Word has length 89 [2018-02-04 03:20:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:31,762 INFO L432 AbstractCegarLoop]: Abstraction has 651 states and 798 transitions. [2018-02-04 03:20:31,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:20:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 798 transitions. [2018-02-04 03:20:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 03:20:31,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:31,763 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:31,763 INFO L371 AbstractCegarLoop]: === Iteration 89 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash -287528861, now seen corresponding path program 8 times [2018-02-04 03:20:31,763 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:31,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:32,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:32,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:20:32,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:32,121 INFO L182 omatonBuilderFactory]: Interpolants [64221#true, 64222#false, 64223#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 64224#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 64225#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 64226#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 64227#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 64228#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 64229#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 64230#(and (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 64231#(and (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))), 64232#(and (<= (* 4 entry_point_~i~2) 16) (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset 12)))) (<= (* 4 entry_point_~i~2) 15))), 64233#(and (<= (* 4 entry_point_~i~2) 20) (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))) (<= entry_point_~i~2 4)) (= entry_point_~array~0.offset 0)), 64234#(and (<= (* 4 entry_point_~len~0) 20) (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))) (<= (* 4 entry_point_~len~0) 19))), 64235#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 64236#(and (<= (* 4 |free_17_#in~len|) 20) (= 0 |free_17_#in~array.offset|) (or (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12))) (<= |free_17_#in~len| 4))), 64237#(and (= free_17_~array.offset 0) (<= (* 4 free_17_~len) 20) (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 12))) (<= (* 4 free_17_~len) 19))), 64238#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 20)) (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12))))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 16))) (= free_17_~array.offset 0)), 64239#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 16)) (= free_17_~array.offset 0) (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 15)))), 64240#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 64241#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))))) (= free_17_~array.offset 0)), 64242#(or (and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))) (<= free_17_~len (+ free_17_~i~1 1))), 64243#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len (+ free_17_~i~1 1))), 64244#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len free_17_~i~1)), 64245#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:32,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:20:32,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:20:32,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:20:32,121 INFO L87 Difference]: Start difference. First operand 651 states and 798 transitions. Second operand 25 states. [2018-02-04 03:20:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:33,251 INFO L93 Difference]: Finished difference Result 719 states and 876 transitions. [2018-02-04 03:20:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 03:20:33,251 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2018-02-04 03:20:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:33,252 INFO L225 Difference]: With dead ends: 719 [2018-02-04 03:20:33,252 INFO L226 Difference]: Without dead ends: 719 [2018-02-04 03:20:33,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=443, Invalid=2749, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 03:20:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-02-04 03:20:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 695. [2018-02-04 03:20:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-02-04 03:20:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 854 transitions. [2018-02-04 03:20:33,257 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 854 transitions. Word has length 91 [2018-02-04 03:20:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:33,257 INFO L432 AbstractCegarLoop]: Abstraction has 695 states and 854 transitions. [2018-02-04 03:20:33,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:20:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 854 transitions. [2018-02-04 03:20:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:20:33,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:33,258 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:33,258 INFO L371 AbstractCegarLoop]: === Iteration 90 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1764569315, now seen corresponding path program 6 times [2018-02-04 03:20:33,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:33,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:34,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:34,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 03:20:34,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:34,572 INFO L182 omatonBuilderFactory]: Interpolants [65729#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 65728#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 65731#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 65730#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret12.base| (select |#valid| |entry_point_#t~ret12.base|))) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0)), 65733#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 65732#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 65735#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (or (<= (+ entry_point_~i~2 entry_point_~array~0.offset 4) entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= entry_point_~len~0 (+ entry_point_~i~2 entry_point_~array~0.offset 2))) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 65734#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 65737#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (or (<= entry_point_~len~0 (+ entry_point_~i~2 entry_point_~array~0.offset 1)) (<= (+ entry_point_~i~2 entry_point_~array~0.offset 3) entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~len~0 (+ (- entry_point_~i~2) 2)))))), 65736#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= entry_point_~i~2 2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (not (= entry_point_~array~0.base 0)) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0) (or (<= entry_point_~len~0 (+ entry_point_~i~2 entry_point_~array~0.offset 1)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~len~0 (+ (- entry_point_~i~2) 2)))) (<= (+ entry_point_~i~2 entry_point_~array~0.offset 3) entry_point_~len~0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 65739#(and (<= 3 entry_point_~i~2) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (or (<= (+ entry_point_~i~2 entry_point_~array~0.offset 2) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~len~0 (+ (- entry_point_~i~2) 3))))) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 65738#(and (<= 3 entry_point_~i~2) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 8))) (or (<= entry_point_~len~0 (+ entry_point_~i~2 entry_point_~array~0.offset)) (<= (+ entry_point_~i~2 entry_point_~array~0.offset 2) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~len~0 (+ (- entry_point_~i~2) 3))))) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 65741#(and (or (<= (+ entry_point_~i~2 entry_point_~array~0.offset 1) entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~len~0 (+ (- entry_point_~i~2) 4))))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (<= entry_point_~i~2 entry_point_~len~0)), 65740#(and (<= 3 entry_point_~i~2) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~len~0 (+ (- entry_point_~i~2) 3)))) (<= (+ entry_point_~i~2 entry_point_~array~0.offset 2) entry_point_~len~0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)), 65743#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 65742#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 65745#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 65744#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 65747#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= |#valid| |old(#valid)|) (<= free_17_~i~1 1)))))), 65746#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))))))), 65749#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (<= free_17_~i~1 1)))))), 65748#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (<= free_17_~i~1 1)))))), 65751#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 8) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))))) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (not (= free_17_~array.offset 0)))), 65750#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 8) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))))) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))))))), 65753#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 8))))))) (and (<= free_17_~i~1 3) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))))) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~array.base |free_17_#in~array.base|)))), 65752#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= free_17_~i~1 2) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))))) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 8) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))))))), 65755#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 12)))))))), 65754#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (and (or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= |#valid| |old(#valid)|)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 12))))))) (not (= |free_17_#in~array.offset| 0))), 65725#true, 65727#(= |#valid| |old(#valid)|), 65726#false] [2018-02-04 03:20:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:34,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 03:20:34,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 03:20:34,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:20:34,573 INFO L87 Difference]: Start difference. First operand 695 states and 854 transitions. Second operand 31 states. [2018-02-04 03:20:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:35,609 INFO L93 Difference]: Finished difference Result 763 states and 940 transitions. [2018-02-04 03:20:35,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:20:35,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 92 [2018-02-04 03:20:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:35,610 INFO L225 Difference]: With dead ends: 763 [2018-02-04 03:20:35,610 INFO L226 Difference]: Without dead ends: 728 [2018-02-04 03:20:35,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:20:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-02-04 03:20:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 664. [2018-02-04 03:20:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-02-04 03:20:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 822 transitions. [2018-02-04 03:20:35,616 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 822 transitions. Word has length 92 [2018-02-04 03:20:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:35,616 INFO L432 AbstractCegarLoop]: Abstraction has 664 states and 822 transitions. [2018-02-04 03:20:35,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 03:20:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 822 transitions. [2018-02-04 03:20:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:20:35,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:35,617 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:35,617 INFO L371 AbstractCegarLoop]: === Iteration 91 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -323460041, now seen corresponding path program 5 times [2018-02-04 03:20:35,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:35,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:35,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:35,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:20:35,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:35,848 INFO L182 omatonBuilderFactory]: Interpolants [67201#(= 0 |ldv_malloc_#t~malloc2.offset|), 67200#false, 67203#(= 0 |entry_point_#t~ret12.offset|), 67202#(= 0 |ldv_malloc_#res.offset|), 67205#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 67204#(= entry_point_~array~0.offset 0), 67207#(and (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 67206#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= 0 entry_point_~array~0.offset) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 67209#(and (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 16) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 67208#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 12) (= 0 entry_point_~array~0.offset) (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 67211#(and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 16) entry_point_~array~0.offset)))), 67210#(and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 16) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 67213#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 67212#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 67215#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 67214#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 16)) (= free_17_~array.offset 0)), 67217#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 67216#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 67219#(= 0 |free_17_#t~mem10.offset|), 67218#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 67199#true] [2018-02-04 03:20:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:35,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:20:35,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:20:35,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:20:35,848 INFO L87 Difference]: Start difference. First operand 664 states and 822 transitions. Second operand 21 states. [2018-02-04 03:20:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:36,395 INFO L93 Difference]: Finished difference Result 693 states and 849 transitions. [2018-02-04 03:20:36,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:20:36,396 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-02-04 03:20:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:36,397 INFO L225 Difference]: With dead ends: 693 [2018-02-04 03:20:36,397 INFO L226 Difference]: Without dead ends: 693 [2018-02-04 03:20:36,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:20:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-02-04 03:20:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 668. [2018-02-04 03:20:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-02-04 03:20:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 829 transitions. [2018-02-04 03:20:36,401 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 829 transitions. Word has length 92 [2018-02-04 03:20:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:36,401 INFO L432 AbstractCegarLoop]: Abstraction has 668 states and 829 transitions. [2018-02-04 03:20:36,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:20:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 829 transitions. [2018-02-04 03:20:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:20:36,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:36,402 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:36,402 INFO L371 AbstractCegarLoop]: === Iteration 92 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash -323460040, now seen corresponding path program 5 times [2018-02-04 03:20:36,402 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:36,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 28 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:20:36,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:36,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:20:36,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:20:36,868 INFO L182 omatonBuilderFactory]: Interpolants [68621#false, 68620#true, 68623#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0))), 68622#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 68625#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)), 68624#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|))), 68627#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 68626#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 68629#(and (= entry_point_~array~0.offset 0) (or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))))), 68628#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))) (= entry_point_~array~0.offset 0)), 68631#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 17) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 4) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 17) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 68630#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 13) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 13) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= entry_point_~i~2 3))) (= entry_point_~array~0.offset 0)), 68633#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= entry_point_~i~2 4)), 68632#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 17) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= entry_point_~i~2 4))) (= entry_point_~array~0.offset 0)), 68635#(and (<= (select |#length| entry_point_~array~0.base) 20) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (select |#length| entry_point_~array~0.base) 19))), 68634#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 19))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 20)) (= entry_point_~array~0.offset 0)), 68637#(= |old(#length)| |#length|), 68636#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|)), 68639#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)) (<= (select |#length| free_17_~array.base) 19)) (<= (select |#length| free_17_~array.base) 20)), 68638#(and (or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16)) (<= (select |#length| |free_17_#in~array.base|) 19)) (<= (select |#length| |free_17_#in~array.base|) 20)), 68641#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 15)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 16))), 68640#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 20)) (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 19)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 16)))))), 68643#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))))), 68642#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))))), 68645#(= 0 |free_17_#t~mem10.base|), 68644#(or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3)))] [2018-02-04 03:20:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 28 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:20:36,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:20:36,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:20:36,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:20:36,868 INFO L87 Difference]: Start difference. First operand 668 states and 829 transitions. Second operand 26 states. [2018-02-04 03:20:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:38,282 INFO L93 Difference]: Finished difference Result 681 states and 839 transitions. [2018-02-04 03:20:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:20:38,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-02-04 03:20:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:38,283 INFO L225 Difference]: With dead ends: 681 [2018-02-04 03:20:38,283 INFO L226 Difference]: Without dead ends: 681 [2018-02-04 03:20:38,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 03:20:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-02-04 03:20:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 668. [2018-02-04 03:20:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-02-04 03:20:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 827 transitions. [2018-02-04 03:20:38,288 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 827 transitions. Word has length 92 [2018-02-04 03:20:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:38,289 INFO L432 AbstractCegarLoop]: Abstraction has 668 states and 827 transitions. [2018-02-04 03:20:38,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:20:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 827 transitions. [2018-02-04 03:20:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:20:38,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:38,289 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:38,289 INFO L371 AbstractCegarLoop]: === Iteration 93 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2062276487, now seen corresponding path program 2 times [2018-02-04 03:20:38,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:38,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:38,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:38,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:20:38,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:38,942 INFO L182 omatonBuilderFactory]: Interpolants [70045#true, 70047#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 70046#false, 70049#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 70048#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 70051#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 70050#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 70053#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))), 70052#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 70055#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4))) 4) 2) entry_point_~i~2) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4))))) (= entry_point_~array~0.offset 0)), 70054#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4))) 4) 1) entry_point_~i~2) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))))), 70057#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4))))) (= entry_point_~array~0.offset 0)), 70056#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))))), 70059#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 70058#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 70061#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 70060#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 70063#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 70062#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 70065#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|))), 70064#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 70067#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 70066#(and (= 0 |free_17_#in~array.offset|) (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)))), 70069#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 70068#(not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 70070#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:38,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:20:38,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:20:38,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:20:38,943 INFO L87 Difference]: Start difference. First operand 668 states and 827 transitions. Second operand 26 states. [2018-02-04 03:20:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:40,052 INFO L93 Difference]: Finished difference Result 679 states and 832 transitions. [2018-02-04 03:20:40,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:20:40,052 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-04 03:20:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:40,053 INFO L225 Difference]: With dead ends: 679 [2018-02-04 03:20:40,053 INFO L226 Difference]: Without dead ends: 679 [2018-02-04 03:20:40,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=290, Invalid=2062, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 03:20:40,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-02-04 03:20:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 668. [2018-02-04 03:20:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-02-04 03:20:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 824 transitions. [2018-02-04 03:20:40,058 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 824 transitions. Word has length 99 [2018-02-04 03:20:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:40,058 INFO L432 AbstractCegarLoop]: Abstraction has 668 states and 824 transitions. [2018-02-04 03:20:40,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:20:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 824 transitions. [2018-02-04 03:20:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:20:40,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:40,059 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:40,059 INFO L371 AbstractCegarLoop]: === Iteration 94 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1487187973, now seen corresponding path program 1 times [2018-02-04 03:20:40,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:40,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:20:42,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:42,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 03:20:42,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:20:42,099 INFO L182 omatonBuilderFactory]: Interpolants [71489#(or (<= 0 alloc_17_~j~0) (and (= |#valid| |old(#valid)|) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= |alloc_17_#in~array.offset| 0))), 71488#(or (<= 1 alloc_17_~j~0) (and (= |#valid| |old(#valid)|) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= |alloc_17_#in~array.offset| 0))), 71491#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 4) entry_point_~array~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset) (not (= entry_point_~array~0.base 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 71490#(or (and (= |#valid| |old(#valid)|) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (not (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= |alloc_17_#in~array.offset| 0))), 71493#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 71492#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 71495#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 1 free_17_~i~1) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= |#valid| |old(#valid)|)) (<= free_17_~i~1 1)))), 71494#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))))))), 71497#(or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 71496#(or (and (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)))) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 4))) (* 4 free_17_~i~1))))) (not (= |free_17_#in~array.offset| 0))), 71498#(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))), 71465#false, 71464#true, 71467#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 71466#(= |#valid| |old(#valid)|), 71469#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 71468#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 71471#(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) (= entry_point_~i~2 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 71470#(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|))))), 71473#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 71472#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 71475#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 71474#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 4) entry_point_~array~0.offset))) (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|))))), 71477#(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)|)))))), 71476#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 71479#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0)))), 71478#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 71481#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (not (= alloc_17_~p~0.base 0)) (= |#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)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 71480#(and (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (and (not (= |alloc_17_#t~ret4.base| 0)) (= (store |old(#valid)| |alloc_17_#t~ret4.base| (select |#valid| |alloc_17_#t~ret4.base|)) |#valid|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| |alloc_17_#t~ret4.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 71483#(and (or (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= |#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)))) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 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))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 71482#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= |#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))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (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)))), 71485#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (= |#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 (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))) (not (= alloc_17_~array.offset 0)))), 71484#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (= |#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 (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 71487#(and (or (and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= |#valid| |old(#valid)|) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.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))), 71486#(and (or (and (or (and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (= |alloc_17_#t~mem7.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= (store |old(#valid)| |alloc_17_#t~mem7.base| (select (store |#valid| |alloc_17_#t~mem7.base| 0) |alloc_17_#t~mem7.base|)) (store |#valid| |alloc_17_#t~mem7.base| 0)) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (not (= 4 (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base))))) (= 0 (select |old(#valid)| |alloc_17_#t~mem7.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= 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)))] [2018-02-04 03:20:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:20:42,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 03:20:42,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 03:20:42,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:20:42,099 INFO L87 Difference]: Start difference. First operand 668 states and 824 transitions. Second operand 35 states. [2018-02-04 03:20:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:44,427 INFO L93 Difference]: Finished difference Result 692 states and 841 transitions. [2018-02-04 03:20:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:20:44,427 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 92 [2018-02-04 03:20:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:44,428 INFO L225 Difference]: With dead ends: 692 [2018-02-04 03:20:44,428 INFO L226 Difference]: Without dead ends: 640 [2018-02-04 03:20:44,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=224, Invalid=2428, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 03:20:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-02-04 03:20:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2018-02-04 03:20:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 03:20:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 770 transitions. [2018-02-04 03:20:44,435 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 770 transitions. Word has length 92 [2018-02-04 03:20:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:44,435 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 770 transitions. [2018-02-04 03:20:44,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 03:20:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 770 transitions. [2018-02-04 03:20:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:20:44,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:44,436 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:44,436 INFO L371 AbstractCegarLoop]: === Iteration 95 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash 493938401, now seen corresponding path program 1 times [2018-02-04 03:20:44,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:44,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 74 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:45,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:45,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:20:45,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:45,029 INFO L182 omatonBuilderFactory]: Interpolants [72845#true, 72847#(= 0 |ldv_malloc_#t~malloc2.offset|), 72846#false, 72849#(= 0 |entry_point_#t~ret12.offset|), 72848#(= 0 |ldv_malloc_#res.offset|), 72851#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 72850#(= entry_point_~array~0.offset 0), 72853#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 72852#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 72855#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ 8 entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 72854#(and (<= entry_point_~i~2 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 72857#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 72856#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ 8 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 72859#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= alloc_17_~array.offset 0)))), 72858#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 72861#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 72860#(and (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 72863#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 72862#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 72865#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 72864#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 72867#(and (= free_17_~array.offset 0) (or (<= (+ free_17_~i~1 1) 0) (and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8))))), 72866#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 72869#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 72868#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 72871#(= 0 |free_17_#t~mem10.offset|), 72870#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0))] [2018-02-04 03:20:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 74 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:45,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:20:45,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:20:45,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:20:45,029 INFO L87 Difference]: Start difference. First operand 620 states and 770 transitions. Second operand 27 states. [2018-02-04 03:20:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:45,915 INFO L93 Difference]: Finished difference Result 628 states and 771 transitions. [2018-02-04 03:20:45,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:20:45,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-02-04 03:20:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:45,916 INFO L225 Difference]: With dead ends: 628 [2018-02-04 03:20:45,916 INFO L226 Difference]: Without dead ends: 628 [2018-02-04 03:20:45,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=1894, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:20:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-02-04 03:20:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 620. [2018-02-04 03:20:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 03:20:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 767 transitions. [2018-02-04 03:20:45,920 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 767 transitions. Word has length 100 [2018-02-04 03:20:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:45,921 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 767 transitions. [2018-02-04 03:20:45,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:20:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 767 transitions. [2018-02-04 03:20:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:20:45,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:45,921 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:45,921 INFO L371 AbstractCegarLoop]: === Iteration 96 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash 843173712, now seen corresponding path program 2 times [2018-02-04 03:20:45,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:45,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:46,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:46,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:20:46,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:46,502 INFO L182 omatonBuilderFactory]: Interpolants [74177#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 74176#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 74179#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|))), 74178#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 74181#(and (<= (* 4 free_17_~len) 12) (= free_17_~array.offset 0) (or (<= (* 4 free_17_~len) 11) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8)))), 74180#(and (<= (* 4 |free_17_#in~len|) 12) (or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8)) (<= |free_17_#in~len| 2)) (= 0 |free_17_#in~array.offset|)), 74183#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))))) (= free_17_~array.offset 0)), 74182#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))) (= free_17_~array.offset 0)), 74185#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 74184#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))) (= free_17_~array.offset 0)), 74186#(= 0 |free_17_#t~mem10.base|), 74161#false, 74160#true, 74163#(= 0 |ldv_malloc_#res.offset|), 74162#(= 0 |ldv_malloc_#t~malloc2.offset|), 74165#(= entry_point_~array~0.offset 0), 74164#(= 0 |entry_point_#t~ret12.offset|), 74167#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 74166#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 74169#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0)), 74168#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0)), 74171#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~len~0) 12) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (<= (* 4 entry_point_~len~0) 11))), 74170#(and (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~i~2) 11) (and (<= (* 4 entry_point_~i~2) 12) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))))), 74173#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 74172#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 74175#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 74174#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))))] [2018-02-04 03:20:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:46,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:20:46,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:20:46,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:20:46,502 INFO L87 Difference]: Start difference. First operand 620 states and 767 transitions. Second operand 27 states. [2018-02-04 03:20:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:47,424 INFO L93 Difference]: Finished difference Result 624 states and 770 transitions. [2018-02-04 03:20:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 03:20:47,424 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 92 [2018-02-04 03:20:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:47,425 INFO L225 Difference]: With dead ends: 624 [2018-02-04 03:20:47,425 INFO L226 Difference]: Without dead ends: 624 [2018-02-04 03:20:47,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=1796, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:20:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-02-04 03:20:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 620. [2018-02-04 03:20:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 03:20:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 766 transitions. [2018-02-04 03:20:47,430 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 766 transitions. Word has length 92 [2018-02-04 03:20:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:47,430 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 766 transitions. [2018-02-04 03:20:47,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:20:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 766 transitions. [2018-02-04 03:20:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 03:20:47,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:47,431 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:47,431 INFO L371 AbstractCegarLoop]: === Iteration 97 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash -869633703, now seen corresponding path program 3 times [2018-02-04 03:20:47,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:47,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:48,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:48,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:20:48,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:48,022 INFO L182 omatonBuilderFactory]: Interpolants [75469#true, 75471#(= 0 |ldv_malloc_#t~malloc2.offset|), 75470#false, 75473#(= 0 |entry_point_#t~ret12.offset|), 75472#(= 0 |ldv_malloc_#res.offset|), 75475#(and (or (<= (+ entry_point_~i~2 1) 0) (= entry_point_~i~2 0)) (= entry_point_~array~0.offset 0)), 75474#(= 0 entry_point_~array~0.offset), 75477#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 75476#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 75479#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 75478#(and (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 75481#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 75480#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset)))), 75483#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 75482#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 75485#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 75484#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 75487#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 75486#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 75489#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|))), 75488#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 75491#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 75490#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 75493#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 75492#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 75494#(= 0 |free_17_#t~mem10.base|)] [2018-02-04 03:20:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:48,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:20:48,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:20:48,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:20:48,023 INFO L87 Difference]: Start difference. First operand 620 states and 766 transitions. Second operand 26 states. [2018-02-04 03:20:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:48,832 INFO L93 Difference]: Finished difference Result 627 states and 768 transitions. [2018-02-04 03:20:48,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 03:20:48,832 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2018-02-04 03:20:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:48,834 INFO L225 Difference]: With dead ends: 627 [2018-02-04 03:20:48,834 INFO L226 Difference]: Without dead ends: 627 [2018-02-04 03:20:48,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=1507, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:20:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-02-04 03:20:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 620. [2018-02-04 03:20:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 03:20:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 764 transitions. [2018-02-04 03:20:48,842 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 764 transitions. Word has length 96 [2018-02-04 03:20:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:48,842 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 764 transitions. [2018-02-04 03:20:48,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:20:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 764 transitions. [2018-02-04 03:20:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:20:48,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:48,843 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:48,843 INFO L371 AbstractCegarLoop]: === Iteration 98 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:48,844 INFO L82 PathProgramCache]: Analyzing trace with hash -146179836, now seen corresponding path program 3 times [2018-02-04 03:20:48,844 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:48,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:49,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:49,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:20:49,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:49,538 INFO L182 omatonBuilderFactory]: Interpolants [76801#(= 1 (select |#valid| free_17_~array.base)), 76800#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 76775#false, 76774#true, 76777#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 76776#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 76779#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 76778#(and (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|)), 76781#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1)), 76780#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (= entry_point_~i~2 0)), 76783#(and (<= (* 4 entry_point_~i~2) 12) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 76782#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (<= (* 4 entry_point_~i~2) (+ entry_point_~array~0.offset 8))), 76785#(= |#valid| |old(#valid)|), 76784#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1) (<= (* 4 entry_point_~len~0) 12)), 76787#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 76786#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= |#valid| |old(#valid)|) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 76789#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 76788#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 76791#(and (or (and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (= 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|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 76790#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 76793#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- alloc_17_~array.offset))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~len |alloc_17_#in~len|)) (not (= alloc_17_~array.offset 0)))), 76792#(and (or (not (= alloc_17_~array.offset 0)) (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- alloc_17_~array.offset))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~len |alloc_17_#in~len|))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 76795#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (<= 12 (* 4 alloc_17_~len)) (= alloc_17_~len |alloc_17_#in~len|) (or (<= 13 (* 4 alloc_17_~len)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- 0)))) (= 1 (select |#valid| |alloc_17_#in~array.base|)))))), 76794#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- alloc_17_~array.offset))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 13 (+ (* 4 alloc_17_~len) alloc_17_~array.offset))) (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 76797#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 76796#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (<= 12 (* 4 |alloc_17_#in~len|)) (or (<= 13 (* 4 |alloc_17_#in~len|)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- 0)))) (= 1 (select |#valid| |alloc_17_#in~array.base|)))))), 76799#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 76798#(and (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|)))] [2018-02-04 03:20:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:49,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:20:49,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:20:49,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:20:49,538 INFO L87 Difference]: Start difference. First operand 620 states and 764 transitions. Second operand 28 states. [2018-02-04 03:20:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:50,390 INFO L93 Difference]: Finished difference Result 629 states and 770 transitions. [2018-02-04 03:20:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:20:50,390 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2018-02-04 03:20:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:50,391 INFO L225 Difference]: With dead ends: 629 [2018-02-04 03:20:50,391 INFO L226 Difference]: Without dead ends: 629 [2018-02-04 03:20:50,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=1728, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 03:20:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-02-04 03:20:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 620. [2018-02-04 03:20:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 03:20:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 763 transitions. [2018-02-04 03:20:50,396 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 763 transitions. Word has length 94 [2018-02-04 03:20:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:50,396 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 763 transitions. [2018-02-04 03:20:50,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:20:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 763 transitions. [2018-02-04 03:20:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 03:20:50,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:50,397 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:50,397 INFO L371 AbstractCegarLoop]: === Iteration 99 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1312612038, now seen corresponding path program 9 times [2018-02-04 03:20:50,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:50,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:50,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:50,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:20:50,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:50,683 INFO L182 omatonBuilderFactory]: Interpolants [78083#true, 78085#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 78084#false, 78087#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 78086#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 78089#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 78088#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 78091#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 78090#(and (<= 1 entry_point_~i~2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 78093#(and (<= 3 entry_point_~i~2) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))), 78092#(and (<= 3 entry_point_~i~2) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 78095#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 12))))), 78094#(and (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset 12)))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset 12) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 78097#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 78096#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))))), 78099#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 12))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 78098#(and (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12))) (= 0 |free_17_#in~array.offset|)), 78101#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 78100#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 78103#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 78102#(not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))), 78104#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:50,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:20:50,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:20:50,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:20:50,683 INFO L87 Difference]: Start difference. First operand 620 states and 763 transitions. Second operand 22 states. [2018-02-04 03:20:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:51,350 INFO L93 Difference]: Finished difference Result 631 states and 770 transitions. [2018-02-04 03:20:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:20:51,350 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 95 [2018-02-04 03:20:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:51,351 INFO L225 Difference]: With dead ends: 631 [2018-02-04 03:20:51,351 INFO L226 Difference]: Without dead ends: 631 [2018-02-04 03:20:51,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=1610, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:20:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-02-04 03:20:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 620. [2018-02-04 03:20:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-02-04 03:20:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 762 transitions. [2018-02-04 03:20:51,356 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 762 transitions. Word has length 95 [2018-02-04 03:20:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:51,357 INFO L432 AbstractCegarLoop]: Abstraction has 620 states and 762 transitions. [2018-02-04 03:20:51,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:20:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 762 transitions. [2018-02-04 03:20:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 03:20:51,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:51,357 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-02-04 03:20:51,357 INFO L371 AbstractCegarLoop]: === Iteration 100 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash -236607562, now seen corresponding path program 2 times [2018-02-04 03:20:51,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:51,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-04 03:20:51,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:51,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:20:51,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:20:51,721 INFO L182 omatonBuilderFactory]: Interpolants [79399#true, 79401#(= 0 |ldv_malloc_#t~malloc2.offset|), 79400#false, 79403#(= 0 |entry_point_#t~ret12.offset|), 79402#(= 0 |ldv_malloc_#res.offset|), 79405#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 79404#(= 0 entry_point_~array~0.offset), 79407#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 79406#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 79409#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= alloc_17_~i~0 1) (not (= alloc_17_~array.offset 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 79408#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 79411#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= 0 alloc_17_~p~0.offset) (or (<= alloc_17_~i~0 1) (not (= alloc_17_~array.offset 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 79410#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 0 |alloc_17_#t~ret4.offset|) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= alloc_17_~i~0 1) (not (= alloc_17_~array.offset 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 79413#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4)))))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 79412#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= alloc_17_~i~0 1) (not (= alloc_17_~array.offset 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 79415#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (- (- 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 79414#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.offset) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4)))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 79417#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 79416#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 79419#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.offset 0)), 79418#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 79420#(= 0 |free_17_#t~mem10.offset|)] [2018-02-04 03:20:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-04 03:20:51,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:20:51,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:20:51,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:20:51,722 INFO L87 Difference]: Start difference. First operand 620 states and 762 transitions. Second operand 22 states. [2018-02-04 03:20:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:52,168 INFO L93 Difference]: Finished difference Result 780 states and 960 transitions. [2018-02-04 03:20:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:20:52,168 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 95 [2018-02-04 03:20:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:52,169 INFO L225 Difference]: With dead ends: 780 [2018-02-04 03:20:52,169 INFO L226 Difference]: Without dead ends: 780 [2018-02-04 03:20:52,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:20:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-02-04 03:20:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 762. [2018-02-04 03:20:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-02-04 03:20:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 953 transitions. [2018-02-04 03:20:52,175 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 953 transitions. Word has length 95 [2018-02-04 03:20:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:52,175 INFO L432 AbstractCegarLoop]: Abstraction has 762 states and 953 transitions. [2018-02-04 03:20:52,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:20:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 953 transitions. [2018-02-04 03:20:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 03:20:52,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:52,176 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-02-04 03:20:52,176 INFO L371 AbstractCegarLoop]: === Iteration 101 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash -236607561, now seen corresponding path program 2 times [2018-02-04 03:20:52,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:52,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:53,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:53,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 03:20:53,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:20:53,112 INFO L182 omatonBuilderFactory]: Interpolants [80989#true, 80991#(= 0 |ldv_malloc_#t~malloc2.offset|), 80990#false, 80993#(= 0 |entry_point_#t~ret12.offset|), 80992#(= 0 |ldv_malloc_#res.offset|), 80995#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 80994#(= entry_point_~array~0.offset 0), 80997#(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))), 80996#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 80999#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)))), 80998#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 81001#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 81000#(and (or (and (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 81003#(and (or (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 81002#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= 1 (select |#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|)) (not (= alloc_17_~array.offset 0)))), 81005#(and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 81004#(= |#valid| |old(#valid)|), 81007#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 81006#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 81009#(and (or (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (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) (+ (- alloc_17_~array.offset) 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)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 81008#(and (or (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 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) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (= 1 (select |#valid| alloc_17_~p~0.base)) (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) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 81011#(and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 81010#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 81013#(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) 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) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (= 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_~array.base |alloc_17_#in~array.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) alloc_17_~array.offset)) 0))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 81012#(and (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|))))), 81015#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0))), 81014#(or (and (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- 0)) 0)) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- 0)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 81017#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 4) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~i~1 0) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))) (= free_17_~array.offset 0)), 81016#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)))), 81019#(and (= free_17_~i~1 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))) (= free_17_~array.offset 0)), 81018#(and (not (= |free_17_#t~mem10.base| 0)) (= free_17_~i~1 0) (= free_17_~array.offset 0) (or (not (= 1 (select |#valid| |free_17_#t~mem10.base|))) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))))), 81021#(= (select |#valid| |free_17_#t~mem10.base|) 1), 81020#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))] [2018-02-04 03:20:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:20:53,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 03:20:53,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 03:20:53,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 03:20:53,112 INFO L87 Difference]: Start difference. First operand 762 states and 953 transitions. Second operand 33 states. [2018-02-04 03:20:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:54,549 INFO L93 Difference]: Finished difference Result 767 states and 955 transitions. [2018-02-04 03:20:54,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:20:54,549 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 95 [2018-02-04 03:20:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:54,551 INFO L225 Difference]: With dead ends: 767 [2018-02-04 03:20:54,551 INFO L226 Difference]: Without dead ends: 767 [2018-02-04 03:20:54,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=2559, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 03:20:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-02-04 03:20:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 733. [2018-02-04 03:20:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-02-04 03:20:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 915 transitions. [2018-02-04 03:20:54,559 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 915 transitions. Word has length 95 [2018-02-04 03:20:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:54,559 INFO L432 AbstractCegarLoop]: Abstraction has 733 states and 915 transitions. [2018-02-04 03:20:54,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 03:20:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 915 transitions. [2018-02-04 03:20:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:20:54,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:54,560 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:54,560 INFO L371 AbstractCegarLoop]: === Iteration 102 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -734188150, now seen corresponding path program 2 times [2018-02-04 03:20:54,561 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:54,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:20:54,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:54,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:20:54,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:54,594 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:20:54,594 INFO L182 omatonBuilderFactory]: Interpolants [82563#false, 82562#true, 82565#(<= alloc_17_~i~0 1), 82564#(= alloc_17_~i~0 0), 82567#(<= alloc_17_~j~0 1), 82566#(<= alloc_17_~i~0 2), 82569#(<= (+ alloc_17_~j~0 1) 0), 82568#(<= alloc_17_~j~0 0)] [2018-02-04 03:20:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 03:20:54,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:20:54,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:20:54,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:20:54,594 INFO L87 Difference]: Start difference. First operand 733 states and 915 transitions. Second operand 8 states. [2018-02-04 03:20:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:54,642 INFO L93 Difference]: Finished difference Result 729 states and 909 transitions. [2018-02-04 03:20:54,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:20:54,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-02-04 03:20:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:54,643 INFO L225 Difference]: With dead ends: 729 [2018-02-04 03:20:54,643 INFO L226 Difference]: Without dead ends: 729 [2018-02-04 03:20:54,643 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:20:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-02-04 03:20:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2018-02-04 03:20:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-02-04 03:20:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 909 transitions. [2018-02-04 03:20:54,649 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 909 transitions. Word has length 102 [2018-02-04 03:20:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:54,650 INFO L432 AbstractCegarLoop]: Abstraction has 729 states and 909 transitions. [2018-02-04 03:20:54,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:20:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 909 transitions. [2018-02-04 03:20:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 03:20:54,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:54,650 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:54,650 INFO L371 AbstractCegarLoop]: === Iteration 103 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:54,650 INFO L82 PathProgramCache]: Analyzing trace with hash 51761900, now seen corresponding path program 7 times [2018-02-04 03:20:54,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:54,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:54,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:54,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:20:54,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:54,780 INFO L182 omatonBuilderFactory]: Interpolants [84041#false, 84040#true, 84043#(= 0 |ldv_malloc_#res.offset|), 84042#(= 0 |ldv_malloc_#t~malloc2.offset|), 84045#(= entry_point_~array~0.offset 0), 84044#(= 0 |entry_point_#t~ret12.offset|), 84047#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 84046#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 84049#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 84048#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 84051#(and (= entry_point_~array~0.offset 0) (<= 20 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 84050#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 84053#(and (= free_17_~len |free_17_#in~len|) (<= free_17_~i~1 1)), 84052#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 84055#(and (<= free_17_~i~1 3) (= free_17_~len |free_17_#in~len|)), 84054#(and (<= free_17_~i~1 2) (= free_17_~len |free_17_#in~len|)), 84057#(<= |free_17_#in~len| 4), 84056#(and (<= free_17_~i~1 4) (= free_17_~len |free_17_#in~len|))] [2018-02-04 03:20:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:54,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:20:54,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:20:54,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:20:54,781 INFO L87 Difference]: Start difference. First operand 729 states and 909 transitions. Second operand 18 states. [2018-02-04 03:20:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:54,908 INFO L93 Difference]: Finished difference Result 822 states and 1018 transitions. [2018-02-04 03:20:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:20:54,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-02-04 03:20:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:54,909 INFO L225 Difference]: With dead ends: 822 [2018-02-04 03:20:54,909 INFO L226 Difference]: Without dead ends: 808 [2018-02-04 03:20:54,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:20:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-02-04 03:20:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 754. [2018-02-04 03:20:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-02-04 03:20:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 950 transitions. [2018-02-04 03:20:54,919 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 950 transitions. Word has length 96 [2018-02-04 03:20:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:54,920 INFO L432 AbstractCegarLoop]: Abstraction has 754 states and 950 transitions. [2018-02-04 03:20:54,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:20:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 950 transitions. [2018-02-04 03:20:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 03:20:54,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:54,921 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:54,921 INFO L371 AbstractCegarLoop]: === Iteration 104 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2036267455, now seen corresponding path program 6 times [2018-02-04 03:20:54,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:54,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 2 proven. 124 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:55,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:55,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:20:55,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:55,220 INFO L182 omatonBuilderFactory]: Interpolants [85665#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 85664#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 85666#(= 0 |free_17_#t~mem10.base|), 85645#true, 85647#(= 0 |ldv_malloc_#t~malloc2.offset|), 85646#false, 85649#(= 0 |entry_point_#t~ret12.offset|), 85648#(= 0 |ldv_malloc_#res.offset|), 85651#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 85650#(= entry_point_~array~0.offset 0), 85653#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 85652#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 85655#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 85654#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 85657#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 16)))), 85656#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 85659#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 85658#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (= entry_point_~array~0.offset 0)), 85661#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 85660#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 85663#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 85662#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 12))) (= free_17_~array.offset 0))] [2018-02-04 03:20:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 2 proven. 124 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:55,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:20:55,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:20:55,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:20:55,221 INFO L87 Difference]: Start difference. First operand 754 states and 950 transitions. Second operand 22 states. [2018-02-04 03:20:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:55,719 INFO L93 Difference]: Finished difference Result 773 states and 965 transitions. [2018-02-04 03:20:55,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:20:55,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2018-02-04 03:20:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:55,720 INFO L225 Difference]: With dead ends: 773 [2018-02-04 03:20:55,720 INFO L226 Difference]: Without dead ends: 773 [2018-02-04 03:20:55,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:20:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-02-04 03:20:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 754. [2018-02-04 03:20:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-02-04 03:20:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 949 transitions. [2018-02-04 03:20:55,725 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 949 transitions. Word has length 96 [2018-02-04 03:20:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:55,725 INFO L432 AbstractCegarLoop]: Abstraction has 754 states and 949 transitions. [2018-02-04 03:20:55,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:20:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 949 transitions. [2018-02-04 03:20:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 03:20:55,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:55,726 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:55,726 INFO L371 AbstractCegarLoop]: === Iteration 105 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 989502817, now seen corresponding path program 6 times [2018-02-04 03:20:55,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:55,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:55,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:55,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:20:55,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:55,866 INFO L182 omatonBuilderFactory]: Interpolants [87233#(and (<= entry_point_~len~0 5) (= 0 entry_point_~array~0.offset)), 87232#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 5)), 87235#(and (= free_17_~array.offset 0) (<= free_17_~len 5)), 87234#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 5)), 87237#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 16)) (= free_17_~array.offset 0)), 87236#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 20)) (= free_17_~array.offset 0)), 87239#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 87238#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 87241#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 87240#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0)), 87221#true, 87223#(= 0 |ldv_malloc_#t~malloc2.offset|), 87222#false, 87225#(= 0 |entry_point_#t~ret12.offset|), 87224#(= 0 |ldv_malloc_#res.offset|), 87227#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 87226#(= 0 entry_point_~array~0.offset), 87229#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 87228#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 87231#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 4)), 87230#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3))] [2018-02-04 03:20:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:20:55,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:20:55,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:20:55,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:20:55,867 INFO L87 Difference]: Start difference. First operand 754 states and 949 transitions. Second operand 21 states. [2018-02-04 03:20:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:56,062 INFO L93 Difference]: Finished difference Result 969 states and 1209 transitions. [2018-02-04 03:20:56,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:20:56,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 98 [2018-02-04 03:20:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:56,063 INFO L225 Difference]: With dead ends: 969 [2018-02-04 03:20:56,063 INFO L226 Difference]: Without dead ends: 969 [2018-02-04 03:20:56,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:20:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-02-04 03:20:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 937. [2018-02-04 03:20:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-02-04 03:20:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1195 transitions. [2018-02-04 03:20:56,070 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1195 transitions. Word has length 98 [2018-02-04 03:20:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:56,071 INFO L432 AbstractCegarLoop]: Abstraction has 937 states and 1195 transitions. [2018-02-04 03:20:56,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:20:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1195 transitions. [2018-02-04 03:20:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:20:56,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:56,071 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:56,071 INFO L371 AbstractCegarLoop]: === Iteration 106 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash -426756674, now seen corresponding path program 2 times [2018-02-04 03:20:56,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:56,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 11 proven. 77 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 03:20:56,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:56,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:20:56,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:20:56,612 INFO L182 omatonBuilderFactory]: Interpolants [89185#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 89184#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 89187#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))), 89186#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 89189#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (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) alloc_17_~array.offset)))) (= |alloc_17_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4)))))), 89188#(and (= alloc_17_~array.offset 0) (or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (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) alloc_17_~array.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4)))))), 89191#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.offset 0)), 89190#(and (= alloc_17_~array.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) (- 4))))), 89192#(= 0 |alloc_17_#t~mem7.offset|), 89169#true, 89171#(= 0 |ldv_malloc_#t~malloc2.offset|), 89170#false, 89173#(= 0 |entry_point_#t~ret12.offset|), 89172#(= 0 |ldv_malloc_#res.offset|), 89175#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 89174#(= entry_point_~array~0.offset 0), 89177#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 89176#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 89179#(and (or (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 3)) (= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 4))) (= entry_point_~array~0.offset 0)), 89178#(and (or (= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 3)) (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 2))) (= entry_point_~array~0.offset 0)), 89181#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 89180#(= 0 |alloc_17_#in~array.offset|), 89183#(and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~array.offset 0)), 89182#(= alloc_17_~array.offset 0)] [2018-02-04 03:20:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 11 proven. 77 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 03:20:56,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:20:56,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:20:56,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:20:56,612 INFO L87 Difference]: Start difference. First operand 937 states and 1195 transitions. Second operand 24 states. [2018-02-04 03:20:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:57,125 INFO L93 Difference]: Finished difference Result 947 states and 1207 transitions. [2018-02-04 03:20:57,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:20:57,126 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2018-02-04 03:20:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:57,127 INFO L225 Difference]: With dead ends: 947 [2018-02-04 03:20:57,127 INFO L226 Difference]: Without dead ends: 947 [2018-02-04 03:20:57,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=1895, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:20:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-02-04 03:20:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 941. [2018-02-04 03:20:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-02-04 03:20:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1201 transitions. [2018-02-04 03:20:57,139 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1201 transitions. Word has length 102 [2018-02-04 03:20:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:57,139 INFO L432 AbstractCegarLoop]: Abstraction has 941 states and 1201 transitions. [2018-02-04 03:20:57,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:20:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1201 transitions. [2018-02-04 03:20:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 03:20:57,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:57,140 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:57,140 INFO L371 AbstractCegarLoop]: === Iteration 107 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1501331153, now seen corresponding path program 4 times [2018-02-04 03:20:57,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:57,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 27 proven. 112 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 03:20:57,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:57,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 03:20:57,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:57,958 INFO L182 omatonBuilderFactory]: Interpolants [91137#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 91136#(= 0 |alloc_17_#in~array.offset|), 91139#(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))), 91138#(and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= alloc_17_~array.offset 0)), 91141#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 91140#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 91143#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 91142#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))), 91145#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4))))))), 91144#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))), 91147#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 91146#(= |#valid| |old(#valid)|), 91149#(and (= alloc_17_~array.offset 0) (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4)))))) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4))))))), 91148#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 91151#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4)))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0)) (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) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4))))))), 91150#(and (not (= alloc_17_~p~0.base 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) (+ alloc_17_~array.offset (- 4)))))) (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) (+ alloc_17_~array.offset (- 4)))))) (= alloc_17_~array.offset 0)), 91153#(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) (+ alloc_17_~array.offset (+ (* 4 alloc_17_~j~0) (- 4)))))) (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) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ alloc_17_~array.offset (+ (* 4 alloc_17_~j~0) (- 4)))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) 0))), 91152#(and (not (= (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 (- 8)))))) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4)))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 8))))))), 91155#(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) (+ alloc_17_~array.offset (+ (* 4 alloc_17_~j~0) (- 4))))))), 91154#(and (= 1 (select (store |#valid| |alloc_17_#t~mem7.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ alloc_17_~array.offset (+ (* 4 alloc_17_~j~0) (- 4)))))) (= alloc_17_~array.offset 0) (= |alloc_17_#t~mem7.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) 0))), 91157#(= (select |#valid| |alloc_17_#t~mem7.base|) 1), 91156#(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)))))), 91127#true, 91129#(= 0 |ldv_malloc_#t~malloc2.offset|), 91128#false, 91131#(= 0 |entry_point_#t~ret12.offset|), 91130#(= 0 |ldv_malloc_#res.offset|), 91133#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 91132#(= entry_point_~array~0.offset 0), 91135#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 91134#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1))] [2018-02-04 03:20:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 27 proven. 112 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 03:20:57,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 03:20:57,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 03:20:57,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:20:57,959 INFO L87 Difference]: Start difference. First operand 941 states and 1201 transitions. Second operand 31 states. [2018-02-04 03:20:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:59,046 INFO L93 Difference]: Finished difference Result 943 states and 1199 transitions. [2018-02-04 03:20:59,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 03:20:59,046 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 110 [2018-02-04 03:20:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:59,048 INFO L225 Difference]: With dead ends: 943 [2018-02-04 03:20:59,048 INFO L226 Difference]: Without dead ends: 943 [2018-02-04 03:20:59,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=296, Invalid=3244, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 03:20:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-02-04 03:20:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2018-02-04 03:20:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-02-04 03:20:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1199 transitions. [2018-02-04 03:20:59,058 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1199 transitions. Word has length 110 [2018-02-04 03:20:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:59,058 INFO L432 AbstractCegarLoop]: Abstraction has 941 states and 1199 transitions. [2018-02-04 03:20:59,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 03:20:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1199 transitions. [2018-02-04 03:20:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:20:59,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:59,059 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:59,059 INFO L371 AbstractCegarLoop]: === Iteration 108 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1728250976, now seen corresponding path program 2 times [2018-02-04 03:20:59,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:59,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:20:59,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:59,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:20:59,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:20:59,234 INFO L182 omatonBuilderFactory]: Interpolants [93101#true, 93103#(= 0 |ldv_malloc_#t~malloc2.offset|), 93102#false, 93105#(= 0 |entry_point_#t~ret12.offset|), 93104#(= 0 |ldv_malloc_#res.offset|), 93107#(or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)), 93106#(= 0 entry_point_~array~0.offset), 93109#(and (or (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 93108#(and (or (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 93111#(and (or (not (= alloc_17_~array.offset 0)) (<= 4 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 93110#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 93113#(or (<= 0 alloc_17_~j~0) (not (= 0 |alloc_17_#in~array.offset|))), 93112#(or (<= 1 alloc_17_~j~0) (not (= 0 |alloc_17_#in~array.offset|))), 93114#(not (= 0 |alloc_17_#in~array.offset|))] [2018-02-04 03:20:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:20:59,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:20:59,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:20:59,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:20:59,235 INFO L87 Difference]: Start difference. First operand 941 states and 1199 transitions. Second operand 14 states. [2018-02-04 03:20:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:20:59,374 INFO L93 Difference]: Finished difference Result 937 states and 1181 transitions. [2018-02-04 03:20:59,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:20:59,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2018-02-04 03:20:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:20:59,376 INFO L225 Difference]: With dead ends: 937 [2018-02-04 03:20:59,376 INFO L226 Difference]: Without dead ends: 928 [2018-02-04 03:20:59,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:20:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-02-04 03:20:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 924. [2018-02-04 03:20:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-02-04 03:20:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1168 transitions. [2018-02-04 03:20:59,383 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1168 transitions. Word has length 102 [2018-02-04 03:20:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:20:59,383 INFO L432 AbstractCegarLoop]: Abstraction has 924 states and 1168 transitions. [2018-02-04 03:20:59,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:20:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1168 transitions. [2018-02-04 03:20:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 03:20:59,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:20:59,384 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:20:59,384 INFO L371 AbstractCegarLoop]: === Iteration 109 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:20:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1420320392, now seen corresponding path program 3 times [2018-02-04 03:20:59,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:20:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:20:59,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:20:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:59,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:20:59,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:20:59,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:20:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:20:59,957 INFO L182 omatonBuilderFactory]: Interpolants [94987#false, 94986#true, 94989#(= 0 |ldv_malloc_#res.offset|), 94988#(= 0 |ldv_malloc_#t~malloc2.offset|), 94991#(= entry_point_~array~0.offset 0), 94990#(= 0 |entry_point_#t~ret12.offset|), 94993#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 94992#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 94995#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 94994#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 94997#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)))) (<= (+ (* 4 entry_point_~i~2) 8) (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 94996#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)))) (= entry_point_~array~0.offset 0)), 94999#(and (or (<= (+ (* 4 entry_point_~i~2) 4) (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8))))) (= entry_point_~array~0.offset 0)), 94998#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)))) (<= (+ (* 4 entry_point_~i~2) 8) (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 95001#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 95000#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8))))), 95003#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 95002#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 95005#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 95004#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 95007#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 95006#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 95009#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 95008#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|))), 95011#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 95010#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 95013#(and (= 1 (select |#valid| free_17_~array.base)) (= 0 |free_17_#t~mem10.base|)), 95012#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 95014#(= 1 (select |#valid| free_17_~array.base))] [2018-02-04 03:20:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:20:59,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:20:59,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:20:59,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:20:59,957 INFO L87 Difference]: Start difference. First operand 924 states and 1168 transitions. Second operand 29 states. [2018-02-04 03:21:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:00,947 INFO L93 Difference]: Finished difference Result 931 states and 1169 transitions. [2018-02-04 03:21:00,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 03:21:00,947 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2018-02-04 03:21:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:00,948 INFO L225 Difference]: With dead ends: 931 [2018-02-04 03:21:00,948 INFO L226 Difference]: Without dead ends: 931 [2018-02-04 03:21:00,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=330, Invalid=2532, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 03:21:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2018-02-04 03:21:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 924. [2018-02-04 03:21:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-02-04 03:21:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1165 transitions. [2018-02-04 03:21:00,955 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1165 transitions. Word has length 101 [2018-02-04 03:21:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:00,955 INFO L432 AbstractCegarLoop]: Abstraction has 924 states and 1165 transitions. [2018-02-04 03:21:00,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:21:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1165 transitions. [2018-02-04 03:21:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:21:00,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:00,956 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:00,956 INFO L371 AbstractCegarLoop]: === Iteration 110 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:00,956 INFO L82 PathProgramCache]: Analyzing trace with hash 609770162, now seen corresponding path program 5 times [2018-02-04 03:21:00,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:00,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 74 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:01,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:01,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:21:01,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:01,330 INFO L182 omatonBuilderFactory]: Interpolants [96921#false, 96920#true, 96923#(= 0 |ldv_malloc_#res.offset|), 96922#(= 0 |ldv_malloc_#t~malloc2.offset|), 96925#(= entry_point_~array~0.offset 0), 96924#(= 0 |entry_point_#t~ret12.offset|), 96927#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 96926#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 96929#(and (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 96928#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0)), 96931#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 4)), 96930#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 4)), 96933#(and (<= (* 4 entry_point_~len~0) 20) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (<= (* 4 entry_point_~len~0) 19))), 96932#(and (<= (* 4 entry_point_~i~2) 20) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (<= (* 4 entry_point_~i~2) 19)) (= entry_point_~array~0.offset 0)), 96935#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 96934#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 96937#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 96936#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~len |free_17_#in~len|)), 96939#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 96938#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~len |free_17_#in~len|)), 96941#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (<= (+ free_17_~i~1 1) free_17_~len)) (= free_17_~len |free_17_#in~len|) (<= 16 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 96940#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|) (<= 16 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 96943#(or (and (or (and (or (<= 21 (* 4 free_17_~len)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 16))) (* 4 free_17_~i~1)))))) (<= 20 (* 4 free_17_~len))) (not (= |free_17_#in~array.offset| 0))) (= free_17_~len |free_17_#in~len|)) (= 1 (select |#valid| |free_17_#in~array.base|))), 96942#(and (or (and (or (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 16))) (* 4 free_17_~i~1)))) (<= 21 (* 4 free_17_~len))) (<= 20 (* 4 free_17_~len))) (not (= |free_17_#in~array.offset| 0))) (= 1 (select |#valid| |free_17_#in~array.base|)) (= free_17_~len |free_17_#in~len|)), 96945#(= 1 (select |#valid| entry_point_~array~0.base)), 96944#(or (and (<= 20 (* 4 |free_17_#in~len|)) (or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 16))))) (<= 21 (* 4 |free_17_#in~len|)))) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)))] [2018-02-04 03:21:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 74 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:01,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:21:01,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:21:01,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:21:01,331 INFO L87 Difference]: Start difference. First operand 924 states and 1165 transitions. Second operand 26 states. [2018-02-04 03:21:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:02,529 INFO L93 Difference]: Finished difference Result 966 states and 1199 transitions. [2018-02-04 03:21:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:21:02,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-04 03:21:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:02,530 INFO L225 Difference]: With dead ends: 966 [2018-02-04 03:21:02,530 INFO L226 Difference]: Without dead ends: 966 [2018-02-04 03:21:02,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=501, Invalid=3159, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 03:21:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-02-04 03:21:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 925. [2018-02-04 03:21:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2018-02-04 03:21:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1166 transitions. [2018-02-04 03:21:02,538 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1166 transitions. Word has length 99 [2018-02-04 03:21:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:02,538 INFO L432 AbstractCegarLoop]: Abstraction has 925 states and 1166 transitions. [2018-02-04 03:21:02,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:21:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1166 transitions. [2018-02-04 03:21:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:21:02,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:02,539 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:02,539 INFO L371 AbstractCegarLoop]: === Iteration 111 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1080259134, now seen corresponding path program 2 times [2018-02-04 03:21:02,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:02,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:03,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:03,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:21:03,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:03,163 INFO L182 omatonBuilderFactory]: Interpolants [98909#false, 98908#true, 98911#(= 0 |ldv_malloc_#res.offset|), 98910#(= 0 |ldv_malloc_#t~malloc2.offset|), 98913#(= entry_point_~array~0.offset 0), 98912#(= 0 |entry_point_#t~ret12.offset|), 98915#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 98914#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 98917#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 98916#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 98919#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 12)))) (= entry_point_~array~0.offset 0)), 98918#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 98921#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= alloc_17_~array.offset 0)))), 98920#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 98923#(and (or (not (= alloc_17_~array.offset 0)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 98922#(and (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 98925#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 98924#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 98927#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 98926#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))))), 98929#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 98928#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 12))), 98931#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 98930#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 98933#(= 0 |free_17_#t~mem10.offset|), 98932#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))] [2018-02-04 03:21:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:03,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 03:21:03,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 03:21:03,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:21:03,163 INFO L87 Difference]: Start difference. First operand 925 states and 1166 transitions. Second operand 26 states. [2018-02-04 03:21:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:04,121 INFO L93 Difference]: Finished difference Result 937 states and 1171 transitions. [2018-02-04 03:21:04,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:21:04,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2018-02-04 03:21:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:04,122 INFO L225 Difference]: With dead ends: 937 [2018-02-04 03:21:04,122 INFO L226 Difference]: Without dead ends: 937 [2018-02-04 03:21:04,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1975, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:21:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-02-04 03:21:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 925. [2018-02-04 03:21:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2018-02-04 03:21:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1163 transitions. [2018-02-04 03:21:04,128 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1163 transitions. Word has length 102 [2018-02-04 03:21:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:04,128 INFO L432 AbstractCegarLoop]: Abstraction has 925 states and 1163 transitions. [2018-02-04 03:21:04,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 03:21:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1163 transitions. [2018-02-04 03:21:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:21:04,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:04,128 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:04,128 INFO L371 AbstractCegarLoop]: === Iteration 112 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1080259133, now seen corresponding path program 4 times [2018-02-04 03:21:04,129 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:04,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:04,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:04,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 03:21:04,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:04,807 INFO L182 omatonBuilderFactory]: Interpolants [100865#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 100864#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 100866#(= 0 |free_17_#t~mem10.base|), 100841#false, 100840#true, 100843#(= 0 |ldv_malloc_#res.offset|), 100842#(= 0 |ldv_malloc_#t~malloc2.offset|), 100845#(= 0 entry_point_~array~0.offset), 100844#(= 0 |entry_point_#t~ret12.offset|), 100847#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 100846#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 100849#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 100848#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 100851#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 12)))) (= entry_point_~array~0.offset 0)), 100850#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 100853#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 100852#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 100855#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 0)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))), 100854#(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 (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 100857#(and (or (and (or (and (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 0)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (or (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 100856#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 0)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)))), 100859#(or (<= 0 alloc_17_~j~0) (and (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|))), 100858#(or (and (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (<= 1 alloc_17_~j~0) (not (= 0 |alloc_17_#in~array.offset|))), 100861#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 100860#(or (and (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|))), 100863#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 100862#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0))] [2018-02-04 03:21:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:04,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 03:21:04,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 03:21:04,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:21:04,807 INFO L87 Difference]: Start difference. First operand 925 states and 1163 transitions. Second operand 27 states. [2018-02-04 03:21:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:05,918 INFO L93 Difference]: Finished difference Result 936 states and 1168 transitions. [2018-02-04 03:21:05,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:21:05,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-02-04 03:21:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:05,919 INFO L225 Difference]: With dead ends: 936 [2018-02-04 03:21:05,919 INFO L226 Difference]: Without dead ends: 936 [2018-02-04 03:21:05,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=1759, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 03:21:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2018-02-04 03:21:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 925. [2018-02-04 03:21:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2018-02-04 03:21:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1160 transitions. [2018-02-04 03:21:05,925 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1160 transitions. Word has length 102 [2018-02-04 03:21:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:05,925 INFO L432 AbstractCegarLoop]: Abstraction has 925 states and 1160 transitions. [2018-02-04 03:21:05,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 03:21:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1160 transitions. [2018-02-04 03:21:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:21:05,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:05,925 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:05,925 INFO L371 AbstractCegarLoop]: === Iteration 113 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:05,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1466583590, now seen corresponding path program 4 times [2018-02-04 03:21:05,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:05,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:21:06,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:06,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:21:06,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:21:06,366 INFO L182 omatonBuilderFactory]: Interpolants [102785#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 102784#(and (= 0 |free_17_#in~array.offset|) (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)))), 102787#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 102786#(not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 102788#(= 1 (select |#valid| free_17_~array.base)), 102765#false, 102764#true, 102767#(= 0 |ldv_malloc_#res.offset|), 102766#(= 0 |ldv_malloc_#t~malloc2.offset|), 102769#(= 0 entry_point_~array~0.offset), 102768#(= 0 |entry_point_#t~ret12.offset|), 102771#(and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~i~0 0) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 102770#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 102773#(= |#valid| |old(#valid)|), 102772#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= alloc_17_~i~0 1) (not (= alloc_17_~array.offset 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 102775#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 102774#(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)|)))))), 102777#(and (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret4.base|)) (or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 102776#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 102779#(or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 102778#(and (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 102781#(or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (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_~array.base |alloc_17_#in~array.base|))), 102780#(or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (and (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4)) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 102783#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= 0 entry_point_~array~0.offset)), 102782#(or (not (= 0 |alloc_17_#in~array.offset|)) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 4))))] [2018-02-04 03:21:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-04 03:21:06,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:21:06,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:21:06,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:21:06,366 INFO L87 Difference]: Start difference. First operand 925 states and 1160 transitions. Second operand 25 states. [2018-02-04 03:21:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:07,187 INFO L93 Difference]: Finished difference Result 938 states and 1168 transitions. [2018-02-04 03:21:07,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:21:07,188 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-04 03:21:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:07,189 INFO L225 Difference]: With dead ends: 938 [2018-02-04 03:21:07,189 INFO L226 Difference]: Without dead ends: 938 [2018-02-04 03:21:07,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:21:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-02-04 03:21:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 925. [2018-02-04 03:21:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2018-02-04 03:21:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1159 transitions. [2018-02-04 03:21:07,196 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1159 transitions. Word has length 100 [2018-02-04 03:21:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:07,196 INFO L432 AbstractCegarLoop]: Abstraction has 925 states and 1159 transitions. [2018-02-04 03:21:07,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:21:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1159 transitions. [2018-02-04 03:21:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 03:21:07,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:07,196 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:07,196 INFO L371 AbstractCegarLoop]: === Iteration 114 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash -859096810, now seen corresponding path program 3 times [2018-02-04 03:21:07,197 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:07,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 22 proven. 43 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-02-04 03:21:07,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:07,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:21:07,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-02-04 03:21:07,305 INFO L182 omatonBuilderFactory]: Interpolants [104687#true, 104689#(= 0 |ldv_malloc_#t~malloc2.offset|), 104688#false, 104691#(= 0 |entry_point_#t~ret12.offset|), 104690#(= 0 |ldv_malloc_#res.offset|), 104693#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 104692#(= 0 entry_point_~array~0.offset), 104695#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 104694#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 104697#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 3)), 104696#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 104699#(and (<= alloc_17_~len 3) (= alloc_17_~array.offset 0)), 104698#(and (<= |alloc_17_#in~len| 3) (= 0 |alloc_17_#in~array.offset|)), 104701#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 8))), 104700#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 12))), 104703#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))), 104702#(and (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~len) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4)))] [2018-02-04 03:21:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 22 proven. 43 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-02-04 03:21:07,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:21:07,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:21:07,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:21:07,305 INFO L87 Difference]: Start difference. First operand 925 states and 1159 transitions. Second operand 17 states. [2018-02-04 03:21:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:07,453 INFO L93 Difference]: Finished difference Result 951 states and 1170 transitions. [2018-02-04 03:21:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:21:07,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 100 [2018-02-04 03:21:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:07,455 INFO L225 Difference]: With dead ends: 951 [2018-02-04 03:21:07,455 INFO L226 Difference]: Without dead ends: 940 [2018-02-04 03:21:07,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:21:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-02-04 03:21:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 936. [2018-02-04 03:21:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-02-04 03:21:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1155 transitions. [2018-02-04 03:21:07,466 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1155 transitions. Word has length 100 [2018-02-04 03:21:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:07,466 INFO L432 AbstractCegarLoop]: Abstraction has 936 states and 1155 transitions. [2018-02-04 03:21:07,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:21:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1155 transitions. [2018-02-04 03:21:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 03:21:07,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:07,467 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:07,467 INFO L371 AbstractCegarLoop]: === Iteration 115 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:07,467 INFO L82 PathProgramCache]: Analyzing trace with hash 495764634, now seen corresponding path program 2 times [2018-02-04 03:21:07,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:07,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:08,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:08,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:21:08,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:08,191 INFO L182 omatonBuilderFactory]: Interpolants [106625#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))), 106624#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))), 106627#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= (+ free_17_~i~1 1) free_17_~len) (= free_17_~len |free_17_#in~len|))) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 106626#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))), 106629#(or (and (or (<= 13 (* 4 free_17_~len)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 8))) (* 4 free_17_~i~1))) |free_17_#in~array.base|)) (= free_17_~len |free_17_#in~len|) (<= 12 (* 4 free_17_~len))) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))), 106628#(and (or (and (or (<= 13 (* 4 free_17_~len)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 8))) (* 4 free_17_~i~1))) |free_17_#in~array.base|)) (= free_17_~len |free_17_#in~len|) (<= 12 (* 4 free_17_~len))) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))) (= 1 (select |#valid| |free_17_#in~array.base|))), 106631#(= 1 (select |#valid| entry_point_~array~0.base)), 106630#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (and (<= 12 (* 4 |free_17_#in~len|)) (or (<= 13 (* 4 |free_17_#in~len|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 8))) |free_17_#in~array.base|)))), 106603#true, 106605#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 106604#false, 106607#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 106606#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 106609#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 106608#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 106611#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 106610#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 106613#(and (or (<= (* 4 entry_point_~i~2) 11) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))))) (<= (* 4 entry_point_~i~2) 12) (= entry_point_~array~0.offset 0)), 106612#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 106615#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 106614#(and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) 12) (or (<= (* 4 entry_point_~len~0) 11) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8)))))), 106617#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 106616#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 106619#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 106618#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 106621#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 106620#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 106623#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))), 106622#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|)))] [2018-02-04 03:21:08,191 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:08,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:21:08,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:21:08,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:21:08,191 INFO L87 Difference]: Start difference. First operand 936 states and 1155 transitions. Second operand 29 states. [2018-02-04 03:21:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:09,496 INFO L93 Difference]: Finished difference Result 951 states and 1162 transitions. [2018-02-04 03:21:09,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:21:09,496 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 99 [2018-02-04 03:21:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:09,497 INFO L225 Difference]: With dead ends: 951 [2018-02-04 03:21:09,497 INFO L226 Difference]: Without dead ends: 951 [2018-02-04 03:21:09,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=380, Invalid=2700, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:21:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-02-04 03:21:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 936. [2018-02-04 03:21:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-02-04 03:21:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1155 transitions. [2018-02-04 03:21:09,504 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1155 transitions. Word has length 99 [2018-02-04 03:21:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:09,504 INFO L432 AbstractCegarLoop]: Abstraction has 936 states and 1155 transitions. [2018-02-04 03:21:09,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:21:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1155 transitions. [2018-02-04 03:21:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 03:21:09,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:09,504 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:09,504 INFO L371 AbstractCegarLoop]: === Iteration 116 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash 599907728, now seen corresponding path program 10 times [2018-02-04 03:21:09,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:09,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:09,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:09,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:21:09,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:09,805 INFO L182 omatonBuilderFactory]: Interpolants [108577#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 108576#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 108579#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 108578#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 108581#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 108580#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 108583#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 108582#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 108585#(and (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 16)))) (= entry_point_~array~0.offset 0)), 108584#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 108587#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 108586#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16)))) (= entry_point_~array~0.offset 0)), 108589#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)))), 108588#(and (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16))) (= 0 |free_17_#in~array.offset|)), 108591#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))) (= free_17_~array.offset 0)), 108590#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12))))) (= free_17_~array.offset 0)), 108593#(not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))), 108592#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4))))) (= free_17_~array.offset 0)), 108595#(= 1 (select |#valid| free_17_~array.base)), 108594#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 108573#true, 108575#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 108574#false] [2018-02-04 03:21:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:09,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:21:09,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:21:09,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:21:09,806 INFO L87 Difference]: Start difference. First operand 936 states and 1155 transitions. Second operand 23 states. [2018-02-04 03:21:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:10,581 INFO L93 Difference]: Finished difference Result 959 states and 1176 transitions. [2018-02-04 03:21:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:21:10,582 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 101 [2018-02-04 03:21:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:10,583 INFO L225 Difference]: With dead ends: 959 [2018-02-04 03:21:10,583 INFO L226 Difference]: Without dead ends: 959 [2018-02-04 03:21:10,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:21:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-02-04 03:21:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 941. [2018-02-04 03:21:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-02-04 03:21:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1161 transitions. [2018-02-04 03:21:10,592 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1161 transitions. Word has length 101 [2018-02-04 03:21:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:10,592 INFO L432 AbstractCegarLoop]: Abstraction has 941 states and 1161 transitions. [2018-02-04 03:21:10,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:21:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1161 transitions. [2018-02-04 03:21:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 03:21:10,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:10,593 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2018-02-04 03:21:10,593 INFO L371 AbstractCegarLoop]: === Iteration 117 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1780549024, now seen corresponding path program 3 times [2018-02-04 03:21:10,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:10,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:21:11,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:11,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:21:11,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:21:11,084 INFO L182 omatonBuilderFactory]: Interpolants [110543#true, 110545#(= 0 |ldv_malloc_#t~malloc2.offset|), 110544#false, 110547#(= 0 |entry_point_#t~ret12.offset|), 110546#(= 0 |ldv_malloc_#res.offset|), 110549#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 110548#(= entry_point_~array~0.offset 0), 110551#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0)), 110550#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= entry_point_~array~0.offset 0)), 110553#(and (or (= 12 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 11)) (= entry_point_~array~0.offset 0)), 110552#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 12) (= entry_point_~array~0.offset 0)), 110555#(and (or (and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 110554#(and (or (and (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 110557#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 110556#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 110559#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 110558#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 110561#(or (and (or (<= 13 (* 4 alloc_17_~len)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))))) (<= 12 (* 4 alloc_17_~len)) (= alloc_17_~len |alloc_17_#in~len|)) (not (= 0 |alloc_17_#in~array.offset|))), 110560#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 110563#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 12) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~len~0) (- 4))))) (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 11)) (= entry_point_~array~0.offset 0)), 110562#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (<= 12 (* 4 |alloc_17_#in~len|)) (or (<= 13 (* 4 |alloc_17_#in~len|)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (- (- 8))))))), 110565#(and (<= (* 4 free_17_~len) 12) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~len) (- 4)))) (<= (* 4 free_17_~len) 11)) (= free_17_~array.offset 0)), 110564#(and (or (<= (* 4 |free_17_#in~len|) 11) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ (* 4 |free_17_#in~len|) (- 4))))) (<= (* 4 |free_17_#in~len|) 12) (= 0 |free_17_#in~array.offset|)), 110567#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~len) (- 4)))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 7))) (= free_17_~array.offset 0)), 110566#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~len) (- 4)))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 11))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 110569#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 110568#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 3)) (= free_17_~array.offset 0))), 110570#(= 0 |free_17_#t~mem10.offset|)] [2018-02-04 03:21:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:21:11,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:21:11,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:21:11,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:21:11,085 INFO L87 Difference]: Start difference. First operand 941 states and 1161 transitions. Second operand 28 states. [2018-02-04 03:21:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:11,806 INFO L93 Difference]: Finished difference Result 951 states and 1169 transitions. [2018-02-04 03:21:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:21:11,806 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2018-02-04 03:21:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:11,807 INFO L225 Difference]: With dead ends: 951 [2018-02-04 03:21:11,807 INFO L226 Difference]: Without dead ends: 951 [2018-02-04 03:21:11,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1511, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:21:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-02-04 03:21:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 941. [2018-02-04 03:21:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-02-04 03:21:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1160 transitions. [2018-02-04 03:21:11,813 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1160 transitions. Word has length 101 [2018-02-04 03:21:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:11,813 INFO L432 AbstractCegarLoop]: Abstraction has 941 states and 1160 transitions. [2018-02-04 03:21:11,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:21:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1160 transitions. [2018-02-04 03:21:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 03:21:11,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:11,813 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2018-02-04 03:21:11,814 INFO L371 AbstractCegarLoop]: === Iteration 118 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1780549025, now seen corresponding path program 3 times [2018-02-04 03:21:11,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:11,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:21:13,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:13,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 03:21:13,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:21:13,519 INFO L182 omatonBuilderFactory]: Interpolants [112513#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= alloc_17_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (not (= |alloc_17_#t~ret4.base| 0)) (<= (+ (div (+ (+ (- alloc_17_~array.offset) alloc_17_~array.offset) (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 112512#(or (and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|)), 112515#(and (or (and (<= alloc_17_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0)) (<= (+ (div (+ (+ (- alloc_17_~array.offset) alloc_17_~array.offset) (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 112514#(and (or (and (<= alloc_17_~i~0 1) (not (= 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) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (= 1 (select |#valid| alloc_17_~p~0.base)) (<= (+ (div (+ (+ (- alloc_17_~array.offset) alloc_17_~array.offset) (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (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) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 112517#(and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 112516#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (<= alloc_17_~i~0 2) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ alloc_17_~array.offset (- 4))) alloc_17_~array.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ alloc_17_~array.offset (- 4))) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 112519#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) |alloc_17_#t~ret4.base|)) (<= alloc_17_~i~0 2) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ alloc_17_~array.offset (- 4))) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- (+ alloc_17_~array.offset (- 4))) alloc_17_~array.offset)) 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 112518#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 112521#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))) 0)) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- 0)) 0)) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- 0)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))))))), 112520#(and (or (not (= alloc_17_~array.offset 0)) (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= 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) (+ (- (+ alloc_17_~array.offset (- 4))) alloc_17_~array.offset)) 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) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)) alloc_17_~p~0.base) (+ (- (+ alloc_17_~array.offset (- 4))) alloc_17_~array.offset)))) (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) alloc_17_~array.offset)) alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.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) alloc_17_~array.offset)) 0)))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 112523#(and (= 0 |free_17_#in~array.offset|) (or (<= (* 4 |free_17_#in~len|) 11) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 |free_17_#in~len|) (- 4))))) (<= |free_17_#in~len| 3) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 |free_17_#in~len|) (- 8))) 0)) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 |free_17_#in~len|) (- 4))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 |free_17_#in~len|) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 |free_17_#in~len|) (- 4)))))))), 112522#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) 11) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~len~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~len~0) (- 8))) 0)))) (<= (* 4 entry_point_~len~0) 12)), 112525#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (and (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) 0)) (not (= |free_17_#t~mem10.base| 0)))) (= free_17_~array.offset 0)), 112524#(and (<= (* 4 free_17_~len) 12) (= free_17_~array.offset 0) (or (and (or (and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) 0))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) 0))) (<= (* 4 free_17_~len) 11))), 112527#(and (or (and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) 0))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 7))) (= free_17_~array.offset 0)), 112526#(and (or (and (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))) 0))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 11))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 112529#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4)))))) (= free_17_~array.offset 0)), 112528#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 4))))) (not (= |free_17_#t~mem10.base| 0)))) (= free_17_~array.offset 0)), 112531#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~array.offset 0)), 112530#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 3)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (= free_17_~array.offset 0)), 112532#(= 1 (select |#valid| |free_17_#t~mem10.base|)), 112491#true, 112493#(= 0 |ldv_malloc_#t~malloc2.offset|), 112492#false, 112495#(= 0 |entry_point_#t~ret12.offset|), 112494#(= 0 |ldv_malloc_#res.offset|), 112497#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 112496#(= entry_point_~array~0.offset 0), 112499#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 112498#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 112501#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 3)), 112500#(and (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 112503#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 112502#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 112505#(and (or (and (not (= |alloc_17_#t~ret4.base| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 112504#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 112507#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= 1 (select |#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|)) (not (= alloc_17_~array.offset 0)))), 112506#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 112509#(= |#valid| |old(#valid)|), 112508#(and (or (and (<= alloc_17_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (- alloc_17_~array.offset) alloc_17_~array.offset)) 0)) (<= (+ (div (+ (+ (- alloc_17_~array.offset) alloc_17_~array.offset) (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 112511#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))) (<= 4294967296 |ldv_malloc_#in~size|)), 112510#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)))] [2018-02-04 03:21:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:21:13,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 03:21:13,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 03:21:13,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1615, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:21:13,520 INFO L87 Difference]: Start difference. First operand 941 states and 1160 transitions. Second operand 42 states. [2018-02-04 03:21:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:15,910 INFO L93 Difference]: Finished difference Result 951 states and 1167 transitions. [2018-02-04 03:21:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 03:21:15,910 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 101 [2018-02-04 03:21:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:15,911 INFO L225 Difference]: With dead ends: 951 [2018-02-04 03:21:15,911 INFO L226 Difference]: Without dead ends: 951 [2018-02-04 03:21:15,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=277, Invalid=3883, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 03:21:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-02-04 03:21:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 941. [2018-02-04 03:21:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-02-04 03:21:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1159 transitions. [2018-02-04 03:21:15,917 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1159 transitions. Word has length 101 [2018-02-04 03:21:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:15,917 INFO L432 AbstractCegarLoop]: Abstraction has 941 states and 1159 transitions. [2018-02-04 03:21:15,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 03:21:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1159 transitions. [2018-02-04 03:21:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:21:15,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:15,918 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:15,918 INFO L371 AbstractCegarLoop]: === Iteration 119 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:15,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2048694506, now seen corresponding path program 8 times [2018-02-04 03:21:15,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:15,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:21:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:17,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:17,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 03:21:17,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:17,370 INFO L182 omatonBuilderFactory]: Interpolants [114497#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= free_17_~i~1 2) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 4))))))))) (= free_17_~array.base |free_17_#in~array.base|)))), 114496#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= free_17_~i~1 2) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 4)))))))))))), 114499#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= free_17_~i~1 3) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 4)))))))) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 8))))))) (= free_17_~array.base |free_17_#in~array.base|)) (not (= free_17_~array.offset 0)))), 114498#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= free_17_~i~1 2) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (and (<= free_17_~i~1 2) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 4)))))))))))), 114501#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= free_17_~i~1 3) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= free_17_~i~1 3) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 4)))))))) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 8))))))) (= free_17_~array.base |free_17_#in~array.base|)))), 114500#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= free_17_~i~1 3) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 4)))))))) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 8))))))) (= free_17_~array.base |free_17_#in~array.base|)))), 114503#(or (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 16))) (* 4 free_17_~i~1)))) (or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= |#valid| |old(#valid)|))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 114502#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= free_17_~i~1 4) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 4))))))) (<= 16 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 12))))))) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 8)))))))))), 114504#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (- 16))) (* 4 free_17_~i~1))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 114471#true, 114473#(= |#valid| |old(#valid)|), 114472#false, 114475#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 114474#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 114477#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 114476#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret12.base| (select |#valid| |entry_point_#t~ret12.base|))) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret12.base|) 0)), 114479#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 114478#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= entry_point_~i~2 0)), 114481#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 114480#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 114483#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (<= entry_point_~i~2 2) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4))) 4) 1) entry_point_~i~2) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 114482#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (<= entry_point_~i~2 2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (not (= entry_point_~array~0.base 0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base)))), 114485#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)))) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 114484#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)))) (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)) (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 114487#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)))) (<= entry_point_~i~2 4)), 114486#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8)))) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (not (= entry_point_~array~0.base 0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset 12)))), 114489#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 114488#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (not (= entry_point_~array~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 8))))), 114491#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= free_17_~array.offset 0))) (= free_17_~i~1 0)), 114490#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (= free_17_~i~1 0)), 114493#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= |#valid| |old(#valid)|) (<= free_17_~i~1 1)))))), 114492#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))))) (= free_17_~i~1 0)), 114495#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (<= free_17_~i~1 1)))))), 114494#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (or (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (<= free_17_~i~1 1))))))] [2018-02-04 03:21:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:17,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 03:21:17,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 03:21:17,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:21:17,371 INFO L87 Difference]: Start difference. First operand 941 states and 1159 transitions. Second operand 34 states. [2018-02-04 03:21:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:18,561 INFO L93 Difference]: Finished difference Result 1026 states and 1264 transitions. [2018-02-04 03:21:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 03:21:18,562 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 102 [2018-02-04 03:21:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:18,563 INFO L225 Difference]: With dead ends: 1026 [2018-02-04 03:21:18,563 INFO L226 Difference]: Without dead ends: 985 [2018-02-04 03:21:18,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:21:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-02-04 03:21:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 907. [2018-02-04 03:21:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-02-04 03:21:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1124 transitions. [2018-02-04 03:21:18,569 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1124 transitions. Word has length 102 [2018-02-04 03:21:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:18,569 INFO L432 AbstractCegarLoop]: Abstraction has 907 states and 1124 transitions. [2018-02-04 03:21:18,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 03:21:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1124 transitions. [2018-02-04 03:21:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:21:18,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:18,569 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:18,570 INFO L371 AbstractCegarLoop]: === Iteration 120 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1417270442, now seen corresponding path program 7 times [2018-02-04 03:21:18,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:18,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 49 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:19,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:19,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:21:19,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:19,126 INFO L182 omatonBuilderFactory]: Interpolants [116481#(= 0 |free_17_#t~mem10.offset|), 116480#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 116455#false, 116454#true, 116457#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0))), 116456#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 116459#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)), 116458#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|))), 116461#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 116460#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 116463#(and (= entry_point_~array~0.offset 0) (or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))))), 116462#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))) (= entry_point_~array~0.offset 0)), 116465#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 17) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 4) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 17) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 116464#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 13) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 13) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= entry_point_~i~2 3))) (= entry_point_~array~0.offset 0)), 116467#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 21) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= entry_point_~i~2 5))) (= entry_point_~array~0.offset 0)), 116466#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 21) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 21) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= entry_point_~i~2 5))) (= entry_point_~array~0.offset 0)), 116469#(and (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 24)) (or (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 23)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (select |#length| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) (- 4)))))))) (= entry_point_~array~0.offset 0)), 116468#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= entry_point_~i~2 5)), 116471#(and (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 116470#(and (<= (select |#length| entry_point_~array~0.base) 24) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (select |#length| entry_point_~array~0.base) (- 4))))) (<= (select |#length| entry_point_~array~0.base) 23)) (= entry_point_~array~0.offset 0)), 116473#(and (<= (select |#length| |free_17_#in~array.base|) 24) (or (<= (select |#length| |free_17_#in~array.base|) 23) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ (select |#length| |free_17_#in~array.base|) (- 4)))))), 116472#(= |old(#length)| |#length|), 116475#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 24)) (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 23)) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))))), 116474#(and (or (<= (select |#length| free_17_~array.base) 23) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) 24)), 116477#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 15))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 16))), 116476#(and (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 19))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 20))), 116479#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)))), 116478#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)))] [2018-02-04 03:21:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 49 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:19,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:21:19,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:21:19,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:21:19,127 INFO L87 Difference]: Start difference. First operand 907 states and 1124 transitions. Second operand 28 states. [2018-02-04 03:21:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:20,964 INFO L93 Difference]: Finished difference Result 971 states and 1197 transitions. [2018-02-04 03:21:20,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 03:21:20,964 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 102 [2018-02-04 03:21:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:20,965 INFO L225 Difference]: With dead ends: 971 [2018-02-04 03:21:20,965 INFO L226 Difference]: Without dead ends: 971 [2018-02-04 03:21:20,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=511, Invalid=3271, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:21:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-02-04 03:21:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 958. [2018-02-04 03:21:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-02-04 03:21:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1186 transitions. [2018-02-04 03:21:20,971 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1186 transitions. Word has length 102 [2018-02-04 03:21:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:20,971 INFO L432 AbstractCegarLoop]: Abstraction has 958 states and 1186 transitions. [2018-02-04 03:21:20,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:21:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1186 transitions. [2018-02-04 03:21:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:21:20,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:20,972 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:20,972 INFO L371 AbstractCegarLoop]: === Iteration 121 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1417270443, now seen corresponding path program 7 times [2018-02-04 03:21:20,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:20,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 49 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:21,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:21,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:21:21,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:21,493 INFO L182 omatonBuilderFactory]: Interpolants [118479#true, 118481#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 118480#false, 118483#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|))), 118482#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= (+ |ldv_malloc_#in~size| 1) 0))), 118485#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 118484#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| |entry_point_#t~ret12.base|) (* 4 entry_point_~len~0))) (= 0 |entry_point_#t~ret12.offset|)), 118487#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 1) (or (<= (+ (* 4 entry_point_~len~0) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))))) (= entry_point_~array~0.offset 0)), 118486#(and (or (<= (+ entry_point_~len~0 1) 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 118489#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 13) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 13) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= entry_point_~i~2 3))) (= entry_point_~array~0.offset 0)), 118488#(and (= entry_point_~array~0.offset 0) (or (<= (+ (select |#length| entry_point_~array~0.base) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 2) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 9) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))))), 118491#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 21) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (or (<= (+ (* 4 entry_point_~len~0) 21) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (<= entry_point_~i~2 5))) (= entry_point_~array~0.offset 0)), 118490#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 17) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= entry_point_~i~2 4) (or (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= (+ (* 4 entry_point_~len~0) 17) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 118493#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= entry_point_~i~2 5)), 118492#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 21) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0)) (<= entry_point_~i~2 5))) (= entry_point_~array~0.offset 0)), 118495#(and (<= (select |#length| entry_point_~array~0.base) 24) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (select |#length| entry_point_~array~0.base) (- 4))))) (<= (select |#length| entry_point_~array~0.base) 23)) (= entry_point_~array~0.offset 0)), 118494#(and (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 24)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (select |#length| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) (- 4))))))) (<= (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~i~2)) (+ (* 4 entry_point_~len~0) 23)))), 118497#(= |old(#length)| |#length|), 118496#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|)), 118499#(and (<= (select |#length| free_17_~array.base) 24) (or (<= (select |#length| free_17_~array.base) 23) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))))), 118498#(and (<= (select |#length| |free_17_#in~array.base|) 24) (or (<= (select |#length| |free_17_#in~array.base|) 23) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (select |#length| |free_17_#in~array.base|) (- 4)))))), 118501#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 20)) (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 19)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))))), 118500#(and (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 24)) (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 23)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4)))))), 118503#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 11)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 12))), 118502#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 15)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 16))), 118505#(or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 3))), 118504#(and (or (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (select |#length| free_17_~array.base) (- 4))))) (<= (select |#length| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset 8))), 118506#(= 0 |free_17_#t~mem10.base|)] [2018-02-04 03:21:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 49 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:21:21,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:21:21,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:21:21,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:21:21,494 INFO L87 Difference]: Start difference. First operand 958 states and 1186 transitions. Second operand 28 states. [2018-02-04 03:21:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:23,129 INFO L93 Difference]: Finished difference Result 970 states and 1196 transitions. [2018-02-04 03:21:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 03:21:23,130 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 102 [2018-02-04 03:21:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:23,131 INFO L225 Difference]: With dead ends: 970 [2018-02-04 03:21:23,131 INFO L226 Difference]: Without dead ends: 970 [2018-02-04 03:21:23,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=410, Invalid=2670, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:21:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-02-04 03:21:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 958. [2018-02-04 03:21:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-02-04 03:21:23,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1185 transitions. [2018-02-04 03:21:23,137 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1185 transitions. Word has length 102 [2018-02-04 03:21:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:23,137 INFO L432 AbstractCegarLoop]: Abstraction has 958 states and 1185 transitions. [2018-02-04 03:21:23,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:21:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1185 transitions. [2018-02-04 03:21:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:21:23,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:23,138 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:23,138 INFO L371 AbstractCegarLoop]: === Iteration 122 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash -637601197, now seen corresponding path program 3 times [2018-02-04 03:21:23,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:23,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 03:21:23,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:23,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:21:23,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:21:23,220 INFO L182 omatonBuilderFactory]: Interpolants [120491#true, 120493#(= 0 |ldv_malloc_#t~malloc2.offset|), 120492#false, 120495#(= 0 |entry_point_#t~ret12.offset|), 120494#(= 0 |ldv_malloc_#res.offset|), 120497#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 120496#(= entry_point_~array~0.offset 0), 120499#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 120498#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 120501#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 120500#(and (= entry_point_~array~0.offset 0) (<= 12 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 120503#(and (<= free_17_~i~1 2) (= free_17_~len |free_17_#in~len|)), 120502#(and (= free_17_~len |free_17_#in~len|) (<= free_17_~i~1 1)), 120504#(<= |free_17_#in~len| 2)] [2018-02-04 03:21:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 03:21:23,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:21:23,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:21:23,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:21:23,220 INFO L87 Difference]: Start difference. First operand 958 states and 1185 transitions. Second operand 14 states. [2018-02-04 03:21:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:23,294 INFO L93 Difference]: Finished difference Result 972 states and 1187 transitions. [2018-02-04 03:21:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:21:23,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2018-02-04 03:21:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:23,295 INFO L225 Difference]: With dead ends: 972 [2018-02-04 03:21:23,295 INFO L226 Difference]: Without dead ends: 968 [2018-02-04 03:21:23,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:21:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-02-04 03:21:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 958. [2018-02-04 03:21:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-02-04 03:21:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1183 transitions. [2018-02-04 03:21:23,302 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1183 transitions. Word has length 102 [2018-02-04 03:21:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:23,302 INFO L432 AbstractCegarLoop]: Abstraction has 958 states and 1183 transitions. [2018-02-04 03:21:23,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:21:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1183 transitions. [2018-02-04 03:21:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 03:21:23,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:23,302 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:23,302 INFO L371 AbstractCegarLoop]: === Iteration 123 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash 985664649, now seen corresponding path program 6 times [2018-02-04 03:21:23,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:23,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 53 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:23,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:23,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:21:23,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:23,448 INFO L182 omatonBuilderFactory]: Interpolants [122441#true, 122443#(= 0 |ldv_malloc_#t~malloc2.offset|), 122442#false, 122445#(= 0 |entry_point_#t~ret12.offset|), 122444#(= 0 |ldv_malloc_#res.offset|), 122447#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 122446#(= entry_point_~array~0.offset 0), 122449#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 122448#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 122451#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 122450#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 122453#(and (<= 24 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 122452#(and (<= 20 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 122455#(and (= free_17_~len |free_17_#in~len|) (<= free_17_~i~1 1)), 122454#(and (= free_17_~i~1 0) (= free_17_~len |free_17_#in~len|)), 122457#(and (<= free_17_~i~1 3) (= free_17_~len |free_17_#in~len|)), 122456#(and (<= free_17_~i~1 2) (= free_17_~len |free_17_#in~len|)), 122459#(and (<= free_17_~i~1 5) (= free_17_~len |free_17_#in~len|)), 122458#(and (<= free_17_~i~1 4) (= free_17_~len |free_17_#in~len|)), 122460#(<= |free_17_#in~len| 5)] [2018-02-04 03:21:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 53 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:23,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:21:23,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:21:23,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:21:23,449 INFO L87 Difference]: Start difference. First operand 958 states and 1183 transitions. Second operand 20 states. [2018-02-04 03:21:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:23,604 INFO L93 Difference]: Finished difference Result 1057 states and 1296 transitions. [2018-02-04 03:21:23,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:21:23,604 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2018-02-04 03:21:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:23,605 INFO L225 Difference]: With dead ends: 1057 [2018-02-04 03:21:23,605 INFO L226 Difference]: Without dead ends: 1043 [2018-02-04 03:21:23,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:21:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2018-02-04 03:21:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 983. [2018-02-04 03:21:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-02-04 03:21:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1224 transitions. [2018-02-04 03:21:23,611 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1224 transitions. Word has length 103 [2018-02-04 03:21:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:23,611 INFO L432 AbstractCegarLoop]: Abstraction has 983 states and 1224 transitions. [2018-02-04 03:21:23,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:21:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1224 transitions. [2018-02-04 03:21:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 03:21:23,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:23,612 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:23,612 INFO L371 AbstractCegarLoop]: === Iteration 124 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:23,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1068248018, now seen corresponding path program 2 times [2018-02-04 03:21:23,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:23,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:21:25,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:25,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 03:21:25,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:21:25,834 INFO L182 omatonBuilderFactory]: Interpolants [124545#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (<= free_17_~i~1 1)))), 124544#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (<= free_17_~i~1 1)))), 124547#(and (or (not (= free_17_~array.offset 0)) (and (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (- 4))))))) (and (<= free_17_~i~1 2) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|))) (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0))), 124546#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= free_17_~i~1 1)) (and (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (= free_17_~array.base |free_17_#in~array.base|)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (<= free_17_~i~1 1)))), 124549#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= |#valid| |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 8)))))))), 124548#(or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (and (= |#valid| |old(#valid)|) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* 4 free_17_~i~1) (- 8))))))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (not (= |free_17_#in~array.offset| 0))), 124550#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0)), 124513#false, 124512#true, 124515#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (store |#valid| |ldv_malloc_#t~malloc2.base| (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)) |old(#valid)|) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 124514#(= |#valid| |old(#valid)|), 124517#(and (= 0 (select |old(#valid)| |entry_point_#t~ret12.base|)) (= (select |#valid| |entry_point_#t~ret12.base|) 1) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)), 124516#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0))), 124519#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 124518#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 124521#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 124520#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 124523#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 124522#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 124525#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 124524#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (not (= entry_point_~array~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 124527#(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)) (= |#valid| |old(#valid)|)), 124526#(and (or (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 124529#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 124528#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (store |#valid| |ldv_malloc_#t~malloc2.base| (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 124531#(and (or (and (not (= alloc_17_~p~0.base 0)) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (= (store |#valid| alloc_17_~p~0.base (select |old(#valid)| alloc_17_~p~0.base)) |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 124530#(and (or (and (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (= |old(#valid)| (store |#valid| |alloc_17_#t~ret4.base| (select |old(#valid)| |alloc_17_#t~ret4.base|))) (not (= |alloc_17_#t~ret4.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 124533#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 (+ alloc_17_~i~0 (- 1))) alloc_17_~array.offset)) 0)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#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 (- 1))) alloc_17_~array.offset)))) (= (store |#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) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset (- 4))))) |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (not (= alloc_17_~array.offset 0)))), 124532#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= |old(#valid)| (store |#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 (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|)) (not (= alloc_17_~array.offset 0)))), 124535#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= |alloc_17_#t~mem7.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (= 0 (select |old(#valid)| |alloc_17_#t~mem7.base|)) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (= |old(#valid)| (store |#valid| |alloc_17_#t~mem7.base| (select |old(#valid)| |alloc_17_#t~mem7.base|))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) 0))) (not (= alloc_17_~array.offset 0)))), 124534#(and (or (and (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) 0))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 124537#(or (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= |#valid| |old(#valid)|) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= 1 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0)))) (not (= 0 |alloc_17_#in~array.offset|))), 124536#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= |#valid| |old(#valid)|) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 124539#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (= |#valid| |old(#valid)|) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 124538#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (= |#valid| |old(#valid)|) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (or (<= 0 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 124541#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0)))), 124540#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= |old(#valid)| (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base))) (not (= entry_point_~array~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (- entry_point_~array~0.offset) 4)))) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 124543#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (and (= free_17_~array.base |free_17_#in~array.base|) (not (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|))) (= free_17_~i~1 0)))), 124542#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~i~1 0))))] [2018-02-04 03:21:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:21:25,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 03:21:25,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 03:21:25,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1366, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 03:21:25,835 INFO L87 Difference]: Start difference. First operand 983 states and 1224 transitions. Second operand 39 states. [2018-02-04 03:21:27,596 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 74 DAG size of output 64 [2018-02-04 03:21:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:28,335 INFO L93 Difference]: Finished difference Result 1000 states and 1226 transitions. [2018-02-04 03:21:28,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 03:21:28,335 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-02-04 03:21:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:28,336 INFO L225 Difference]: With dead ends: 1000 [2018-02-04 03:21:28,336 INFO L226 Difference]: Without dead ends: 956 [2018-02-04 03:21:28,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=226, Invalid=2744, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 03:21:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-02-04 03:21:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 942. [2018-02-04 03:21:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-02-04 03:21:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1182 transitions. [2018-02-04 03:21:28,344 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1182 transitions. Word has length 102 [2018-02-04 03:21:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:28,344 INFO L432 AbstractCegarLoop]: Abstraction has 942 states and 1182 transitions. [2018-02-04 03:21:28,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 03:21:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1182 transitions. [2018-02-04 03:21:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 03:21:28,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:28,344 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:28,345 INFO L371 AbstractCegarLoop]: === Iteration 125 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -329773391, now seen corresponding path program 4 times [2018-02-04 03:21:28,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:28,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 9 proven. 103 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 03:21:28,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:28,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:21:28,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:28,775 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:21:28,775 INFO L182 omatonBuilderFactory]: Interpolants [126529#(= 0 |entry_point_#t~ret12.offset|), 126528#(= 0 |ldv_malloc_#res.offset|), 126531#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 126530#(= entry_point_~array~0.offset 0), 126533#(= 0 |alloc_17_#in~array.offset|), 126532#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 126535#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 126534#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 126537#(= |#valid| |old(#valid)|), 126536#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 126539#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 126538#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 126541#(and (not (= alloc_17_~p~0.base 0)) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 126540#(and (not (= alloc_17_~array.base |alloc_17_#t~ret4.base|)) (= alloc_17_~array.offset 0) (not (= |alloc_17_#t~ret4.base| 0))), 126543#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4)))))) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 4)))) 0))), 126542#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0))), 126545#(and (not (= (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ alloc_17_~array.offset (+ (* 4 alloc_17_~j~0) (- 4)))) 0)) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) (+ alloc_17_~array.offset (+ (* 4 alloc_17_~j~0) (- 4))))))), 126544#(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) (+ alloc_17_~array.offset (- 8)))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (+ alloc_17_~array.offset (- 8)))) 0))), 126547#(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)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) 0))), 126546#(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) (+ alloc_17_~array.offset (+ (* 4 alloc_17_~j~0) (- 4)))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (+ (* 4 alloc_17_~j~0) (- 4)))) 0))), 126549#(= 1 (select |#valid| alloc_17_~array.base)), 126548#(and (not (= |alloc_17_#t~mem7.base| 0)) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base |alloc_17_#t~mem7.base|))), 126525#true, 126527#(= 0 |ldv_malloc_#t~malloc2.offset|), 126526#false] [2018-02-04 03:21:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 9 proven. 103 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 03:21:28,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:21:28,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:21:28,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:21:28,776 INFO L87 Difference]: Start difference. First operand 942 states and 1182 transitions. Second operand 25 states. [2018-02-04 03:21:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:29,590 INFO L93 Difference]: Finished difference Result 966 states and 1214 transitions. [2018-02-04 03:21:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 03:21:29,590 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-04 03:21:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:29,591 INFO L225 Difference]: With dead ends: 966 [2018-02-04 03:21:29,591 INFO L226 Difference]: Without dead ends: 966 [2018-02-04 03:21:29,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=2726, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 03:21:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-02-04 03:21:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 946. [2018-02-04 03:21:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-02-04 03:21:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1186 transitions. [2018-02-04 03:21:29,597 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1186 transitions. Word has length 112 [2018-02-04 03:21:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:29,597 INFO L432 AbstractCegarLoop]: Abstraction has 946 states and 1186 transitions. [2018-02-04 03:21:29,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:21:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1186 transitions. [2018-02-04 03:21:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 03:21:29,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:29,598 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:29,598 INFO L371 AbstractCegarLoop]: === Iteration 126 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:29,598 INFO L82 PathProgramCache]: Analyzing trace with hash -803301068, now seen corresponding path program 3 times [2018-02-04 03:21:29,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:29,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:21:29,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:29,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:21:29,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:21:29,758 INFO L182 omatonBuilderFactory]: Interpolants [128525#false, 128524#true, 128527#(= 0 |ldv_malloc_#res.offset|), 128526#(= 0 |ldv_malloc_#t~malloc2.offset|), 128529#(= 0 entry_point_~array~0.offset), 128528#(= 0 |entry_point_#t~ret12.offset|), 128531#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 128530#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 128533#(and (or (<= (+ alloc_17_~array.offset 8) (select |#length| alloc_17_~array.base)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 128532#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 8) (select |#length| alloc_17_~array.base)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 128535#(and (<= 8 (select |#length| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset)), 128534#(or (<= 8 (select |#length| |alloc_17_#in~array.base|)) (not (= 0 |alloc_17_#in~array.offset|))), 128537#(and (<= 8 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 128536#(and (<= 8 (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 128538#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-04 03:21:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-02-04 03:21:29,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:21:29,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:21:29,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:21:29,758 INFO L87 Difference]: Start difference. First operand 946 states and 1186 transitions. Second operand 15 states. [2018-02-04 03:21:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:29,924 INFO L93 Difference]: Finished difference Result 956 states and 1180 transitions. [2018-02-04 03:21:29,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:21:29,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2018-02-04 03:21:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:29,925 INFO L225 Difference]: With dead ends: 956 [2018-02-04 03:21:29,925 INFO L226 Difference]: Without dead ends: 956 [2018-02-04 03:21:29,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:21:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-02-04 03:21:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 946. [2018-02-04 03:21:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-02-04 03:21:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1176 transitions. [2018-02-04 03:21:29,931 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1176 transitions. Word has length 105 [2018-02-04 03:21:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:29,931 INFO L432 AbstractCegarLoop]: Abstraction has 946 states and 1176 transitions. [2018-02-04 03:21:29,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:21:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1176 transitions. [2018-02-04 03:21:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 03:21:29,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:29,932 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:29,932 INFO L371 AbstractCegarLoop]: === Iteration 127 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:29,932 INFO L82 PathProgramCache]: Analyzing trace with hash -820833592, now seen corresponding path program 8 times [2018-02-04 03:21:29,933 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:29,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 53 proven. 81 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 03:21:30,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:30,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:21:30,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 03:21:30,066 INFO L182 omatonBuilderFactory]: Interpolants [130465#(and (<= alloc_17_~i~0 3) (= alloc_17_~len |alloc_17_#in~len|)), 130464#(and (<= alloc_17_~i~0 2) (= alloc_17_~len |alloc_17_#in~len|)), 130467#(<= |alloc_17_#in~len| 4), 130466#(and (= alloc_17_~len |alloc_17_#in~len|) (<= alloc_17_~i~0 4)), 130449#true, 130451#(= 0 |ldv_malloc_#t~malloc2.offset|), 130450#false, 130453#(= 0 |entry_point_#t~ret12.offset|), 130452#(= 0 |ldv_malloc_#res.offset|), 130455#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 130454#(= entry_point_~array~0.offset 0), 130457#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 130456#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 130459#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 130458#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 130461#(and (<= 24 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 130460#(and (<= 20 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 130463#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 130462#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|))] [2018-02-04 03:21:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 53 proven. 81 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 03:21:30,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:21:30,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:21:30,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:21:30,066 INFO L87 Difference]: Start difference. First operand 946 states and 1176 transitions. Second operand 19 states. [2018-02-04 03:21:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:30,239 INFO L93 Difference]: Finished difference Result 1004 states and 1239 transitions. [2018-02-04 03:21:30,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:21:30,239 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 114 [2018-02-04 03:21:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:30,241 INFO L225 Difference]: With dead ends: 1004 [2018-02-04 03:21:30,241 INFO L226 Difference]: Without dead ends: 1004 [2018-02-04 03:21:30,241 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:21:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-02-04 03:21:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 955. [2018-02-04 03:21:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-02-04 03:21:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1187 transitions. [2018-02-04 03:21:30,248 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1187 transitions. Word has length 114 [2018-02-04 03:21:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:30,248 INFO L432 AbstractCegarLoop]: Abstraction has 955 states and 1187 transitions. [2018-02-04 03:21:30,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:21:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1187 transitions. [2018-02-04 03:21:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 03:21:30,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:30,249 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2018-02-04 03:21:30,249 INFO L371 AbstractCegarLoop]: === Iteration 128 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1401576778, now seen corresponding path program 9 times [2018-02-04 03:21:30,249 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:30,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-02-04 03:21:30,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:30,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:21:30,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-02-04 03:21:30,732 INFO L182 omatonBuilderFactory]: Interpolants [132450#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 132451#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 132448#(or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 132449#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= 0 |alloc_17_#in~array.offset|))), 132452#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 132453#(= 0 |free_17_#t~mem10.offset|), 132435#true, 132438#(= 0 |ldv_malloc_#res.offset|), 132439#(= 0 |entry_point_#t~ret12.offset|), 132436#false, 132437#(= 0 |ldv_malloc_#t~malloc2.offset|), 132442#(and (= 0 |alloc_17_#t~ret4.offset|) (or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 132443#(and (or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (= 0 alloc_17_~p~0.offset)), 132440#(= 0 entry_point_~array~0.offset), 132441#(and (or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 132446#(or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (and (= (mod (+ (- alloc_17_~array.offset) 0) 4) 0) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 2) alloc_17_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 132447#(or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| 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|))), 132444#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))), 132445#(or (and (= alloc_17_~array.offset |alloc_17_#in~array.offset|) (not (= alloc_17_~array.offset 0))) (and (= (mod (+ (- alloc_17_~array.offset) 0) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 1) alloc_17_~i~0) (= alloc_17_~array.base |alloc_17_#in~array.base|)))] [2018-02-04 03:21:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-02-04 03:21:30,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:21:30,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:21:30,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:21:30,733 INFO L87 Difference]: Start difference. First operand 955 states and 1187 transitions. Second operand 19 states. [2018-02-04 03:21:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:31,034 INFO L93 Difference]: Finished difference Result 963 states and 1182 transitions. [2018-02-04 03:21:31,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:21:31,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 106 [2018-02-04 03:21:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:31,036 INFO L225 Difference]: With dead ends: 963 [2018-02-04 03:21:31,036 INFO L226 Difference]: Without dead ends: 963 [2018-02-04 03:21:31,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:21:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-02-04 03:21:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 841. [2018-02-04 03:21:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-02-04 03:21:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1021 transitions. [2018-02-04 03:21:31,043 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1021 transitions. Word has length 106 [2018-02-04 03:21:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:31,043 INFO L432 AbstractCegarLoop]: Abstraction has 841 states and 1021 transitions. [2018-02-04 03:21:31,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:21:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1021 transitions. [2018-02-04 03:21:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 03:21:31,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:31,045 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:31,045 INFO L371 AbstractCegarLoop]: === Iteration 129 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash -766410496, now seen corresponding path program 4 times [2018-02-04 03:21:31,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:31,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 35 proven. 77 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 03:21:31,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:31,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:21:31,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 03:21:31,170 INFO L182 omatonBuilderFactory]: Interpolants [134274#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 134275#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 134272#(= 0 |entry_point_#t~ret12.offset|), 134273#(= entry_point_~array~0.offset 0), 134278#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 134279#(and (= entry_point_~array~0.offset 0) (<= 20 (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset))), 134276#(and (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 134277#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0)), 134282#(and (<= alloc_17_~i~0 2) (= alloc_17_~len |alloc_17_#in~len|)), 134283#(and (<= alloc_17_~i~0 3) (= alloc_17_~len |alloc_17_#in~len|)), 134280#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 134281#(and (<= alloc_17_~i~0 1) (= alloc_17_~len |alloc_17_#in~len|)), 134284#(and (= alloc_17_~len |alloc_17_#in~len|) (<= alloc_17_~i~0 4)), 134285#(<= |alloc_17_#in~len| 4), 134270#(= 0 |ldv_malloc_#t~malloc2.offset|), 134271#(= 0 |ldv_malloc_#res.offset|), 134268#true, 134269#false] [2018-02-04 03:21:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 35 proven. 77 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-04 03:21:31,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:21:31,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:21:31,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:21:31,171 INFO L87 Difference]: Start difference. First operand 841 states and 1021 transitions. Second operand 18 states. [2018-02-04 03:21:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:31,334 INFO L93 Difference]: Finished difference Result 889 states and 1074 transitions. [2018-02-04 03:21:31,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:21:31,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 110 [2018-02-04 03:21:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:31,335 INFO L225 Difference]: With dead ends: 889 [2018-02-04 03:21:31,335 INFO L226 Difference]: Without dead ends: 889 [2018-02-04 03:21:31,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:21:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2018-02-04 03:21:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 841. [2018-02-04 03:21:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-02-04 03:21:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1020 transitions. [2018-02-04 03:21:31,341 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1020 transitions. Word has length 110 [2018-02-04 03:21:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:31,341 INFO L432 AbstractCegarLoop]: Abstraction has 841 states and 1020 transitions. [2018-02-04 03:21:31,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:21:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1020 transitions. [2018-02-04 03:21:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 03:21:31,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:31,342 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2018-02-04 03:21:31,342 INFO L371 AbstractCegarLoop]: === Iteration 130 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1401576777, now seen corresponding path program 5 times [2018-02-04 03:21:31,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:31,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 27 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 03:21:32,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:32,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 03:21:32,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 03:21:32,160 INFO L182 omatonBuilderFactory]: Interpolants [136026#(= 0 |ldv_malloc_#t~malloc2.offset|), 136027#(= 0 |ldv_malloc_#res.offset|), 136024#true, 136025#false, 136030#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 136031#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 136028#(= 0 |entry_point_#t~ret12.offset|), 136029#(= 0 entry_point_~array~0.offset), 136034#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 4)), 136035#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 4)), 136032#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 136033#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 136038#(= (select |#valid| |ldv_malloc_#res.base|) 1), 136039#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~len |alloc_17_#in~len|) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 136036#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~len |alloc_17_#in~len|) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 136037#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 136042#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (= (mod (+ (- alloc_17_~array.offset) 0) 4) 0) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 1) alloc_17_~i~0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)) 1)) (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))))), 136043#(= |#valid| |old(#valid)|), 136040#(and (or (and (= 1 (select |#valid| alloc_17_~p~0.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~len |alloc_17_#in~len|)), 136041#(and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 1 (select |#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|))) (or (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))), 136046#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (or (not (= alloc_17_~array.offset 0)) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))) (and (= (mod (+ (- alloc_17_~array.offset) 0) 4) 0) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 2) alloc_17_~i~0) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 136047#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 136044#(and (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 136045#(and (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|))))), 136050#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (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)))) (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= 17 (+ (* 4 alloc_17_~len) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))))), 136051#(and (or (and (= 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))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= 17 (+ (* 4 alloc_17_~len) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))) (= alloc_17_~len |alloc_17_#in~len|)), 136048#(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|))))), 136049#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (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)))) (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (<= 13 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))))), 136054#(and (= 0 entry_point_~array~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 136055#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|)), 136052#(and (= alloc_17_~len |alloc_17_#in~len|) (or (<= 5 alloc_17_~len) (not (= 0 |alloc_17_#in~array.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 136053#(or (not (= 0 |alloc_17_#in~array.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (<= 5 |alloc_17_#in~len|)), 136056#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))), 136057#(= 1 (select |#valid| |free_17_#t~mem10.base|))] [2018-02-04 03:21:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 27 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 03:21:32,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 03:21:32,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 03:21:32,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:21:32,161 INFO L87 Difference]: Start difference. First operand 841 states and 1020 transitions. Second operand 34 states. [2018-02-04 03:21:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:33,725 INFO L93 Difference]: Finished difference Result 850 states and 1027 transitions. [2018-02-04 03:21:33,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:21:33,725 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2018-02-04 03:21:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:33,726 INFO L225 Difference]: With dead ends: 850 [2018-02-04 03:21:33,726 INFO L226 Difference]: Without dead ends: 850 [2018-02-04 03:21:33,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=298, Invalid=3124, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 03:21:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-02-04 03:21:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 841. [2018-02-04 03:21:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-02-04 03:21:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1019 transitions. [2018-02-04 03:21:33,732 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1019 transitions. Word has length 106 [2018-02-04 03:21:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:33,732 INFO L432 AbstractCegarLoop]: Abstraction has 841 states and 1019 transitions. [2018-02-04 03:21:33,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 03:21:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1019 transitions. [2018-02-04 03:21:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 03:21:33,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:33,733 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:33,733 INFO L371 AbstractCegarLoop]: === Iteration 131 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1584775309, now seen corresponding path program 8 times [2018-02-04 03:21:33,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:33,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 178 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:34,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:34,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:21:34,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:34,048 INFO L182 omatonBuilderFactory]: Interpolants [137799#true, 137802#(= 0 |ldv_malloc_#res.offset|), 137803#(= 0 |entry_point_#t~ret12.offset|), 137800#false, 137801#(= 0 |ldv_malloc_#t~malloc2.offset|), 137806#(and (<= 1 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 137807#(and (<= entry_point_~i~2 2) (<= 2 entry_point_~i~2) (= entry_point_~array~0.offset 0)), 137804#(= 0 entry_point_~array~0.offset), 137805#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 137810#(and (<= 5 entry_point_~i~2) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 5)), 137811#(and (<= 5 entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= entry_point_~i~2 5)), 137808#(and (<= 3 entry_point_~i~2) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 137809#(and (= entry_point_~array~0.offset 0) (<= 4 entry_point_~i~2) (<= entry_point_~i~2 4)), 137814#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 137815#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 20))), 137812#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 20)))), 137813#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 20))) (= entry_point_~array~0.offset 0)), 137818#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 12)))), 137819#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 137816#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 20)) (= free_17_~array.offset 0)), 137817#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 137822#(= 0 |free_17_#t~mem10.offset|), 137820#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))), 137821#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))] [2018-02-04 03:21:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 178 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:34,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:21:34,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:21:34,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:21:34,049 INFO L87 Difference]: Start difference. First operand 841 states and 1019 transitions. Second operand 24 states. [2018-02-04 03:21:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:34,773 INFO L93 Difference]: Finished difference Result 867 states and 1042 transitions. [2018-02-04 03:21:34,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:21:34,774 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 106 [2018-02-04 03:21:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:34,775 INFO L225 Difference]: With dead ends: 867 [2018-02-04 03:21:34,775 INFO L226 Difference]: Without dead ends: 867 [2018-02-04 03:21:34,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 03:21:34,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-02-04 03:21:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 842. [2018-02-04 03:21:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-02-04 03:21:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1021 transitions. [2018-02-04 03:21:34,780 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1021 transitions. Word has length 106 [2018-02-04 03:21:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:34,780 INFO L432 AbstractCegarLoop]: Abstraction has 842 states and 1021 transitions. [2018-02-04 03:21:34,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:21:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1021 transitions. [2018-02-04 03:21:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 03:21:34,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:34,781 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:34,781 INFO L371 AbstractCegarLoop]: === Iteration 132 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:34,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1584775308, now seen corresponding path program 8 times [2018-02-04 03:21:34,782 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:34,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 178 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:35,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:35,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:21:35,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:35,200 INFO L182 omatonBuilderFactory]: Interpolants [139586#(and (<= 20 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 5)), 139587#(and (<= 20 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 5)), 139584#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 139585#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 139590#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 139591#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 20))), 139588#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (- entry_point_~array~0.offset) 20) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 139589#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 20) entry_point_~array~0.offset)))), 139594#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 12))) (= free_17_~array.offset 0)), 139595#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 139592#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 20)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 139593#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 16))) (= free_17_~array.offset 0)), 139598#(= 0 |free_17_#t~mem10.base|), 139596#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 139597#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 139575#true, 139578#(= 0 |ldv_malloc_#res.offset|), 139579#(= 0 |entry_point_#t~ret12.offset|), 139576#false, 139577#(= 0 |ldv_malloc_#t~malloc2.offset|), 139582#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 139583#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 139580#(= entry_point_~array~0.offset 0), 139581#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))] [2018-02-04 03:21:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 178 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:35,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:21:35,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:21:35,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:21:35,200 INFO L87 Difference]: Start difference. First operand 842 states and 1021 transitions. Second operand 24 states. [2018-02-04 03:21:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:35,954 INFO L93 Difference]: Finished difference Result 866 states and 1041 transitions. [2018-02-04 03:21:35,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:21:35,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 106 [2018-02-04 03:21:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:35,955 INFO L225 Difference]: With dead ends: 866 [2018-02-04 03:21:35,955 INFO L226 Difference]: Without dead ends: 866 [2018-02-04 03:21:35,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=1270, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 03:21:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-02-04 03:21:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 842. [2018-02-04 03:21:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-02-04 03:21:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1020 transitions. [2018-02-04 03:21:35,959 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1020 transitions. Word has length 106 [2018-02-04 03:21:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:35,959 INFO L432 AbstractCegarLoop]: Abstraction has 842 states and 1020 transitions. [2018-02-04 03:21:35,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:21:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1020 transitions. [2018-02-04 03:21:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 03:21:35,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:35,960 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:35,960 INFO L371 AbstractCegarLoop]: === Iteration 133 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 867470696, now seen corresponding path program 5 times [2018-02-04 03:21:35,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:35,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:21:36,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:36,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:21:36,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 03:21:36,285 INFO L182 omatonBuilderFactory]: Interpolants [141346#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (- (+ (* (- 4) alloc_17_~j~0) (- 4)))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 141347#(and (or (and (<= 0 (* 4 alloc_17_~j~0)) (or (<= 1 (* 4 alloc_17_~j~0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (- (- 4))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 141344#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 141345#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 141350#(or (not (= 0 |alloc_17_#in~array.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))), 141351#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 141348#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4)))) (<= 1 (* 4 alloc_17_~j~0))) (<= 0 (* 4 alloc_17_~j~0)))), 141349#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (<= 0 (+ (* 4 alloc_17_~j~0) 3)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (<= 0 (+ (* 4 alloc_17_~j~0) 4)))), 141354#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 141355#(= 0 |free_17_#t~mem10.base|), 141352#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 141353#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 141338#(= 0 |ldv_malloc_#t~malloc2.offset|), 141339#(= 0 |ldv_malloc_#res.offset|), 141336#true, 141337#false, 141342#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 141343#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 141340#(= 0 |entry_point_#t~ret12.offset|), 141341#(= 0 entry_point_~array~0.offset)] [2018-02-04 03:21:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-04 03:21:36,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:21:36,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:21:36,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:21:36,285 INFO L87 Difference]: Start difference. First operand 842 states and 1020 transitions. Second operand 20 states. [2018-02-04 03:21:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:36,767 INFO L93 Difference]: Finished difference Result 850 states and 1017 transitions. [2018-02-04 03:21:36,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:21:36,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2018-02-04 03:21:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:36,768 INFO L225 Difference]: With dead ends: 850 [2018-02-04 03:21:36,768 INFO L226 Difference]: Without dead ends: 850 [2018-02-04 03:21:36,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:21:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-02-04 03:21:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 842. [2018-02-04 03:21:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-02-04 03:21:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1013 transitions. [2018-02-04 03:21:36,773 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1013 transitions. Word has length 106 [2018-02-04 03:21:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:36,774 INFO L432 AbstractCegarLoop]: Abstraction has 842 states and 1013 transitions. [2018-02-04 03:21:36,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:21:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1013 transitions. [2018-02-04 03:21:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 03:21:36,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:36,774 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:36,774 INFO L371 AbstractCegarLoop]: === Iteration 134 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2015068518, now seen corresponding path program 11 times [2018-02-04 03:21:36,775 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:36,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 66 proven. 116 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:36,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:36,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 03:21:36,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:36,943 INFO L182 omatonBuilderFactory]: Interpolants [143074#(= 0 |ldv_malloc_#t~malloc2.offset|), 143075#(= 0 |ldv_malloc_#res.offset|), 143072#true, 143073#false, 143078#(and (= 0 entry_point_~array~0.offset) (= entry_point_~i~2 0)), 143079#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 1)), 143076#(= 0 |entry_point_#t~ret12.offset|), 143077#(= 0 entry_point_~array~0.offset), 143082#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 4)), 143083#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 5)), 143080#(and (<= entry_point_~i~2 2) (= 0 entry_point_~array~0.offset)), 143081#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~i~2 3)), 143086#(and (= 0 |free_17_#in~array.offset|) (<= |free_17_#in~len| 6)), 143087#(and (<= free_17_~len 6) (= free_17_~array.offset 0)), 143084#(and (<= entry_point_~i~2 6) (= 0 entry_point_~array~0.offset)), 143085#(and (= 0 entry_point_~array~0.offset) (<= entry_point_~len~0 6)), 143090#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 16)) (= free_17_~array.offset 0)), 143091#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 143088#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 24)) (= free_17_~array.offset 0)), 143089#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 20)) (= free_17_~array.offset 0)), 143094#(<= free_17_~len (+ free_17_~i~1 1)), 143095#(<= free_17_~len free_17_~i~1), 143092#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 8)) (= free_17_~array.offset 0)), 143093#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 4)) (= free_17_~array.offset 0))] [2018-02-04 03:21:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 66 proven. 116 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:36,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:21:36,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:21:36,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:21:36,943 INFO L87 Difference]: Start difference. First operand 842 states and 1013 transitions. Second operand 24 states. [2018-02-04 03:21:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:37,197 INFO L93 Difference]: Finished difference Result 1051 states and 1255 transitions. [2018-02-04 03:21:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 03:21:37,198 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-04 03:21:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:37,199 INFO L225 Difference]: With dead ends: 1051 [2018-02-04 03:21:37,199 INFO L226 Difference]: Without dead ends: 1051 [2018-02-04 03:21:37,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:21:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-02-04 03:21:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1013. [2018-02-04 03:21:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-02-04 03:21:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1237 transitions. [2018-02-04 03:21:37,205 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1237 transitions. Word has length 107 [2018-02-04 03:21:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:37,205 INFO L432 AbstractCegarLoop]: Abstraction has 1013 states and 1237 transitions. [2018-02-04 03:21:37,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:21:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1237 transitions. [2018-02-04 03:21:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 03:21:37,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:37,205 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-02-04 03:21:37,206 INFO L371 AbstractCegarLoop]: === Iteration 135 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2055471401, now seen corresponding path program 4 times [2018-02-04 03:21:37,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:37,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 33 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:21:37,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:37,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 03:21:37,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:21:37,930 INFO L182 omatonBuilderFactory]: Interpolants [145218#(= 1 (select |#valid| entry_point_~array~0.base)), 145216#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (and (or (<= 13 (* 4 free_17_~len)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))))) |free_17_#in~array.base|)) (= free_17_~len |free_17_#in~len|) (<= 12 (* 4 free_17_~len)))), 145217#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (and (<= 12 (* 4 |free_17_#in~len|)) (or (<= 13 (* 4 |free_17_#in~len|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4))) |free_17_#in~array.base|))) (not (= |free_17_#in~array.offset| 0))), 145186#false, 145187#(= 0 |ldv_malloc_#t~malloc2.offset|), 145185#true, 145190#(= entry_point_~array~0.offset 0), 145191#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 145188#(= 0 |ldv_malloc_#res.offset|), 145189#(= 0 |entry_point_#t~ret12.offset|), 145194#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 11) (= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 12))), 145195#(and (or (= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 12) (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 11)) (= entry_point_~array~0.offset 0)), 145192#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 4) (= entry_point_~array~0.offset 0)), 145193#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 8) (= entry_point_~array~0.offset 0)), 145198#(and (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 145199#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (or (and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 145196#(and (or (= alloc_17_~len |alloc_17_#in~len|) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 145197#(and (or (and (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 145202#(= |#valid| |old(#valid)|), 145203#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 145200#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= (select |#valid| |alloc_17_#in~array.base|) 1) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 145201#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 145206#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 145207#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (<= 12 (* 4 alloc_17_~len)) (= alloc_17_~len |alloc_17_#in~len|) (or (<= 13 (* 4 alloc_17_~len)) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8)))))))))), 145204#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 145205#(and (or (not (= alloc_17_~array.offset 0)) (and (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret4.base|)) (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~len |alloc_17_#in~len|) (<= (+ alloc_17_~i~0 1) alloc_17_~len) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 145210#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))), 145211#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))), 145208#(or (and (<= 12 (* 4 |alloc_17_#in~len|)) (or (<= 13 (* 4 |alloc_17_#in~len|)) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 8))))))) (not (= 0 |alloc_17_#in~array.offset|))), 145209#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 12) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) 11) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~len~0) (- 4)))))))), 145214#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= (+ free_17_~i~1 1) free_17_~len) (= free_17_~len |free_17_#in~len|))) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))), 145215#(and (or (= |free_17_#t~mem10.base| |free_17_#in~array.base|) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|))) (or (not (= |free_17_#in~array.offset| 0)) (and (or (<= 13 (* 4 free_17_~len)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~i~1) (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))))) |free_17_#t~mem10.base|)) (= free_17_~len |free_17_#in~len|) (<= 12 (* 4 free_17_~len))))), 145212#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|))), 145213#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (not (= free_17_~array.offset 0)) (= free_17_~len |free_17_#in~len|)))] [2018-02-04 03:21:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 33 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 03:21:37,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 03:21:37,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 03:21:37,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:21:37,931 INFO L87 Difference]: Start difference. First operand 1013 states and 1237 transitions. Second operand 34 states. [2018-02-04 03:21:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:39,422 INFO L93 Difference]: Finished difference Result 1026 states and 1244 transitions. [2018-02-04 03:21:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:21:39,422 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2018-02-04 03:21:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:39,423 INFO L225 Difference]: With dead ends: 1026 [2018-02-04 03:21:39,423 INFO L226 Difference]: Without dead ends: 1026 [2018-02-04 03:21:39,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=361, Invalid=3799, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 03:21:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-02-04 03:21:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1014. [2018-02-04 03:21:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1238 transitions. [2018-02-04 03:21:39,430 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1238 transitions. Word has length 108 [2018-02-04 03:21:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:39,430 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1238 transitions. [2018-02-04 03:21:39,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 03:21:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1238 transitions. [2018-02-04 03:21:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:21:39,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:39,431 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:39,431 INFO L371 AbstractCegarLoop]: === Iteration 136 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash 559456805, now seen corresponding path program 4 times [2018-02-04 03:21:39,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:39,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:40,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:40,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:21:40,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:40,081 INFO L182 omatonBuilderFactory]: Interpolants [147330#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 147331#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 147328#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 147329#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 147334#(and (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (- entry_point_~array~0.offset) 12) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 147335#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (- entry_point_~array~0.offset) 12) entry_point_~array~0.offset))))), 147332#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 147333#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))), 147338#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 147339#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 147336#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 147337#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 147342#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 147343#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|))), 147340#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 147341#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 147346#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 147347#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 147344#(and (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12))) (= 0 |free_17_#in~array.offset|)), 147345#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 12))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 147350#(= 1 (select |#valid| free_17_~array.base)), 147348#(not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))), 147349#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 147323#true, 147326#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 147327#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 147324#false, 147325#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|))] [2018-02-04 03:21:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:40,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:21:40,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:21:40,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:21:40,082 INFO L87 Difference]: Start difference. First operand 1014 states and 1238 transitions. Second operand 28 states. [2018-02-04 03:21:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:41,344 INFO L93 Difference]: Finished difference Result 1025 states and 1243 transitions. [2018-02-04 03:21:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 03:21:41,344 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-02-04 03:21:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:41,345 INFO L225 Difference]: With dead ends: 1025 [2018-02-04 03:21:41,345 INFO L226 Difference]: Without dead ends: 1025 [2018-02-04 03:21:41,346 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=330, Invalid=2532, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 03:21:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-02-04 03:21:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1014. [2018-02-04 03:21:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1235 transitions. [2018-02-04 03:21:41,353 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1235 transitions. Word has length 111 [2018-02-04 03:21:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:41,353 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1235 transitions. [2018-02-04 03:21:41,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:21:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1235 transitions. [2018-02-04 03:21:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 03:21:41,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:41,353 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:41,353 INFO L371 AbstractCegarLoop]: === Iteration 137 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash -549448993, now seen corresponding path program 7 times [2018-02-04 03:21:41,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:41,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:21:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 75 proven. 101 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:41,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:41,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 03:21:41,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:41,777 INFO L182 omatonBuilderFactory]: Interpolants [149442#true, 149443#false, 149446#(= 0 |entry_point_#t~ret12.offset|), 149447#(= entry_point_~array~0.offset 0), 149444#(= 0 |ldv_malloc_#t~malloc2.offset|), 149445#(= 0 |ldv_malloc_#res.offset|), 149450#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0)), 149451#(and (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 149448#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 149449#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 149454#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 5)), 149455#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) (- 4)))) entry_point_~array~0.offset))) (<= (* 4 entry_point_~i~2) 23)) (<= (* 4 entry_point_~i~2) 24) (= entry_point_~array~0.offset 0)), 149452#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 4)), 149453#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 5)), 149458#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 149459#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 149456#(and (<= (* 4 entry_point_~len~0) 24) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset))) (<= (* 4 entry_point_~len~0) 23)) (= entry_point_~array~0.offset 0)), 149457#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 149462#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~len |free_17_#in~len|)), 149463#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (<= 16 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~len |free_17_#in~len|)), 149460#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (not (= free_17_~array.offset 0))) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 149461#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~len |free_17_#in~len|)), 149466#(and (= 1 (select |#valid| |free_17_#in~array.base|)) (= free_17_~len |free_17_#in~len|) (or (and (<= 24 (* 4 free_17_~len)) (or (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (+ (* (- 4) free_17_~len) 4))) (* 4 free_17_~i~1)))) (<= 25 (* 4 free_17_~len)))) (not (= |free_17_#in~array.offset| 0)))), 149467#(or (and (= free_17_~len |free_17_#in~len|) (or (and (<= 24 (* 4 free_17_~len)) (or (<= 25 (* 4 free_17_~len)) (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (+ (* (- 4) free_17_~len) 4))) (* 4 free_17_~i~1))))))) (not (= |free_17_#in~array.offset| 0)))) (= 1 (select |#valid| |free_17_#in~array.base|))), 149464#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (<= 20 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~len |free_17_#in~len|)), 149465#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (or (and (<= (+ free_17_~i~1 1) free_17_~len) (<= 20 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= free_17_~array.offset 0))) (= free_17_~len |free_17_#in~len|)), 149468#(or (and (<= 24 (* 4 |free_17_#in~len|)) (or (not (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4))))) (<= 25 (* 4 |free_17_#in~len|)))) (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0))), 149469#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-04 03:21:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 75 proven. 101 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:41,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 03:21:41,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 03:21:41,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:21:41,777 INFO L87 Difference]: Start difference. First operand 1014 states and 1235 transitions. Second operand 28 states. [2018-02-04 03:21:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:42,884 INFO L93 Difference]: Finished difference Result 1053 states and 1262 transitions. [2018-02-04 03:21:42,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 03:21:42,884 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2018-02-04 03:21:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:42,885 INFO L225 Difference]: With dead ends: 1053 [2018-02-04 03:21:42,885 INFO L226 Difference]: Without dead ends: 1053 [2018-02-04 03:21:42,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=608, Invalid=3814, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 03:21:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2018-02-04 03:21:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1014. [2018-02-04 03:21:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1235 transitions. [2018-02-04 03:21:42,891 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1235 transitions. Word has length 109 [2018-02-04 03:21:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:42,891 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1235 transitions. [2018-02-04 03:21:42,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 03:21:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1235 transitions. [2018-02-04 03:21:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 03:21:42,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:42,891 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:42,891 INFO L371 AbstractCegarLoop]: === Iteration 138 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash -279312467, now seen corresponding path program 3 times [2018-02-04 03:21:42,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:42,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:21:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 03:21:43,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:43,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:21:43,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 03:21:43,393 INFO L182 omatonBuilderFactory]: Interpolants [151618#(= 0 |ldv_malloc_#t~malloc2.offset|), 151619#(= 0 |ldv_malloc_#res.offset|), 151616#true, 151617#false, 151622#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 151623#(= 0 |alloc_17_#in~array.offset|), 151620#(= 0 |entry_point_#t~ret12.offset|), 151621#(= 0 entry_point_~array~0.offset), 151626#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 151627#(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))))), 151624#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 151625#(and (= 0 |alloc_17_#t~ret4.offset|) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 151630#(and (<= alloc_17_~i~0 3) (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 8) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)))), 151631#(and (or (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 4)) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 2)), 151628#(and (<= alloc_17_~i~0 1) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))) (= alloc_17_~array.offset 0)), 151629#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (and (<= alloc_17_~i~0 2) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))))), 151634#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) 0) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) 0)) (<= alloc_17_~j~0 1)))), 151635#(and (= alloc_17_~array.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0))), 151632#(and (= alloc_17_~array.offset 0) (or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (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) alloc_17_~array.offset)))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) 0) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) 0)) (<= alloc_17_~j~0 1)))), 151633#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (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) alloc_17_~array.offset)))) (= |alloc_17_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) 0) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) 0)) (<= alloc_17_~j~0 1)))), 151636#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.offset 0)), 151637#(= 0 |alloc_17_#t~mem7.offset|)] [2018-02-04 03:21:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-02-04 03:21:43,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:21:43,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:21:43,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:21:43,394 INFO L87 Difference]: Start difference. First operand 1014 states and 1235 transitions. Second operand 22 states. [2018-02-04 03:21:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:43,934 INFO L93 Difference]: Finished difference Result 1019 states and 1240 transitions. [2018-02-04 03:21:43,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:21:43,934 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2018-02-04 03:21:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:43,935 INFO L225 Difference]: With dead ends: 1019 [2018-02-04 03:21:43,935 INFO L226 Difference]: Without dead ends: 1019 [2018-02-04 03:21:43,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=427, Invalid=1829, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:21:43,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-02-04 03:21:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1014. [2018-02-04 03:21:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1234 transitions. [2018-02-04 03:21:43,941 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1234 transitions. Word has length 109 [2018-02-04 03:21:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:43,942 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1234 transitions. [2018-02-04 03:21:43,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:21:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1234 transitions. [2018-02-04 03:21:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 03:21:43,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:43,942 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:43,942 INFO L371 AbstractCegarLoop]: === Iteration 139 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -279312466, now seen corresponding path program 5 times [2018-02-04 03:21:43,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:43,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 101 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:21:45,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:45,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 03:21:45,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:21:45,482 INFO L182 omatonBuilderFactory]: Interpolants [153730#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 153731#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (= entry_point_~i~2 0)), 153728#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 153729#(and (= 0 |entry_point_#t~ret12.offset|) (= 0 (select |#valid| 0))), 153734#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 3)) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0)), 153735#(and (or (<= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 3)) (= (+ (div (+ (- entry_point_~array~0.offset) 19) 4) entry_point_~i~2) (+ entry_point_~len~0 4))) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 153732#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 153733#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 153738#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 153739#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 153736#(and (= 0 (select |#valid| 0)) (= 0 |alloc_17_#in~array.offset|)), 153737#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 153742#(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))), 153743#(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)), 153740#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| |alloc_17_#t~ret4.base|))), 153741#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |#valid| 0))), 153746#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (or (= |#valid| |old(#valid)|) (and (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0))) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 153747#(and (= alloc_17_~array.offset 0) (or (and (= (* 4 alloc_17_~i~0) 4) (not (= |alloc_17_#t~ret4.base| 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) |alloc_17_#t~ret4.base|)) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3))), 153744#(= |#valid| |old(#valid)|), 153745#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 153750#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) 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))))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7)) (<= (* 4 alloc_17_~i~0) 8)), 153751#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 153748#(and (= alloc_17_~array.offset 0) (or (and (not (= 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) 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))) (= 0 (select |#valid| 0))) (<= (* 4 alloc_17_~i~0) 3)) (<= (* 4 alloc_17_~i~0) 4)), 153749#(and (= alloc_17_~array.offset 0) (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) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (<= (* 4 alloc_17_~i~0) 4)), 153754#(and (= alloc_17_~array.offset 0) (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) (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) (- 4))))) (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 (= (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) (- 4))) 0)) (<= (* 4 alloc_17_~i~0) 8) (= 0 (select |#valid| 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) 7))), 153755#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) 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))))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7)) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 8)), 153752#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |old(#valid)| 0) (select |#valid| 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|))))), 153753#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))) 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) |alloc_17_#t~ret4.base|)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (<= (* 4 alloc_17_~i~0) 8) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7))), 153758#(and (or (and (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))) 0)) (= 1 (select (store |#valid| |alloc_17_#t~mem7.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (= 0 (select |#valid| 0)) (not (= (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) (- 4))))) (<= alloc_17_~j~0 2)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7)) (= alloc_17_~array.offset 0)), 153759#(and (= alloc_17_~array.offset 0) (or (and (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))) 0)) (= 0 (select |#valid| 0)) (not (= (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) (- 4))))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (<= alloc_17_~j~0 2)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7))), 153756#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 8))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))))) (<= (* 4 alloc_17_~i~0) 12) (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 8))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 11))), 153757#(and (= alloc_17_~array.offset 0) (or (and (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))) 0)) (not (= (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)))) (= 0 (select |#valid| 0)) (not (= (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) (- 4))))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0))) (<= alloc_17_~j~0 2)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 7))), 153762#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~j~0 1) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0))), 153763#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0)) (= alloc_17_~array.offset 0)), 153760#(and (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (not (= (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)))) (<= alloc_17_~j~0 1) (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) 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) 0))))) (= alloc_17_~array.offset 0)), 153761#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (or (and (<= alloc_17_~j~0 1) (= 1 (select (store |#valid| |alloc_17_#t~mem7.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0) 0)))) (not (= 1 (select |#valid| |alloc_17_#t~mem7.base|)))) (not (= |alloc_17_#t~mem7.base| 0))))), 153764#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))))), 153765#(= (select |#valid| |alloc_17_#t~mem7.base|) 1), 153723#true, 153726#(= (select |old(#valid)| 0) (select |#valid| 0)), 153727#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 153724#false, 153725#(= 0 (select |#valid| 0))] [2018-02-04 03:21:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 101 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 03:21:45,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 03:21:45,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 03:21:45,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1615, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:21:45,483 INFO L87 Difference]: Start difference. First operand 1014 states and 1234 transitions. Second operand 43 states. [2018-02-04 03:21:46,820 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 88 DAG size of output 72 [2018-02-04 03:21:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:48,447 INFO L93 Difference]: Finished difference Result 1016 states and 1233 transitions. [2018-02-04 03:21:48,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 03:21:48,447 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 109 [2018-02-04 03:21:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:48,448 INFO L225 Difference]: With dead ends: 1016 [2018-02-04 03:21:48,448 INFO L226 Difference]: Without dead ends: 1016 [2018-02-04 03:21:48,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2947 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1123, Invalid=7619, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 03:21:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-02-04 03:21:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1014. [2018-02-04 03:21:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1233 transitions. [2018-02-04 03:21:48,453 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1233 transitions. Word has length 109 [2018-02-04 03:21:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:48,454 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1233 transitions. [2018-02-04 03:21:48,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 03:21:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1233 transitions. [2018-02-04 03:21:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 03:21:48,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:48,454 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:48,454 INFO L371 AbstractCegarLoop]: === Iteration 140 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash -597694914, now seen corresponding path program 3 times [2018-02-04 03:21:48,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:48,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 134 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:49,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:49,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:21:49,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:49,073 INFO L182 omatonBuilderFactory]: Interpolants [155906#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 155907#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 155904#(= entry_point_~array~0.offset 0), 155905#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 155910#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 155911#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 16)))), 155908#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 155909#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 155914#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 155915#(and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 155912#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16)))), 155913#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 155918#(and (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (not (= 0 |alloc_17_#in~array.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (or (not (= 0 |alloc_17_#in~array.offset|)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0)))), 155919#(and (or (not (= 0 |alloc_17_#in~array.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (or (not (= 0 |alloc_17_#in~array.offset|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))), 155916#(and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 155917#(and (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 155922#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 16)) (= free_17_~array.offset 0)), 155923#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 155920#(and (or (not (= 0 |alloc_17_#in~array.offset|)) (<= (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (not (= 0 |alloc_17_#in~array.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 155921#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 155926#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 155927#(= 0 |free_17_#t~mem10.offset|), 155924#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 155925#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 155899#true, 155902#(= 0 |ldv_malloc_#res.offset|), 155903#(= 0 |entry_point_#t~ret12.offset|), 155900#false, 155901#(= 0 |ldv_malloc_#t~malloc2.offset|)] [2018-02-04 03:21:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 134 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:49,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:21:49,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:21:49,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:21:49,074 INFO L87 Difference]: Start difference. First operand 1014 states and 1233 transitions. Second operand 29 states. [2018-02-04 03:21:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:50,227 INFO L93 Difference]: Finished difference Result 1031 states and 1243 transitions. [2018-02-04 03:21:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 03:21:50,228 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 116 [2018-02-04 03:21:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:50,228 INFO L225 Difference]: With dead ends: 1031 [2018-02-04 03:21:50,228 INFO L226 Difference]: Without dead ends: 1031 [2018-02-04 03:21:50,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=2347, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 03:21:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-02-04 03:21:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1014. [2018-02-04 03:21:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1230 transitions. [2018-02-04 03:21:50,234 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1230 transitions. Word has length 116 [2018-02-04 03:21:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:50,234 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1230 transitions. [2018-02-04 03:21:50,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:21:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1230 transitions. [2018-02-04 03:21:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 03:21:50,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:50,234 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:50,235 INFO L371 AbstractCegarLoop]: === Iteration 141 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash -597694913, now seen corresponding path program 6 times [2018-02-04 03:21:50,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:50,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:21:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 134 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:50,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:50,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:21:50,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:50,826 INFO L182 omatonBuilderFactory]: Interpolants [158019#true, 158022#(= 0 |ldv_malloc_#res.offset|), 158023#(= 0 |entry_point_#t~ret12.offset|), 158020#false, 158021#(= 0 |ldv_malloc_#t~malloc2.offset|), 158026#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 158027#(and (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 158024#(= entry_point_~array~0.offset 0), 158025#(and (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 158030#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 158031#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 16)))), 158028#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 158029#(and (= entry_point_~array~0.offset 0) (<= 16 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 4)), 158034#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 158035#(and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 158032#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (= entry_point_~array~0.offset 0)), 158033#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 158038#(and (or (not (= 0 |alloc_17_#in~array.offset|)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0)) (not (= 0 |alloc_17_#in~array.offset|)))), 158039#(and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (not (= 0 |alloc_17_#in~array.offset|))) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (not (= 0 |alloc_17_#in~array.offset|)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))), 158036#(and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 158037#(and (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base)) (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 158042#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 158043#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 12)))) (= free_17_~array.offset 0)), 158040#(and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (not (= 0 |alloc_17_#in~array.offset|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (not (= 0 |alloc_17_#in~array.offset|)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))), 158041#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 158046#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 158047#(= 0 |free_17_#t~mem10.base|), 158044#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 158045#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0))] [2018-02-04 03:21:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 134 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:50,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:21:50,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:21:50,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:21:50,826 INFO L87 Difference]: Start difference. First operand 1014 states and 1230 transitions. Second operand 29 states. [2018-02-04 03:21:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:51,962 INFO L93 Difference]: Finished difference Result 1030 states and 1240 transitions. [2018-02-04 03:21:51,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 03:21:51,962 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 116 [2018-02-04 03:21:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:51,963 INFO L225 Difference]: With dead ends: 1030 [2018-02-04 03:21:51,963 INFO L226 Difference]: Without dead ends: 1030 [2018-02-04 03:21:51,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=1842, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 03:21:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-02-04 03:21:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1014. [2018-02-04 03:21:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1227 transitions. [2018-02-04 03:21:51,969 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1227 transitions. Word has length 116 [2018-02-04 03:21:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:51,970 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1227 transitions. [2018-02-04 03:21:51,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:21:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1227 transitions. [2018-02-04 03:21:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:21:51,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:51,970 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:51,970 INFO L371 AbstractCegarLoop]: === Iteration 142 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2143984346, now seen corresponding path program 5 times [2018-02-04 03:21:51,971 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:51,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 5 proven. 113 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:21:52,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:52,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 03:21:52,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:21:52,733 INFO L182 omatonBuilderFactory]: Interpolants [160130#(and (= 0 |entry_point_#t~ret12.offset|) (= 1 (select |#valid| |entry_point_#t~ret12.base|))), 160131#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 160128#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 160129#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 160134#(and (= 1 (select |#valid| entry_point_~array~0.base)) (<= entry_point_~i~2 2) (= entry_point_~array~0.offset 0)), 160135#(and (= 1 (select |#valid| entry_point_~array~0.base)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 160132#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 160133#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 160138#(= |#valid| |old(#valid)|), 160139#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (= |#valid| |old(#valid)|) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 160136#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 4)), 160137#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 4)), 160142#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (= alloc_17_~len |alloc_17_#in~len|) (or (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 160143#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (= alloc_17_~len |alloc_17_#in~len|) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 160140#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)), 160141#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 160146#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (or (not (= alloc_17_~array.offset 0)) (<= 9 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))) (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 160147#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (<= 12 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (<= 13 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 160144#(and (= alloc_17_~len |alloc_17_#in~len|) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 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|) (or (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))), 160145#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (= (mod (+ (- alloc_17_~array.offset) 0) 4) 0) (<= (+ (div (+ (- alloc_17_~array.offset) 0) 4) 1) alloc_17_~i~0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 160150#(and (or (not (= 0 |alloc_17_#in~array.offset|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (<= 5 |alloc_17_#in~len|)) (= 1 (select |#valid| |alloc_17_#in~array.base|))), 160151#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 160148#(and (= alloc_17_~len |alloc_17_#in~len|) (or (and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= 17 (+ (* 4 alloc_17_~len) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))) (and (<= 12 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 160149#(and (= alloc_17_~len |alloc_17_#in~len|) (= 1 (select |#valid| |alloc_17_#in~array.base|)) (or (<= 5 alloc_17_~len) (not (= 0 |alloc_17_#in~array.offset|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))))), 160154#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 160155#(= 1 (select |#valid| free_17_~array.base)), 160152#(and (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 160153#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))))) (= 1 (select |#valid| free_17_~array.base))), 160126#true, 160127#false] [2018-02-04 03:21:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 5 proven. 113 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 03:21:52,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 03:21:52,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 03:21:52,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:21:52,733 INFO L87 Difference]: Start difference. First operand 1014 states and 1227 transitions. Second operand 30 states. [2018-02-04 03:21:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:53,811 INFO L93 Difference]: Finished difference Result 1015 states and 1226 transitions. [2018-02-04 03:21:53,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 03:21:53,811 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 111 [2018-02-04 03:21:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:53,812 INFO L225 Difference]: With dead ends: 1015 [2018-02-04 03:21:53,812 INFO L226 Difference]: Without dead ends: 1015 [2018-02-04 03:21:53,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=1978, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 03:21:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-02-04 03:21:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1014. [2018-02-04 03:21:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1226 transitions. [2018-02-04 03:21:53,822 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1226 transitions. Word has length 111 [2018-02-04 03:21:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:53,822 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1226 transitions. [2018-02-04 03:21:53,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 03:21:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1226 transitions. [2018-02-04 03:21:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 03:21:53,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:53,824 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:53,824 INFO L371 AbstractCegarLoop]: === Iteration 143 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:53,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2140705081, now seen corresponding path program 3 times [2018-02-04 03:21:53,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:53,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:21:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 27 proven. 61 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:54,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:54,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 03:21:54,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 03:21:54,633 INFO L182 omatonBuilderFactory]: Interpolants [162242#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 162243#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~len |free_17_#in~len|)), 162240#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 162241#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~len |free_17_#in~len|)), 162246#(and (= 1 (select |#valid| |free_17_#in~array.base|)) (or (and (or (and (or (<= 17 (* 4 free_17_~len)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (+ (* (- 4) free_17_~len) 4))) (* 4 free_17_~i~1))) |free_17_#in~array.base|)) (<= 16 (* 4 free_17_~len))) (not (= |free_17_#in~array.offset| 0))) (= free_17_~len |free_17_#in~len|)) (= 1 (select (store |#valid| |free_17_#t~mem10.base| 0) |free_17_#in~array.base|)))), 162247#(or (and (or (and (or (<= 17 (* 4 free_17_~len)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* 4 free_17_~i~1) (+ (* (- 4) free_17_~len) 4))) (* 4 free_17_~i~1))) |free_17_#in~array.base|)) (<= 16 (* 4 free_17_~len))) (not (= |free_17_#in~array.offset| 0))) (= free_17_~len |free_17_#in~len|)) (= 1 (select |#valid| |free_17_#in~array.base|))), 162244#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)), 162245#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (<= 12 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.base |free_17_#in~array.base|) (or (not (= free_17_~array.offset 0)) (<= (+ free_17_~i~1 1) free_17_~len)) (= free_17_~len |free_17_#in~len|)), 162248#(or (= 1 (select |#valid| |free_17_#in~array.base|)) (not (= |free_17_#in~array.offset| 0)) (and (<= 16 (* 4 |free_17_#in~len|)) (or (<= 17 (* 4 |free_17_#in~len|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4))) |free_17_#in~array.base|)))), 162249#(= 1 (select |#valid| entry_point_~array~0.base)), 162219#true, 162222#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 162223#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 162220#false, 162221#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 162226#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 162227#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 162224#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 162225#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 162230#(and (<= (* 4 entry_point_~i~2) 16) (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) (+ (* 4 entry_point_~len~0) (- 4)))))))) (<= (* 4 entry_point_~i~2) 15))), 162231#(and (<= (* 4 entry_point_~len~0) 16) (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~len~0) 15) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~len~0) (- 4)))))))), 162228#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 162229#(and (<= 12 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))))), 162234#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))), 162235#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 162232#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 162233#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 162238#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= 0 |alloc_17_#in~array.offset|))), 162239#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0))) (not (= 0 |alloc_17_#in~array.offset|))), 162236#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 162237#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0)))))] [2018-02-04 03:21:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 27 proven. 61 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 03:21:54,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 03:21:54,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 03:21:54,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:21:54,633 INFO L87 Difference]: Start difference. First operand 1014 states and 1226 transitions. Second operand 31 states. [2018-02-04 03:21:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:56,230 INFO L93 Difference]: Finished difference Result 1032 states and 1234 transitions. [2018-02-04 03:21:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 03:21:56,230 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 109 [2018-02-04 03:21:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:56,231 INFO L225 Difference]: With dead ends: 1032 [2018-02-04 03:21:56,231 INFO L226 Difference]: Without dead ends: 1032 [2018-02-04 03:21:56,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=457, Invalid=3325, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 03:21:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-02-04 03:21:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1014. [2018-02-04 03:21:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-02-04 03:21:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1226 transitions. [2018-02-04 03:21:56,237 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1226 transitions. Word has length 109 [2018-02-04 03:21:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:56,238 INFO L432 AbstractCegarLoop]: Abstraction has 1014 states and 1226 transitions. [2018-02-04 03:21:56,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 03:21:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1226 transitions. [2018-02-04 03:21:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:21:56,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:56,238 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:56,238 INFO L371 AbstractCegarLoop]: === Iteration 144 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:56,238 INFO L82 PathProgramCache]: Analyzing trace with hash 230386749, now seen corresponding path program 12 times [2018-02-04 03:21:56,239 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:56,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:21:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 48 proven. 160 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:56,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:21:56,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 03:21:56,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:21:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:56,661 INFO L182 omatonBuilderFactory]: Interpolants [164358#true, 164359#false, 164362#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 164363#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 164360#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 164361#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 164366#(and (<= entry_point_~i~2 2) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 164367#(and (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~2 3) (= entry_point_~array~0.offset 0)), 164364#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 164365#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 1)), 164370#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))) (<= entry_point_~i~2 5)), 164371#(and (or (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) (- 4)))))))) (<= (* 4 entry_point_~i~2) 23)) (<= (* 4 entry_point_~i~2) 24) (= entry_point_~array~0.offset 0)), 164368#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 4)), 164369#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~2 5)), 164374#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 164375#(and (or (<= (* 4 |free_17_#in~len|) 27) (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 |free_17_#in~len|) (- 8)))))) (= 0 |free_17_#in~array.offset|) (<= (* 4 |free_17_#in~len|) 28)), 164372#(and (or (<= (* 4 entry_point_~i~2) 27) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) (+ (* 4 entry_point_~len~0) (- 8))))))))) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~2) 28)), 164373#(and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) 28) (or (<= (* 4 entry_point_~len~0) 27) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~len~0) (- 8)))))))), 164378#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 24)) (= free_17_~array.offset 0) (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 23)))), 164379#(and (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 20)) (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 19))) (= free_17_~array.offset 0)), 164376#(and (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (<= (* 4 free_17_~len) 27)) (<= (* 4 free_17_~len) 28) (= free_17_~array.offset 0)), 164377#(and (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 27))) (= free_17_~array.offset 0) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 28))), 164382#(and (or (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 7)) (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))))) (= free_17_~array.offset 0)), 164383#(or (and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))) (<= free_17_~len (+ free_17_~i~1 1))), 164380#(and (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 15))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 16)) (= free_17_~array.offset 0)), 164381#(and (or (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~len) (- 8))))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 11))) (<= (* 4 free_17_~len) (+ (* 4 free_17_~i~1) free_17_~array.offset 12)) (= free_17_~array.offset 0)), 164386#(= 1 (select |#valid| free_17_~array.base)), 164384#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len (+ free_17_~i~1 1))), 164385#(or (= 1 (select |#valid| free_17_~array.base)) (<= free_17_~len free_17_~i~1))] [2018-02-04 03:21:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 48 proven. 160 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:21:56,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 03:21:56,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 03:21:56,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:21:56,661 INFO L87 Difference]: Start difference. First operand 1014 states and 1226 transitions. Second operand 29 states. [2018-02-04 03:21:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:21:58,152 INFO L93 Difference]: Finished difference Result 1092 states and 1311 transitions. [2018-02-04 03:21:58,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 03:21:58,153 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 111 [2018-02-04 03:21:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:21:58,153 INFO L225 Difference]: With dead ends: 1092 [2018-02-04 03:21:58,153 INFO L226 Difference]: Without dead ends: 1092 [2018-02-04 03:21:58,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=635, Invalid=3921, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 03:21:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2018-02-04 03:21:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1064. [2018-02-04 03:21:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-02-04 03:21:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1285 transitions. [2018-02-04 03:21:58,160 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1285 transitions. Word has length 111 [2018-02-04 03:21:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:21:58,160 INFO L432 AbstractCegarLoop]: Abstraction has 1064 states and 1285 transitions. [2018-02-04 03:21:58,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 03:21:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1285 transitions. [2018-02-04 03:21:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:21:58,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:21:58,160 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:21:58,161 INFO L371 AbstractCegarLoop]: === Iteration 145 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:21:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1199839551, now seen corresponding path program 3 times [2018-02-04 03:21:58,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:21:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:21:58,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:02,113 WARN L146 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 95 DAG size of output 58 [2018-02-04 03:22:02,342 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 103 DAG size of output 59 [2018-02-04 03:22:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 2 proven. 84 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:22:04,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:04,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 03:22:04,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:22:04,957 INFO L182 omatonBuilderFactory]: Interpolants [166658#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (and (or (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4))))) (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))) 0) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (select (select |#memory_$Pointer$.base| free_17_~array.base) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)))))) (= free_17_~array.base |free_17_#in~array.base|)) (<= 9 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~len |free_17_#in~len|)))), 166659#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 12 (+ free_17_~array.offset (* 4 free_17_~len))) (or (<= 13 (+ free_17_~array.offset (* 4 free_17_~len))) (and (= free_17_~array.base |free_17_#in~array.base|) (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))) (and (<= 8 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ free_17_~i~1 1) free_17_~len) (or (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4))))) (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (- (+ free_17_~array.offset (- 4)))))) 0) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (select (select |#memory_$Pointer$.base| free_17_~array.base) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)))))))))) (= free_17_~len |free_17_#in~len|)))), 166656#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|) (or (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) 0) (= (store |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) |old(#valid)|)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset)))))), 166657#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) 0) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) |old(#valid)|) (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) 0)) (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)))), 166662#(or (and (<= 12 (* 4 |free_17_#in~len|)) (or (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (<= 13 (* 4 |free_17_#in~len|)) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4)))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4)))) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) 0) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* (- 4) |free_17_#in~len|) 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* (- 4) |free_17_#in~len|) 4))))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))))) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (+ (* 4 (- |free_17_#in~len|)) 4)))) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))))) (not (= |free_17_#in~array.offset| 0))), 166663#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0)), 166660#(or (and (or (<= 4 free_17_~len) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (and (or (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1)))) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (and (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))) 0) (= (select (store |#valid| |free_17_#t~mem10.base| 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) 0)) (= |free_17_#t~mem10.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1))) |free_17_#t~mem10.base|)) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= free_17_~len |free_17_#in~len|) (<= 12 (* 4 free_17_~len))) (not (= |free_17_#in~array.offset| 0))), 166661#(or (and (or (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1)))) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1)))) (<= 4 free_17_~len) (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~len) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (* 4 free_17_~len) (- 4))))) (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) |old(#valid)|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4)))) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (+ (- (+ (* (- 4) free_17_~len) (+ (* 4 free_17_~i~1) 4))) (* 4 free_17_~i~1)))) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) (- (- 4))))) (= free_17_~len |free_17_#in~len|) (<= 12 (* 4 free_17_~len))) (not (= |free_17_#in~array.offset| 0))), 166622#true, 166623#false, 166626#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= |ldv_malloc_#res.base| 0))), 166627#(and (= 0 (select |old(#valid)| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 1 (select |#valid| |entry_point_#t~ret12.base|))), 166624#(= |#valid| |old(#valid)|), 166625#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (store |#valid| |ldv_malloc_#t~malloc2.base| (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)) |old(#valid)|) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 166630#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 166631#(and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (* 4 entry_point_~i~2) 8) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (<= 8 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 166628#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 166629#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 166634#(and (or (and (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 166635#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (store |#valid| |ldv_malloc_#t~malloc2.base| (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)) |old(#valid)|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 166632#(and (<= (* 4 entry_point_~i~2) 12) (= entry_point_~array~0.offset 0) (or (<= (* 4 entry_point_~i~2) 11) (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base 0)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))))), 166633#(and (or (<= (* 4 entry_point_~len~0) 11) (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base 0)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)))) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) 12)), 166638#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= alloc_17_~p~0.base 0)) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (= (store |#valid| alloc_17_~p~0.base (select |old(#valid)| alloc_17_~p~0.base)) |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 166639#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (and (= (select |#valid| alloc_17_~array.base) 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= |old(#valid)| (store |#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 (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|)))), 166636#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= |ldv_malloc_#res.base| 0))), 166637#(and (= alloc_17_~i~0 0) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (not (= |alloc_17_#t~ret4.base| 0)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (= (select |old(#valid)| |alloc_17_#t~ret4.base|) 0) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 166642#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= alloc_17_~i~0 1) (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (not (= |alloc_17_#in~array.base| |alloc_17_#t~ret4.base|)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (not (= |alloc_17_#t~ret4.base| 0)) (= (store (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (select |old(#valid)| (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) |old(#valid)|) (= 1 (select |#valid| |alloc_17_#t~ret4.base|)) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 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))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0))) (not (= alloc_17_~array.offset 0)))), 166643#(and (or (and (<= alloc_17_~i~0 1) (not (= alloc_17_~p~0.base 0)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (not (= |alloc_17_#in~array.base| alloc_17_~p~0.base)) (= (store (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (select |old(#valid)| (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| (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)) (= 0 (select |old(#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))) (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) 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))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 166640#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (<= alloc_17_~i~0 1) (= (select |#valid| alloc_17_~array.base) 1) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (= 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))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0)))), 166641#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 166646#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (store |#valid| |ldv_malloc_#t~malloc2.base| (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 166647#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 166644#(and (or (and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) 0)) (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))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= alloc_17_~i~0 1) (= (store (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (select |old(#valid)| (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) |old(#valid)|) (not (= |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) (+ (* 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)))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 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_~array.offset |alloc_17_#in~array.offset|))), 166645#(and (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))))) (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= 1 (select |#valid| alloc_17_~array.base)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (<= alloc_17_~i~0 2) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) |old(#valid)|) (= 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_~array.offset |alloc_17_#in~array.offset|))), 166650#(or (and (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))) 0)) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) 0)) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 8) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 8)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))) 0)) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))) |alloc_17_#in~array.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (not (= (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (+ (* 4 alloc_17_~i~0) (- (+ (* 4 alloc_17_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))) (not (= 0 |alloc_17_#in~array.offset|))), 166651#(and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) 12) (or (<= (* 4 entry_point_~len~0) 11) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset)) 0)) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset (- 4))))) entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (+ (* 4 entry_point_~len~0) (- 4)) entry_point_~array~0.offset))))))), 166648#(and (or (and (= 0 (select |old(#valid)| |alloc_17_#t~ret4.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))))) (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= |alloc_17_#t~ret4.base| 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))) 0)) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) 0)) (not (= |alloc_17_#t~ret4.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))) |alloc_17_#t~ret4.base| (select |old(#valid)| |alloc_17_#t~ret4.base|)) |old(#valid)|) (<= alloc_17_~i~0 2) (not (= |alloc_17_#t~ret4.base| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))))) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= 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_~array.offset |alloc_17_#in~array.offset|))), 166649#(and (or (and (<= 8 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (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) 0)) (= 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) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))))) (not (= alloc_17_~p~0.base |alloc_17_#in~array.base|)) (= 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 (= 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))) (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 (- (+ alloc_17_~array.offset (- 4))))) 0)) (not (= alloc_17_~p~0.base 0)) (<= alloc_17_~i~0 2) (= 0 (select |old(#valid)| alloc_17_~p~0.base)) (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) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 4))))))) (= (store (store (store |#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 |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 (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 4) (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) 4))) alloc_17_~p~0.base (select |old(#valid)| alloc_17_~p~0.base)) |old(#valid)|) (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) (+ alloc_17_~array.offset (- (+ alloc_17_~array.offset (- 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) (+ alloc_17_~array.offset (- (+ 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) 0))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 166654#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) 0) (= (store |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))) |old(#valid)|))) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~len |free_17_#in~len|)))), 166655#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) 0) (= (store |#valid| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| free_17_~array.base) 0))) |old(#valid)|)) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 0)) (<= 5 (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)))), 166652#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (not (= free_17_~array.offset 0)) (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (= free_17_~len |free_17_#in~len|)))), 166653#(and (or (= |free_17_#in~array.offset| free_17_~array.offset) (= free_17_~array.offset 0)) (or (and (= |#valid| |old(#valid)|) (= free_17_~array.base |free_17_#in~array.base|) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~len |free_17_#in~len|) (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) |free_17_#t~mem10.base|)) (not (= free_17_~array.offset 0))))] [2018-02-04 03:22:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 2 proven. 84 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 03:22:04,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 03:22:04,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 03:22:04,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1621, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:22:04,958 INFO L87 Difference]: Start difference. First operand 1064 states and 1285 transitions. Second operand 42 states. [2018-02-04 03:22:06,875 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 95 DAG size of output 87 [2018-02-04 03:22:07,272 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 112 DAG size of output 93 [2018-02-04 03:22:07,459 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 126 DAG size of output 86 [2018-02-04 03:22:07,672 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 144 DAG size of output 89 [2018-02-04 03:22:07,878 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 108 DAG size of output 90 [2018-02-04 03:22:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:09,766 INFO L93 Difference]: Finished difference Result 1076 states and 1288 transitions. [2018-02-04 03:22:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 03:22:09,766 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-02-04 03:22:09,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:09,768 INFO L225 Difference]: With dead ends: 1076 [2018-02-04 03:22:09,768 INFO L226 Difference]: Without dead ends: 1038 [2018-02-04 03:22:09,768 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=254, Invalid=3652, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 03:22:09,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-02-04 03:22:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1030. [2018-02-04 03:22:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2018-02-04 03:22:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1250 transitions. [2018-02-04 03:22:09,774 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1250 transitions. Word has length 111 [2018-02-04 03:22:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:09,775 INFO L432 AbstractCegarLoop]: Abstraction has 1030 states and 1250 transitions. [2018-02-04 03:22:09,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 03:22:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1250 transitions. [2018-02-04 03:22:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:22:09,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:09,775 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:09,776 INFO L371 AbstractCegarLoop]: === Iteration 146 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1264039625, now seen corresponding path program 5 times [2018-02-04 03:22:09,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:09,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:22:10,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:10,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:22:10,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:10,240 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:22:10,240 INFO L182 omatonBuilderFactory]: Interpolants [168834#(and (not (= free_17_~array.base |free_17_#t~mem10.base|)) (= 1 (select |#valid| free_17_~array.base))), 168835#(= 1 (select |#valid| free_17_~array.base)), 168832#(and (not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) 4))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 168833#(not (= free_17_~array.base (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)))), 168814#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|)), 168815#(and (= 0 |ldv_malloc_#res.offset|) (not (= |ldv_malloc_#res.base| 0))), 168812#true, 168813#false, 168818#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 168819#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~i~2 1)), 168816#(and (= 0 |entry_point_#t~ret12.offset|) (not (= |entry_point_#t~ret12.base| 0))), 168817#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 168822#(and (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|))), 168823#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 168820#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 168821#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 168826#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (<= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (and (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (- (+ alloc_17_~array.offset (- 4))) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)))) (not (= alloc_17_~array.offset 0)))), 168827#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4)))) (<= 1 (* 4 alloc_17_~j~0))) (<= 0 (* 4 alloc_17_~j~0)))), 168824#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (and (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (not (= alloc_17_~array.offset 0)))), 168825#(and (or (= alloc_17_~array.offset 0) (= alloc_17_~array.offset |alloc_17_#in~array.offset|)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (and (= 0 (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ (- (+ alloc_17_~array.offset (- 4))) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0) (not (= alloc_17_~array.offset 0)))), 168830#(and (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))))), 168831#(and (= 0 |free_17_#in~array.offset|) (not (= |free_17_#in~array.base| (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4)))), 168828#(or (not (= 0 |alloc_17_#in~array.offset|)) (and (or (<= 0 (+ (* 4 alloc_17_~j~0) 3)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4))))) (<= 0 (+ (* 4 alloc_17_~j~0) 4)))), 168829#(or (not (= 0 |alloc_17_#in~array.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (- (- 4)))))] [2018-02-04 03:22:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 03:22:10,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:22:10,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:22:10,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:22:10,241 INFO L87 Difference]: Start difference. First operand 1030 states and 1250 transitions. Second operand 24 states. [2018-02-04 03:22:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:10,949 INFO L93 Difference]: Finished difference Result 1039 states and 1245 transitions. [2018-02-04 03:22:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:22:10,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 111 [2018-02-04 03:22:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:10,976 INFO L225 Difference]: With dead ends: 1039 [2018-02-04 03:22:10,976 INFO L226 Difference]: Without dead ends: 1039 [2018-02-04 03:22:10,977 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:22:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-02-04 03:22:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1030. [2018-02-04 03:22:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2018-02-04 03:22:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1241 transitions. [2018-02-04 03:22:10,982 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1241 transitions. Word has length 111 [2018-02-04 03:22:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:10,982 INFO L432 AbstractCegarLoop]: Abstraction has 1030 states and 1241 transitions. [2018-02-04 03:22:10,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:22:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1241 transitions. [2018-02-04 03:22:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:22:10,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:10,983 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:10,983 INFO L371 AbstractCegarLoop]: === Iteration 147 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:22:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1264039626, now seen corresponding path program 4 times [2018-02-04 03:22:10,984 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:10,990 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:22:11,072 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 03:22:11,075 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 03:22:11,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:22:11 BoogieIcfgContainer [2018-02-04 03:22:11,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:22:11,076 INFO L168 Benchmark]: Toolchain (without parser) took 163067.50 ms. Allocated memory was 403.2 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 357.0 MB in the beginning and 519.2 MB in the end (delta: -162.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-02-04 03:22:11,077 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.2 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:22:11,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.11 ms. Allocated memory is still 403.2 MB. Free memory was 357.0 MB in the beginning and 343.8 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:22:11,078 INFO L168 Benchmark]: Boogie Preprocessor took 21.01 ms. Allocated memory is still 403.2 MB. Free memory was 343.8 MB in the beginning and 341.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:22:11,078 INFO L168 Benchmark]: RCFGBuilder took 230.91 ms. Allocated memory is still 403.2 MB. Free memory was 341.2 MB in the beginning and 315.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:22:11,078 INFO L168 Benchmark]: TraceAbstraction took 162646.06 ms. Allocated memory was 403.2 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 315.9 MB in the beginning and 519.2 MB in the end (delta: -203.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-02-04 03:22:11,079 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.14 ms. Allocated memory is still 403.2 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.11 ms. Allocated memory is still 403.2 MB. Free memory was 357.0 MB in the beginning and 343.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.01 ms. Allocated memory is still 403.2 MB. Free memory was 343.8 MB in the beginning and 341.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 230.91 ms. Allocated memory is still 403.2 MB. Free memory was 341.2 MB in the beginning and 315.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 162646.06 ms. Allocated memory was 403.2 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 315.9 MB in the beginning and 519.2 MB in the end (delta: -203.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 112 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 162.6s OverallTime, 147 OverallIterations, 8 TraceHistogramMax, 94.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11565 SDtfs, 18859 SDslu, 103783 SDs, 0 SdLazy, 122917 SolverSat, 6043 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5596 GetRequests, 639 SyntacticMatches, 279 SemanticMatches, 4678 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42782 ImplicationChecksByTransitivity, 88.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064occurred in iteration=144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 3178/9746 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 146 MinimizatonAttempts, 3095 StatesRemovedByMinimization, 141 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 63.6s InterpolantComputationTime, 11831 NumberOfCodeBlocks, 11831 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 11685 ConstructedInterpolants, 0 QuantifiedInterpolants, 15271334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 146 InterpolantComputations, 11 PerfectInterpolantSequences, 3178/9746 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-22-11-086.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-22-11-086.csv Completed graceful shutdown