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/memsafety/960521-1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:12:19,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:12:19,036 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:12:19,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:12:19,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:12:19,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:12:19,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:12:19,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:12:19,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:12:19,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:12:19,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:12:19,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:12:19,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:12:19,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:12:19,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:12:19,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:12:19,060 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:12:19,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:12:19,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:12:19,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:12:19,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:12:19,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:12:19,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:12:19,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:12:19,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:12:19,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:12:19,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:12:19,069 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:12:19,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:12:19,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:12:19,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:12:19,070 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 15:12:19,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:12:19,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:12:19,081 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:12:19,081 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:12:19,081 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:12:19,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:12:19,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:12:19,081 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:12:19,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:12:19,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:12:19,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:12:19,082 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:12:19,082 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:12:19,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:12:19,082 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:12:19,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:12:19,083 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:12:19,083 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:12:19,083 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:12:19,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:12:19,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:12:19,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:12:19,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:12:19,124 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:12:19,127 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:12:19,128 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:12:19,129 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:12:19,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-deref.i [2018-02-04 15:12:19,274 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:12:19,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:12:19,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:12:19,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:12:19,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:12:19,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3562dd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19, skipping insertion in model container [2018-02-04 15:12:19,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,297 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:12:19,322 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:12:19,405 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:12:19,419 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:12:19,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19 WrapperNode [2018-02-04 15:12:19,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:12:19,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:12:19,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:12:19,424 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:12:19,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (1/1) ... [2018-02-04 15:12:19,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:12:19,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:12:19,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:12:19,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:12:19,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (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 15:12:19,481 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:12:19,481 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:12:19,481 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 15:12:19,481 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:12:19,481 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:12:19,481 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:12:19,481 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:12:19,482 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:12:19,482 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:12:19,482 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 15:12:19,482 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 15:12:19,482 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 15:12:19,482 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:12:19,482 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:12:19,482 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:12:19,639 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:12:19,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:12:19 BoogieIcfgContainer [2018-02-04 15:12:19,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:12:19,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:12:19,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:12:19,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:12:19,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:12:19" (1/3) ... [2018-02-04 15:12:19,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143acce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:12:19, skipping insertion in model container [2018-02-04 15:12:19,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:12:19" (2/3) ... [2018-02-04 15:12:19,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143acce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:12:19, skipping insertion in model container [2018-02-04 15:12:19,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:12:19" (3/3) ... [2018-02-04 15:12:19,644 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-deref.i [2018-02-04 15:12:19,649 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:12:19,653 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 15:12:19,674 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:12:19,674 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:12:19,674 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:12:19,674 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:12:19,674 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:12:19,674 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:12:19,675 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:12:19,675 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:12:19,675 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:12:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 15:12:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 15:12:19,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:19,689 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:19,689 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989713, now seen corresponding path program 1 times [2018-02-04 15:12:19,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:19,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:19,835 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 15:12:19,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:12:19,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:12:19,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:19,837 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 15:12:19,838 INFO L182 omatonBuilderFactory]: Interpolants [56#true, 57#false, 58#(= 1 (select |#valid| |main_#t~malloc5.base|)), 59#(= 1 (select |#valid| |main_#t~post6.base|))] [2018-02-04 15:12:19,838 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 15:12:19,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:12:19,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:12:19,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:12:19,847 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-04 15:12:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:19,956 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-02-04 15:12:19,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:12:19,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 15:12:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:19,965 INFO L225 Difference]: With dead ends: 52 [2018-02-04 15:12:19,965 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 15:12:19,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 15:12:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 15:12:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 15:12:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 15:12:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 15:12:20,035 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 11 [2018-02-04 15:12:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:20,035 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 15:12:20,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:12:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 15:12:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 15:12:20,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:20,036 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:20,036 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1993989714, now seen corresponding path program 1 times [2018-02-04 15:12:20,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:20,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:20,120 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 15:12:20,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:12:20,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:12:20,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:20,121 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 15:12:20,121 INFO L182 omatonBuilderFactory]: Interpolants [163#true, 164#false, 165#(<= 128 ~n), 166#(and (= 0 |main_#t~malloc5.offset|) (<= 512 (select |#length| |main_#t~malloc5.base|))), 167#(and (<= 512 (select |#length| |main_#t~post6.base|)) (= |main_#t~post6.offset| 0))] [2018-02-04 15:12:20,121 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 15:12:20,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:12:20,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:12:20,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:12:20,123 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 5 states. [2018-02-04 15:12:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:20,171 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 15:12:20,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:12:20,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 15:12:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:20,172 INFO L225 Difference]: With dead ends: 48 [2018-02-04 15:12:20,172 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 15:12:20,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:12:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 15:12:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 15:12:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 15:12:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 15:12:20,177 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-02-04 15:12:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:20,177 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 15:12:20,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:12:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 15:12:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:12:20,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:20,178 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:20,178 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:20,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525484, now seen corresponding path program 1 times [2018-02-04 15:12:20,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:20,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:20,241 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 15:12:20,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:12:20,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:12:20,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:20,242 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 15:12:20,242 INFO L182 omatonBuilderFactory]: Interpolants [272#(or (= ~a.base |main_#t~malloc5.base|) (= 1 (select |#valid| ~a.base))), 273#(or (= ~a.base |main_#t~post6.base|) (= 1 (select |#valid| ~a.base))), 268#true, 269#false, 270#(= 1 (select |#valid| |main_#t~malloc4.base|)), 271#(= 1 (select |#valid| ~a.base))] [2018-02-04 15:12:20,242 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 15:12:20,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:12:20,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:12:20,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:12:20,243 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-02-04 15:12:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:20,284 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 15:12:20,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:12:20,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 15:12:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:20,285 INFO L225 Difference]: With dead ends: 45 [2018-02-04 15:12:20,285 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 15:12:20,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:12:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 15:12:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 15:12:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 15:12:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-02-04 15:12:20,289 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 17 [2018-02-04 15:12:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:20,289 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-02-04 15:12:20,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:12:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-02-04 15:12:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:12:20,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:20,290 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:20,290 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:20,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1188525483, now seen corresponding path program 1 times [2018-02-04 15:12:20,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:20,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:20,401 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 15:12:20,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:12:20,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:12:20,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:20,402 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 15:12:20,403 INFO L182 omatonBuilderFactory]: Interpolants [368#(<= 128 ~n), 369#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 370#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 371#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (select |#length| ~a.base) (* 4 ~n))), 372#(and (= foo_~i~0 0) (<= 512 (select |#length| ~a.base)) (= ~a.offset 0)), 366#true, 367#false] [2018-02-04 15:12:20,403 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 15:12:20,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:12:20,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:12:20,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:12:20,403 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 7 states. [2018-02-04 15:12:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:20,473 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 15:12:20,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:12:20,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 15:12:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:20,474 INFO L225 Difference]: With dead ends: 53 [2018-02-04 15:12:20,474 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 15:12:20,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:12:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 15:12:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-02-04 15:12:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 15:12:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 15:12:20,477 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2018-02-04 15:12:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:20,478 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 15:12:20,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:12:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 15:12:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 15:12:20,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:20,478 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:20,478 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2106816852, now seen corresponding path program 1 times [2018-02-04 15:12:20,479 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:20,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:20,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:20,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 15:12:20,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:20,608 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 15:12:20,608 INFO L182 omatonBuilderFactory]: Interpolants [480#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 481#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 482#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 483#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 508) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 476#true, 477#false, 478#(<= 128 ~n), 479#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|))] [2018-02-04 15:12:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:20,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:12:20,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:12:20,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:12:20,609 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 8 states. [2018-02-04 15:12:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:20,719 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-04 15:12:20,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:12:20,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 15:12:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:20,725 INFO L225 Difference]: With dead ends: 65 [2018-02-04 15:12:20,725 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 15:12:20,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:12:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 15:12:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2018-02-04 15:12:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 15:12:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 15:12:20,728 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 21 [2018-02-04 15:12:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:20,728 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 15:12:20,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:12:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 15:12:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 15:12:20,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:20,729 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:20,729 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:20,729 INFO L82 PathProgramCache]: Analyzing trace with hash -702775421, now seen corresponding path program 2 times [2018-02-04 15:12:20,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:20,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:20,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:20,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 15:12:20,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:20,882 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 15:12:20,882 INFO L182 omatonBuilderFactory]: Interpolants [608#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 609#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 610#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 611#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 612#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 504) (select |#length| ~a.base))), 603#true, 604#false, 605#(<= 128 ~n), 606#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 607#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:12:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:20,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:12:20,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:12:20,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:12:20,883 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 10 states. [2018-02-04 15:12:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:21,040 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-04 15:12:21,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:12:21,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-04 15:12:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:21,041 INFO L225 Difference]: With dead ends: 77 [2018-02-04 15:12:21,042 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 15:12:21,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:12:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 15:12:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2018-02-04 15:12:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 15:12:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 15:12:21,046 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 25 [2018-02-04 15:12:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:21,046 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 15:12:21,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:12:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 15:12:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 15:12:21,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:21,047 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:21,047 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1827026138, now seen corresponding path program 3 times [2018-02-04 15:12:21,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:21,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:21,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:21,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:12:21,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:21,204 INFO L182 omatonBuilderFactory]: Interpolants [752#true, 753#false, 754#(<= 128 ~n), 755#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 756#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 757#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 758#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 759#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 760#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 761#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 762#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 500) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:21,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:12:21,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:12:21,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:12:21,204 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2018-02-04 15:12:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:21,356 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-04 15:12:21,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:12:21,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-04 15:12:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:21,356 INFO L225 Difference]: With dead ends: 89 [2018-02-04 15:12:21,357 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 15:12:21,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:12:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 15:12:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2018-02-04 15:12:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 15:12:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 15:12:21,359 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 29 [2018-02-04 15:12:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:21,360 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 15:12:21,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:12:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 15:12:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 15:12:21,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:21,360 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:21,360 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1922524849, now seen corresponding path program 4 times [2018-02-04 15:12:21,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:21,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:21,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:21,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 15:12:21,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:21,562 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 15:12:21,562 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 929#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 930#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 931#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 496) (select |#length| ~a.base))), 920#true, 921#false, 922#(<= 128 ~n), 923#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 924#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 925#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 926#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 927#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n))] [2018-02-04 15:12:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:21,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 15:12:21,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 15:12:21,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:12:21,563 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 12 states. [2018-02-04 15:12:21,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:21,790 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-04 15:12:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:12:21,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-04 15:12:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:21,791 INFO L225 Difference]: With dead ends: 101 [2018-02-04 15:12:21,792 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 15:12:21,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:12:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 15:12:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2018-02-04 15:12:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 15:12:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-02-04 15:12:21,796 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 33 [2018-02-04 15:12:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:21,796 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-02-04 15:12:21,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 15:12:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-02-04 15:12:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 15:12:21,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:21,797 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:21,797 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:21,797 INFO L82 PathProgramCache]: Analyzing trace with hash -165817080, now seen corresponding path program 5 times [2018-02-04 15:12:21,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:21,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:21,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:21,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:12:21,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:21,993 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 15:12:21,993 INFO L182 omatonBuilderFactory]: Interpolants [1107#true, 1108#false, 1109#(<= 128 ~n), 1110#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1111#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1112#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1113#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1114#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 1115#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 1116#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 1117#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 124) ~n)), 1118#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1119#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 492) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:21,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:12:21,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:12:21,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:12:21,993 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 13 states. [2018-02-04 15:12:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:22,183 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-02-04 15:12:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:12:22,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 15:12:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:22,184 INFO L225 Difference]: With dead ends: 113 [2018-02-04 15:12:22,184 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 15:12:22,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:12:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 15:12:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 68. [2018-02-04 15:12:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 15:12:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-02-04 15:12:22,187 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 37 [2018-02-04 15:12:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:22,187 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-02-04 15:12:22,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:12:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-02-04 15:12:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 15:12:22,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:22,187 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:22,188 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:22,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1502035935, now seen corresponding path program 6 times [2018-02-04 15:12:22,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:22,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:22,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:22,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 15:12:22,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:22,392 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 15:12:22,393 INFO L182 omatonBuilderFactory]: Interpolants [1313#true, 1314#false, 1315#(<= 128 ~n), 1316#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1317#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1318#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1319#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1320#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 1321#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 1322#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 1323#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 1324#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 1325#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1326#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 488) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:22,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 15:12:22,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 15:12:22,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:12:22,393 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 14 states. [2018-02-04 15:12:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:22,667 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 15:12:22,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:12:22,667 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-04 15:12:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:22,668 INFO L225 Difference]: With dead ends: 125 [2018-02-04 15:12:22,668 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 15:12:22,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:12:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 15:12:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 72. [2018-02-04 15:12:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 15:12:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-02-04 15:12:22,671 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 41 [2018-02-04 15:12:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:22,671 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-02-04 15:12:22,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 15:12:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-02-04 15:12:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 15:12:22,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:22,672 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:22,672 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:22,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1040095434, now seen corresponding path program 7 times [2018-02-04 15:12:22,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:22,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:22,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:22,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 15:12:22,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:22,858 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 15:12:22,858 INFO L182 omatonBuilderFactory]: Interpolants [1538#true, 1539#false, 1540#(<= 128 ~n), 1541#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1542#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1543#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1544#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1545#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 1546#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 1547#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 1548#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 1549#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 1550#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 1551#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1552#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 484) (select |#length| ~a.base)))] [2018-02-04 15:12:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:22,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 15:12:22,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 15:12:22,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:12:22,859 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 15 states. [2018-02-04 15:12:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:23,127 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-02-04 15:12:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 15:12:23,128 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 15:12:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:23,129 INFO L225 Difference]: With dead ends: 137 [2018-02-04 15:12:23,129 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 15:12:23,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-02-04 15:12:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 15:12:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 76. [2018-02-04 15:12:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 15:12:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-02-04 15:12:23,133 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 45 [2018-02-04 15:12:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:23,134 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-02-04 15:12:23,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 15:12:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-02-04 15:12:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 15:12:23,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:23,135 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:23,135 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2015753459, now seen corresponding path program 8 times [2018-02-04 15:12:23,135 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:23,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:23,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:23,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 15:12:23,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:23,368 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 15:12:23,368 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 1793#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 1794#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 1795#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 121) ~n)), 1796#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 1797#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 480) (select |#length| ~a.base))), 1782#true, 1783#false, 1784#(<= 128 ~n), 1785#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1786#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1787#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 1788#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 1789#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 1790#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 1791#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n))] [2018-02-04 15:12:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:23,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:12:23,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:12:23,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:12:23,369 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 16 states. [2018-02-04 15:12:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:23,685 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-02-04 15:12:23,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:12:23,685 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-04 15:12:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:23,686 INFO L225 Difference]: With dead ends: 149 [2018-02-04 15:12:23,686 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 15:12:23,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:12:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 15:12:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 80. [2018-02-04 15:12:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 15:12:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-02-04 15:12:23,688 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 49 [2018-02-04 15:12:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:23,689 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-02-04 15:12:23,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:12:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-02-04 15:12:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 15:12:23,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:23,689 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:23,689 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1501631644, now seen corresponding path program 9 times [2018-02-04 15:12:23,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:23,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:23,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:23,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 15:12:23,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:23,946 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 15:12:23,947 INFO L182 omatonBuilderFactory]: Interpolants [2048#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2049#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2050#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2051#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2052#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 2053#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 2054#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 2055#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 2056#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 2057#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 2058#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2059#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2060#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2061#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 476) (select |#length| ~a.base))), 2045#true, 2046#false, 2047#(<= 128 ~n)] [2018-02-04 15:12:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:23,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 15:12:23,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 15:12:23,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:12:23,947 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 17 states. [2018-02-04 15:12:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:24,298 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-02-04 15:12:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:12:24,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-04 15:12:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:24,299 INFO L225 Difference]: With dead ends: 161 [2018-02-04 15:12:24,300 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 15:12:24,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:12:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 15:12:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 84. [2018-02-04 15:12:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 15:12:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-02-04 15:12:24,304 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 53 [2018-02-04 15:12:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:24,304 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-02-04 15:12:24,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 15:12:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-02-04 15:12:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 15:12:24,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:24,305 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:24,305 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:24,305 INFO L82 PathProgramCache]: Analyzing trace with hash 746440763, now seen corresponding path program 10 times [2018-02-04 15:12:24,306 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:24,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:24,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:24,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:12:24,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:24,522 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 15:12:24,522 INFO L182 omatonBuilderFactory]: Interpolants [2336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 2337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 2338#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 2339#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 2340#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2341#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 2342#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 119) ~n)), 2343#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2344#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 472) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2327#true, 2328#false, 2329#(<= 128 ~n), 2330#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2331#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2332#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2333#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2334#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 2335#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n))] [2018-02-04 15:12:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:24,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:12:24,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:12:24,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:12:24,523 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 18 states. [2018-02-04 15:12:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:24,847 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2018-02-04 15:12:24,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 15:12:24,847 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-02-04 15:12:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:24,848 INFO L225 Difference]: With dead ends: 173 [2018-02-04 15:12:24,848 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 15:12:24,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2018-02-04 15:12:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 15:12:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 88. [2018-02-04 15:12:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 15:12:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-02-04 15:12:24,852 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 57 [2018-02-04 15:12:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:24,852 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-02-04 15:12:24,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:12:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-02-04 15:12:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 15:12:24,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:24,853 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:24,853 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1417387630, now seen corresponding path program 11 times [2018-02-04 15:12:24,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:24,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:25,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:25,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 15:12:25,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:25,123 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 15:12:25,123 INFO L182 omatonBuilderFactory]: Interpolants [2628#true, 2629#false, 2630#(<= 128 ~n), 2631#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2632#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2633#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2634#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2635#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 2636#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 2637#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 2638#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 2639#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 2640#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 2641#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2642#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 2643#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2644#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2645#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2646#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 468) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:25,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 15:12:25,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 15:12:25,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:12:25,124 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 19 states. [2018-02-04 15:12:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:25,497 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. [2018-02-04 15:12:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 15:12:25,497 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-02-04 15:12:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:25,498 INFO L225 Difference]: With dead ends: 185 [2018-02-04 15:12:25,498 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 15:12:25,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=642, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:12:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 15:12:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 92. [2018-02-04 15:12:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 15:12:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-02-04 15:12:25,501 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 61 [2018-02-04 15:12:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:25,502 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-02-04 15:12:25,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 15:12:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-02-04 15:12:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 15:12:25,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:25,503 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:25,503 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:25,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1470072983, now seen corresponding path program 12 times [2018-02-04 15:12:25,504 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:25,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:25,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:25,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 15:12:25,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:25,785 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 15:12:25,786 INFO L182 omatonBuilderFactory]: Interpolants [2948#true, 2949#false, 2950#(<= 128 ~n), 2951#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 2952#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2953#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 2954#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2955#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 2956#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 2957#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 2958#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 2959#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 2960#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 2961#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2962#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 2963#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2964#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2965#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 2966#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2967#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 464) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:25,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 15:12:25,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 15:12:25,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-02-04 15:12:25,786 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 20 states. [2018-02-04 15:12:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:26,197 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-02-04 15:12:26,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 15:12:26,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-04 15:12:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:26,198 INFO L225 Difference]: With dead ends: 197 [2018-02-04 15:12:26,199 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 15:12:26,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=726, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 15:12:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 15:12:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 96. [2018-02-04 15:12:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 15:12:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-02-04 15:12:26,202 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 65 [2018-02-04 15:12:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:26,203 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-02-04 15:12:26,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 15:12:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-02-04 15:12:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 15:12:26,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:26,204 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:26,204 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash 184535488, now seen corresponding path program 13 times [2018-02-04 15:12:26,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:26,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:26,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:26,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 15:12:26,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:26,594 INFO L182 omatonBuilderFactory]: Interpolants [3296#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 3297#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 3298#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 3299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 3300#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3301#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 3302#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3303#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3304#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3305#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3306#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3307#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 460) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3287#true, 3288#false, 3289#(<= 128 ~n), 3290#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 3291#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3292#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3293#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3294#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 3295#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n))] [2018-02-04 15:12:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:26,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 15:12:26,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 15:12:26,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:12:26,595 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 21 states. [2018-02-04 15:12:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:27,036 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2018-02-04 15:12:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 15:12:27,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-02-04 15:12:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:27,037 INFO L225 Difference]: With dead ends: 209 [2018-02-04 15:12:27,037 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 15:12:27,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=815, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 15:12:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 15:12:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 100. [2018-02-04 15:12:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 15:12:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-02-04 15:12:27,039 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 69 [2018-02-04 15:12:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:27,039 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-02-04 15:12:27,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 15:12:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-02-04 15:12:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 15:12:27,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:27,040 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:27,040 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:27,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1905256297, now seen corresponding path program 14 times [2018-02-04 15:12:27,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:27,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:27,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:27,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 15:12:27,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:27,338 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 15:12:27,338 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 3649#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3650#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3651#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3652#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 3653#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 3654#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 3655#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 3656#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 3657#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 3658#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 3660#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3661#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3662#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 3663#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 3664#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3665#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3666#(and (<= (+ (* 4 foo_~i~0) 456) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3645#true, 3646#false, 3647#(<= 128 ~n)] [2018-02-04 15:12:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:27,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 15:12:27,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 15:12:27,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:12:27,339 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 22 states. [2018-02-04 15:12:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:27,808 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-02-04 15:12:27,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 15:12:27,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-02-04 15:12:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:27,809 INFO L225 Difference]: With dead ends: 221 [2018-02-04 15:12:27,809 INFO L226 Difference]: Without dead ends: 221 [2018-02-04 15:12:27,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=423, Invalid=909, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:12:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-04 15:12:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 104. [2018-02-04 15:12:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 15:12:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-02-04 15:12:27,811 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 73 [2018-02-04 15:12:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:27,811 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-02-04 15:12:27,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 15:12:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-02-04 15:12:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 15:12:27,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:27,812 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:27,812 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash 819930094, now seen corresponding path program 15 times [2018-02-04 15:12:27,812 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:27,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:28,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:28,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 15:12:28,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:28,144 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 15:12:28,144 INFO L182 omatonBuilderFactory]: Interpolants [4032#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 4033#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 4034#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 4035#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4036#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 4037#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4038#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4039#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4040#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4041#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4042#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4043#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4044#(and (<= (+ (* 4 foo_~i~0) 452) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4022#true, 4023#false, 4024#(<= 128 ~n), 4025#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4026#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4027#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4028#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4029#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 4030#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 4031#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n))] [2018-02-04 15:12:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:28,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 15:12:28,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 15:12:28,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2018-02-04 15:12:28,145 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 23 states. [2018-02-04 15:12:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:28,703 INFO L93 Difference]: Finished difference Result 233 states and 250 transitions. [2018-02-04 15:12:28,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 15:12:28,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2018-02-04 15:12:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:28,705 INFO L225 Difference]: With dead ends: 233 [2018-02-04 15:12:28,705 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 15:12:28,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=474, Invalid=1008, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:12:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 15:12:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 108. [2018-02-04 15:12:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 15:12:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-02-04 15:12:28,708 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 77 [2018-02-04 15:12:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:28,709 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-02-04 15:12:28,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 15:12:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-02-04 15:12:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 15:12:28,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:28,710 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:28,710 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:28,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1550144571, now seen corresponding path program 16 times [2018-02-04 15:12:28,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:28,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:29,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:29,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 15:12:29,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:29,209 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 15:12:29,209 INFO L182 omatonBuilderFactory]: Interpolants [4418#true, 4419#false, 4420#(<= 128 ~n), 4421#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4422#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4423#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4424#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4425#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 4426#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 4427#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 4428#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 4429#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 4430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 4431#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4432#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 4433#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4434#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4435#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4436#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4437#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4438#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4439#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4440#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4441#(and (<= (+ (* 4 foo_~i~0) 448) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:29,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 15:12:29,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 15:12:29,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-02-04 15:12:29,210 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 24 states. [2018-02-04 15:12:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:29,813 INFO L93 Difference]: Finished difference Result 245 states and 263 transitions. [2018-02-04 15:12:29,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 15:12:29,813 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 81 [2018-02-04 15:12:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:29,814 INFO L225 Difference]: With dead ends: 245 [2018-02-04 15:12:29,814 INFO L226 Difference]: Without dead ends: 245 [2018-02-04 15:12:29,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=1112, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 15:12:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-04 15:12:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 112. [2018-02-04 15:12:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 15:12:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-02-04 15:12:29,816 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 81 [2018-02-04 15:12:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:29,816 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-02-04 15:12:29,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 15:12:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-02-04 15:12:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 15:12:29,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:29,817 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:29,817 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1156550628, now seen corresponding path program 17 times [2018-02-04 15:12:29,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:29,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:30,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:30,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 15:12:30,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:30,238 INFO L182 omatonBuilderFactory]: Interpolants [4833#true, 4834#false, 4835#(<= 128 ~n), 4836#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 4837#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4838#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4839#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4840#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 4841#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 4842#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 4843#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 4844#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 4845#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 4846#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4847#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 4848#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4849#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4850#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 4851#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4852#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4853#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 4854#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 4855#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4856#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4857#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 444) (select |#length| ~a.base)))] [2018-02-04 15:12:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:30,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 15:12:30,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 15:12:30,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:12:30,239 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 25 states. [2018-02-04 15:12:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:30,909 INFO L93 Difference]: Finished difference Result 257 states and 276 transitions. [2018-02-04 15:12:30,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 15:12:30,909 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-02-04 15:12:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:30,910 INFO L225 Difference]: With dead ends: 257 [2018-02-04 15:12:30,910 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 15:12:30,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=585, Invalid=1221, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 15:12:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 15:12:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 116. [2018-02-04 15:12:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 15:12:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-02-04 15:12:30,913 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 85 [2018-02-04 15:12:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:30,913 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-02-04 15:12:30,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 15:12:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-02-04 15:12:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 15:12:30,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:30,913 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:30,913 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:30,913 INFO L82 PathProgramCache]: Analyzing trace with hash -556912397, now seen corresponding path program 18 times [2018-02-04 15:12:30,914 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:30,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:31,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:31,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 15:12:31,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:31,357 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 15:12:31,357 INFO L182 omatonBuilderFactory]: Interpolants [5267#true, 5268#false, 5269#(<= 128 ~n), 5270#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 5271#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5272#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5273#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5274#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 5275#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 5276#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 5277#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 5278#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 5279#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 5280#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5281#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 5282#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5283#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5284#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5285#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5286#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5287#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5288#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 5289#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 5290#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 5291#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 5292#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 440) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:31,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 15:12:31,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 15:12:31,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:12:31,358 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 26 states. [2018-02-04 15:12:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:31,990 INFO L93 Difference]: Finished difference Result 269 states and 289 transitions. [2018-02-04 15:12:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:12:31,990 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-02-04 15:12:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:31,991 INFO L225 Difference]: With dead ends: 269 [2018-02-04 15:12:31,992 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 15:12:31,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=645, Invalid=1335, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 15:12:31,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 15:12:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 120. [2018-02-04 15:12:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 15:12:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-02-04 15:12:31,996 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 89 [2018-02-04 15:12:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:31,996 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-02-04 15:12:31,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 15:12:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-02-04 15:12:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 15:12:31,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:31,997 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:31,997 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:31,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2038541898, now seen corresponding path program 19 times [2018-02-04 15:12:31,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:32,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:32,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:32,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 15:12:32,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:32,468 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 15:12:32,468 INFO L182 omatonBuilderFactory]: Interpolants [5720#true, 5721#false, 5722#(<= 128 ~n), 5723#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 5724#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5725#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5726#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5727#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 5728#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 5729#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 5730#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 5731#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 5732#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 5733#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5734#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 5735#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5736#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5737#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 5738#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5739#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5740#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 5741#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 5742#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 5743#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 5744#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 5745#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 5746#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 436) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:32,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 15:12:32,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 15:12:32,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=473, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:12:32,469 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 27 states. [2018-02-04 15:12:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:33,331 INFO L93 Difference]: Finished difference Result 281 states and 302 transitions. [2018-02-04 15:12:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 15:12:33,335 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2018-02-04 15:12:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:33,336 INFO L225 Difference]: With dead ends: 281 [2018-02-04 15:12:33,336 INFO L226 Difference]: Without dead ends: 281 [2018-02-04 15:12:33,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 15:12:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-04 15:12:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 124. [2018-02-04 15:12:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 15:12:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-02-04 15:12:33,341 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 93 [2018-02-04 15:12:33,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:33,341 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-02-04 15:12:33,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 15:12:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-02-04 15:12:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 15:12:33,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:33,342 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:33,342 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1761126433, now seen corresponding path program 20 times [2018-02-04 15:12:33,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:33,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:33,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:33,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 15:12:33,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:33,947 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 15:12:33,947 INFO L182 omatonBuilderFactory]: Interpolants [6208#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6209#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6210#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6211#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6212#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 6214#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 6215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 6216#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6217#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 6218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6219#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 432) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6192#true, 6193#false, 6194#(<= 128 ~n), 6195#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 6196#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6197#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6198#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6199#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 6200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 6201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 6202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 6203#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 6204#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 6205#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 6207#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:12:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:33,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 15:12:33,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 15:12:33,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=506, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:12:33,948 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 28 states. [2018-02-04 15:12:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:34,626 INFO L93 Difference]: Finished difference Result 293 states and 315 transitions. [2018-02-04 15:12:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 15:12:34,626 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2018-02-04 15:12:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:34,627 INFO L225 Difference]: With dead ends: 293 [2018-02-04 15:12:34,627 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 15:12:34,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=774, Invalid=1578, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 15:12:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 15:12:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 128. [2018-02-04 15:12:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 15:12:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-02-04 15:12:34,630 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 97 [2018-02-04 15:12:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:34,630 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-02-04 15:12:34,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 15:12:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-02-04 15:12:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 15:12:34,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:34,630 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:34,630 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:34,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1847647864, now seen corresponding path program 21 times [2018-02-04 15:12:34,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:34,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:35,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:35,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 15:12:35,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:35,163 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 15:12:35,164 INFO L182 omatonBuilderFactory]: Interpolants [6683#true, 6684#false, 6685#(<= 128 ~n), 6686#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 6687#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6688#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6689#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6690#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 6691#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 6692#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 6693#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 6694#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 6695#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 6696#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6697#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 6698#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6699#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6700#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6701#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6702#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6703#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 6704#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 6705#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 6706#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 6707#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 6708#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 6709#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 6710#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6711#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 428) (select |#length| ~a.base)))] [2018-02-04 15:12:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:35,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 15:12:35,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 15:12:35,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=540, Unknown=0, NotChecked=0, Total=812 [2018-02-04 15:12:35,164 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 29 states. [2018-02-04 15:12:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:35,909 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-02-04 15:12:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 15:12:35,909 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2018-02-04 15:12:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:35,910 INFO L225 Difference]: With dead ends: 305 [2018-02-04 15:12:35,910 INFO L226 Difference]: Without dead ends: 305 [2018-02-04 15:12:35,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 15:12:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-04 15:12:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 132. [2018-02-04 15:12:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 15:12:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-02-04 15:12:35,913 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 101 [2018-02-04 15:12:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:35,913 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-02-04 15:12:35,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 15:12:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-02-04 15:12:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 15:12:35,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:35,914 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:35,914 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1660415665, now seen corresponding path program 22 times [2018-02-04 15:12:35,914 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:35,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:36,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:36,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 15:12:36,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:36,437 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 15:12:36,438 INFO L182 omatonBuilderFactory]: Interpolants [7193#true, 7194#false, 7195#(<= 128 ~n), 7196#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 7197#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7198#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7199#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 7201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 7202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 7203#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 7204#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 7205#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 7206#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7207#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 7208#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7209#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7210#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7211#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7212#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7213#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7214#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 7215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 7216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 7217#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 7219#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7220#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 7221#(and (<= (+ foo_~i~0 106) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7222#(and (<= (+ (* 4 foo_~i~0) 424) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:36,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 15:12:36,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 15:12:36,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=575, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:12:36,439 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 30 states. [2018-02-04 15:12:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:37,265 INFO L93 Difference]: Finished difference Result 317 states and 341 transitions. [2018-02-04 15:12:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 15:12:37,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 105 [2018-02-04 15:12:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:37,266 INFO L225 Difference]: With dead ends: 317 [2018-02-04 15:12:37,266 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 15:12:37,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=915, Invalid=1841, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 15:12:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 15:12:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 136. [2018-02-04 15:12:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 15:12:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-02-04 15:12:37,268 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 105 [2018-02-04 15:12:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:37,269 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-02-04 15:12:37,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 15:12:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-02-04 15:12:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 15:12:37,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:37,269 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:37,269 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:37,269 INFO L82 PathProgramCache]: Analyzing trace with hash -857997146, now seen corresponding path program 23 times [2018-02-04 15:12:37,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:37,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:37,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:37,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 15:12:37,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:37,889 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 15:12:37,889 INFO L182 omatonBuilderFactory]: Interpolants [7744#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 7745#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 7746#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7747#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 7748#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7749#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7750#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 7751#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7752#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 420) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 7722#true, 7723#false, 7724#(<= 128 ~n), 7725#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 7726#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7727#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7728#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7729#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 7730#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 7731#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 7732#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 7733#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 7734#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 7735#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7736#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 7737#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7738#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7739#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 7740#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7741#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7742#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 7743#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n))] [2018-02-04 15:12:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:37,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 15:12:37,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 15:12:37,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=611, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:12:37,891 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 31 states. [2018-02-04 15:12:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:38,649 INFO L93 Difference]: Finished difference Result 329 states and 354 transitions. [2018-02-04 15:12:38,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 15:12:38,649 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 109 [2018-02-04 15:12:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:38,650 INFO L225 Difference]: With dead ends: 329 [2018-02-04 15:12:38,650 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 15:12:38,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=1980, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 15:12:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 15:12:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 140. [2018-02-04 15:12:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 15:12:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-04 15:12:38,653 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 109 [2018-02-04 15:12:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:38,653 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-04 15:12:38,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 15:12:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-04 15:12:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 15:12:38,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:38,654 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:38,654 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash 132803709, now seen corresponding path program 24 times [2018-02-04 15:12:38,655 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:38,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:39,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:39,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 15:12:39,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:39,224 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 15:12:39,225 INFO L182 omatonBuilderFactory]: Interpolants [8270#true, 8271#false, 8272#(<= 128 ~n), 8273#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 8274#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8275#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8276#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8277#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 8278#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 8279#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 8280#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 8281#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 8282#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 8283#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8284#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 8285#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8286#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8287#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8288#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8289#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8290#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8291#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 8292#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 8293#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 8294#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8295#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 8296#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8297#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8298#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 8299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 8300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 8301#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 416) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:39,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 15:12:39,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 15:12:39,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=648, Unknown=0, NotChecked=0, Total=992 [2018-02-04 15:12:39,226 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 32 states. [2018-02-04 15:12:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:40,108 INFO L93 Difference]: Finished difference Result 341 states and 367 transitions. [2018-02-04 15:12:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 15:12:40,109 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 113 [2018-02-04 15:12:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:40,110 INFO L225 Difference]: With dead ends: 341 [2018-02-04 15:12:40,110 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 15:12:40,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1068, Invalid=2124, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 15:12:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 15:12:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 144. [2018-02-04 15:12:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 15:12:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-02-04 15:12:40,114 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 113 [2018-02-04 15:12:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:40,115 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-02-04 15:12:40,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 15:12:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-02-04 15:12:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 15:12:40,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:40,115 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:40,115 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash -73329452, now seen corresponding path program 25 times [2018-02-04 15:12:40,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:40,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:40,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:40,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 15:12:40,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:40,800 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 15:12:40,800 INFO L182 omatonBuilderFactory]: Interpolants [8837#true, 8838#false, 8839#(<= 128 ~n), 8840#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 8841#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8842#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8843#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8844#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 8845#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 8846#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 8847#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 8848#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 8849#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 8850#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8851#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 8852#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8853#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8854#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8855#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8856#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8857#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 8858#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 8859#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 8860#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 8861#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8862#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 8863#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8864#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 8865#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 8866#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 8867#(and (= ~a.offset 0) (<= (+ foo_~i~0 104) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 8868#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 8869#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 412) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:40,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 15:12:40,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 15:12:40,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=686, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 15:12:40,802 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 33 states. [2018-02-04 15:12:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:41,763 INFO L93 Difference]: Finished difference Result 353 states and 380 transitions. [2018-02-04 15:12:41,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 15:12:41,764 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 117 [2018-02-04 15:12:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:41,765 INFO L225 Difference]: With dead ends: 353 [2018-02-04 15:12:41,765 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 15:12:41,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1149, Invalid=2273, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 15:12:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 15:12:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 148. [2018-02-04 15:12:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 15:12:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-02-04 15:12:41,770 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 117 [2018-02-04 15:12:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:41,770 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-02-04 15:12:41,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 15:12:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-02-04 15:12:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 15:12:41,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:41,771 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:41,771 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1754118571, now seen corresponding path program 26 times [2018-02-04 15:12:41,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:41,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:42,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:42,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 15:12:42,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:42,458 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 15:12:42,458 INFO L182 omatonBuilderFactory]: Interpolants [9423#true, 9424#false, 9425#(<= 128 ~n), 9426#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 9427#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9428#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9429#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 9431#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 9432#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 9433#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 9434#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 9435#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 9436#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9437#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 9438#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9439#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9440#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9441#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9442#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9443#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 9444#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 9445#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 9446#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 9447#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9448#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 9449#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9450#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9451#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 9452#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 9453#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 9454#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 9455#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 9456#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 408) (select |#length| ~a.base)))] [2018-02-04 15:12:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:42,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 15:12:42,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 15:12:42,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=725, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:12:42,459 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 34 states. [2018-02-04 15:12:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:43,432 INFO L93 Difference]: Finished difference Result 365 states and 393 transitions. [2018-02-04 15:12:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 15:12:43,432 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 121 [2018-02-04 15:12:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:43,433 INFO L225 Difference]: With dead ends: 365 [2018-02-04 15:12:43,433 INFO L226 Difference]: Without dead ends: 365 [2018-02-04 15:12:43,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1233, Invalid=2427, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 15:12:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-04 15:12:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 152. [2018-02-04 15:12:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 15:12:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-02-04 15:12:43,436 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 121 [2018-02-04 15:12:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:43,436 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-02-04 15:12:43,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 15:12:43,436 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-02-04 15:12:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 15:12:43,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:43,438 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:43,438 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:43,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1839326462, now seen corresponding path program 27 times [2018-02-04 15:12:43,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:43,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:44,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:44,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 15:12:44,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:44,136 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 15:12:44,136 INFO L182 omatonBuilderFactory]: Interpolants [10048#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10049#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 10050#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 10051#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 10052#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10053#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 10054#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10055#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10056#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 10057#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 10058#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10059#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10060#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 10061#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 10062#(and (<= (+ (* 4 foo_~i~0) 404) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 10028#true, 10029#false, 10030#(<= 128 ~n), 10031#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 10032#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10033#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10034#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10035#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 10036#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 10037#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 10038#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 10039#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 10040#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 10041#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10042#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 10043#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10044#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10045#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10046#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10047#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:12:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:44,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 15:12:44,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 15:12:44,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=765, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 15:12:44,137 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 35 states. [2018-02-04 15:12:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:45,093 INFO L93 Difference]: Finished difference Result 377 states and 406 transitions. [2018-02-04 15:12:45,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 15:12:45,093 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 125 [2018-02-04 15:12:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:45,094 INFO L225 Difference]: With dead ends: 377 [2018-02-04 15:12:45,094 INFO L226 Difference]: Without dead ends: 377 [2018-02-04 15:12:45,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1320, Invalid=2586, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 15:12:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-04 15:12:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 156. [2018-02-04 15:12:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 15:12:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-02-04 15:12:45,098 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 125 [2018-02-04 15:12:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:45,098 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-02-04 15:12:45,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 15:12:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-02-04 15:12:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 15:12:45,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:45,099 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:45,099 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1344276263, now seen corresponding path program 28 times [2018-02-04 15:12:45,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:45,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:45,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:45,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 15:12:45,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:45,829 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 15:12:45,829 INFO L182 omatonBuilderFactory]: Interpolants [10652#true, 10653#false, 10654#(<= 128 ~n), 10655#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 10656#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10657#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10658#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 10660#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 10661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 10662#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 10663#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 10664#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 10665#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 10667#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10668#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10669#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10670#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10671#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10672#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 10673#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 10674#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 10675#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 10676#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10677#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 10678#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10679#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10680#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 10681#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 10682#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10683#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10684#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 10685#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 10686#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 100) ~n)), 10687#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 400) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:45,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 15:12:45,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 15:12:45,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=806, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 15:12:45,831 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 36 states. [2018-02-04 15:12:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:46,862 INFO L93 Difference]: Finished difference Result 389 states and 419 transitions. [2018-02-04 15:12:46,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 15:12:46,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 129 [2018-02-04 15:12:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:46,863 INFO L225 Difference]: With dead ends: 389 [2018-02-04 15:12:46,864 INFO L226 Difference]: Without dead ends: 389 [2018-02-04 15:12:46,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1410, Invalid=2750, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 15:12:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-04 15:12:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 160. [2018-02-04 15:12:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 15:12:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-02-04 15:12:46,866 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 129 [2018-02-04 15:12:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:46,867 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-02-04 15:12:46,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 15:12:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-02-04 15:12:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-04 15:12:46,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:46,867 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:46,867 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1526797104, now seen corresponding path program 29 times [2018-02-04 15:12:46,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:46,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:47,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:47,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 15:12:47,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:47,675 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 15:12:47,675 INFO L182 omatonBuilderFactory]: Interpolants [11328#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 11329#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 100) ~n)), 11330#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11331#(and (<= (+ (* 4 foo_~i~0) 396) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11295#true, 11296#false, 11297#(<= 128 ~n), 11298#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 11299#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11300#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11301#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11302#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 11303#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 11304#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 11305#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 11306#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 11307#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 11308#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11309#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 11310#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11311#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11312#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11313#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11314#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11315#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11316#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 11317#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 11318#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 11319#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11320#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 11321#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11322#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11323#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 11324#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 11325#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11326#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11327#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:12:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:47,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 15:12:47,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 15:12:47,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=848, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:12:47,676 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 37 states. [2018-02-04 15:12:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:48,680 INFO L93 Difference]: Finished difference Result 401 states and 432 transitions. [2018-02-04 15:12:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 15:12:48,680 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 133 [2018-02-04 15:12:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:48,681 INFO L225 Difference]: With dead ends: 401 [2018-02-04 15:12:48,681 INFO L226 Difference]: Without dead ends: 401 [2018-02-04 15:12:48,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1503, Invalid=2919, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:12:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-04 15:12:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 164. [2018-02-04 15:12:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 15:12:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-02-04 15:12:48,685 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 133 [2018-02-04 15:12:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:48,685 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-02-04 15:12:48,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 15:12:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-02-04 15:12:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 15:12:48,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:48,686 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:48,686 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 13576711, now seen corresponding path program 30 times [2018-02-04 15:12:48,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:48,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:49,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:49,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 15:12:49,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:49,470 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 15:12:49,470 INFO L182 omatonBuilderFactory]: Interpolants [11968#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 11969#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 11970#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11971#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 11972#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11973#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11974#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11975#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11976#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11977#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11978#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 11979#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 11980#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 11981#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11982#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 11983#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11984#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11985#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 11986#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 11987#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11988#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11989#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11990#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 11991#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 11992#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 11993#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11994#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 392) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 11957#true, 11958#false, 11959#(<= 128 ~n), 11960#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 11961#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11962#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 11963#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 11964#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 11965#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 11966#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 11967#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n))] [2018-02-04 15:12:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:49,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 15:12:49,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 15:12:49,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 15:12:49,472 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 38 states. [2018-02-04 15:12:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:50,594 INFO L93 Difference]: Finished difference Result 413 states and 445 transitions. [2018-02-04 15:12:50,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 15:12:50,594 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 137 [2018-02-04 15:12:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:50,595 INFO L225 Difference]: With dead ends: 413 [2018-02-04 15:12:50,595 INFO L226 Difference]: Without dead ends: 413 [2018-02-04 15:12:50,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1599, Invalid=3093, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 15:12:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-04 15:12:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 168. [2018-02-04 15:12:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 15:12:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-02-04 15:12:50,598 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 137 [2018-02-04 15:12:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:50,598 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-02-04 15:12:50,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 15:12:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-02-04 15:12:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 15:12:50,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:50,599 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:50,599 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:50,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1366818142, now seen corresponding path program 31 times [2018-02-04 15:12:50,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:50,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:51,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:51,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 15:12:51,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:51,358 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 15:12:51,358 INFO L182 omatonBuilderFactory]: Interpolants [12672#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 12673#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 12674#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 98) ~n)), 12675#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 12676#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 388) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 12638#true, 12639#false, 12640#(<= 128 ~n), 12641#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 12642#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12643#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12644#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12645#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 12646#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 12647#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 12648#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 12649#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 12650#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 12651#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12652#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 12653#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12654#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12655#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12656#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12657#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12658#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 12659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 12660#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 12661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 12662#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12663#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 12664#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12665#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 12667#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 12668#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12669#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12670#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 12671#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n))] [2018-02-04 15:12:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:51,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 15:12:51,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 15:12:51,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=935, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:12:51,359 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 39 states. [2018-02-04 15:12:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:52,464 INFO L93 Difference]: Finished difference Result 425 states and 458 transitions. [2018-02-04 15:12:52,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 15:12:52,464 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 141 [2018-02-04 15:12:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:52,465 INFO L225 Difference]: With dead ends: 425 [2018-02-04 15:12:52,465 INFO L226 Difference]: Without dead ends: 425 [2018-02-04 15:12:52,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1698, Invalid=3272, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 15:12:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-02-04 15:12:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 172. [2018-02-04 15:12:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 15:12:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-02-04 15:12:52,468 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 141 [2018-02-04 15:12:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:52,468 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-02-04 15:12:52,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 15:12:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-02-04 15:12:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 15:12:52,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:52,468 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:52,468 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1337373387, now seen corresponding path program 32 times [2018-02-04 15:12:52,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:52,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:53,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:53,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 15:12:53,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:53,311 INFO L182 omatonBuilderFactory]: Interpolants [13376#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 13377#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 384) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 13338#true, 13339#false, 13340#(<= 128 ~n), 13341#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 13342#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13343#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13344#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13345#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 13346#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 13347#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 13348#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 13349#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 13350#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 13351#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13352#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 13353#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13354#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13355#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13356#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13357#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13358#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13359#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 13360#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 13361#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 13362#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13363#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 13364#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13365#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13366#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 13367#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 13368#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13369#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13370#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 13371#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 13372#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 13373#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 13374#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 13375#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:53,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 15:12:53,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 15:12:53,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=980, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 15:12:53,312 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 40 states. [2018-02-04 15:12:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:54,571 INFO L93 Difference]: Finished difference Result 437 states and 471 transitions. [2018-02-04 15:12:54,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 15:12:54,571 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 145 [2018-02-04 15:12:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:54,572 INFO L225 Difference]: With dead ends: 437 [2018-02-04 15:12:54,572 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 15:12:54,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1800, Invalid=3456, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 15:12:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 15:12:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 176. [2018-02-04 15:12:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 15:12:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-02-04 15:12:54,575 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 145 [2018-02-04 15:12:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:54,575 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-02-04 15:12:54,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 15:12:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-02-04 15:12:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 15:12:54,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:54,575 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:54,576 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1548691060, now seen corresponding path program 33 times [2018-02-04 15:12:54,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:54,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:55,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:55,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 15:12:55,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:55,406 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 15:12:55,406 INFO L182 omatonBuilderFactory]: Interpolants [14080#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 14081#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14082#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 14083#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14084#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14085#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 14086#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 14087#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14088#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14089#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14090#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 14091#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 14092#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 14093#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14094#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14095#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 14096#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14097#(and (<= (+ (* 4 foo_~i~0) 380) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14057#true, 14058#false, 14059#(<= 128 ~n), 14060#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 14061#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14062#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14063#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14064#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 14065#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 14066#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 14067#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 14068#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 14069#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 14070#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14071#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 14072#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14073#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14074#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14075#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14076#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14077#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14078#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 14079#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n))] [2018-02-04 15:12:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:55,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 15:12:55,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 15:12:55,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1026, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 15:12:55,407 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 41 states. [2018-02-04 15:12:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:56,691 INFO L93 Difference]: Finished difference Result 449 states and 484 transitions. [2018-02-04 15:12:56,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 15:12:56,691 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 149 [2018-02-04 15:12:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:56,692 INFO L225 Difference]: With dead ends: 449 [2018-02-04 15:12:56,692 INFO L226 Difference]: Without dead ends: 449 [2018-02-04 15:12:56,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1905, Invalid=3645, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 15:12:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-04 15:12:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 180. [2018-02-04 15:12:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 15:12:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-02-04 15:12:56,695 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 149 [2018-02-04 15:12:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:56,695 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-02-04 15:12:56,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 15:12:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-02-04 15:12:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-04 15:12:56,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:56,696 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:56,696 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1161585251, now seen corresponding path program 34 times [2018-02-04 15:12:56,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:56,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:12:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:57,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:12:57,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 15:12:57,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:12:57,786 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 15:12:57,786 INFO L182 omatonBuilderFactory]: Interpolants [14795#true, 14796#false, 14797#(<= 128 ~n), 14798#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 14799#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14800#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14801#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14802#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 14803#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 14804#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 14805#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 14806#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 14807#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 14808#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14809#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 14810#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14811#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14812#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14813#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14814#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14815#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14816#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 14817#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 14818#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 14819#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14820#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 14821#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14822#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14823#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 14824#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 14825#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14826#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14827#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14828#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 14829#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 14830#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 14831#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14832#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 14833#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 14834#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 14835#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 14836#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 376) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:12:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:12:57,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 15:12:57,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 15:12:57,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1073, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 15:12:57,787 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 42 states. [2018-02-04 15:12:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:12:59,159 INFO L93 Difference]: Finished difference Result 461 states and 497 transitions. [2018-02-04 15:12:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 15:12:59,159 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 153 [2018-02-04 15:12:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:12:59,161 INFO L225 Difference]: With dead ends: 461 [2018-02-04 15:12:59,161 INFO L226 Difference]: Without dead ends: 461 [2018-02-04 15:12:59,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2013, Invalid=3839, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 15:12:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-04 15:12:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 184. [2018-02-04 15:12:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 15:12:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-02-04 15:12:59,164 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 153 [2018-02-04 15:12:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:12:59,164 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-02-04 15:12:59,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 15:12:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-02-04 15:12:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 15:12:59,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:12:59,165 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:12:59,165 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:12:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1315330118, now seen corresponding path program 35 times [2018-02-04 15:12:59,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:12:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:12:59,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:00,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:00,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 15:13:00,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:00,186 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 15:13:00,186 INFO L182 omatonBuilderFactory]: Interpolants [15552#true, 15553#false, 15554#(<= 128 ~n), 15555#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 15556#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15557#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15558#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15559#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 15560#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 15561#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 15562#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 15563#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 15564#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 15565#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15566#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 15567#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15568#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15569#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15570#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15571#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15572#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15573#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 15574#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 15575#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 15576#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15577#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 15578#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15579#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15580#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 15581#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 15582#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15583#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15584#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15585#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 15586#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 15587#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 15588#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15589#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 15590#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 15591#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 15592#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 15593#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 15594#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 372) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:00,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 15:13:00,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 15:13:00,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=1121, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 15:13:00,187 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 43 states. [2018-02-04 15:13:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:01,607 INFO L93 Difference]: Finished difference Result 473 states and 510 transitions. [2018-02-04 15:13:01,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 15:13:01,607 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 157 [2018-02-04 15:13:01,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:01,608 INFO L225 Difference]: With dead ends: 473 [2018-02-04 15:13:01,608 INFO L226 Difference]: Without dead ends: 473 [2018-02-04 15:13:01,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2124, Invalid=4038, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 15:13:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-04 15:13:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 188. [2018-02-04 15:13:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 15:13:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-04 15:13:01,611 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 157 [2018-02-04 15:13:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:01,611 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-04 15:13:01,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 15:13:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-04 15:13:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-02-04 15:13:01,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:01,612 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:01,612 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:01,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2023123345, now seen corresponding path program 36 times [2018-02-04 15:13:01,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:01,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:02,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:02,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 15:13:02,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:02,854 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 15:13:02,855 INFO L182 omatonBuilderFactory]: Interpolants [16328#true, 16329#false, 16330#(<= 128 ~n), 16331#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 16332#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16333#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16334#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16335#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 16336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 16337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 16338#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 16339#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 16340#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 16341#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16342#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 16343#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16344#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16345#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16346#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16347#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16348#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16349#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 16350#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 16351#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 16352#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16353#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 16354#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16355#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16356#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 16357#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 16358#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16359#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16360#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16361#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 16362#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 16363#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 16364#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16365#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16366#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 16367#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 16368#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 16369#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 16370#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 16371#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 368) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:02,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 15:13:02,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 15:13:02,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=1170, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 15:13:02,856 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 44 states. [2018-02-04 15:13:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:04,459 INFO L93 Difference]: Finished difference Result 485 states and 523 transitions. [2018-02-04 15:13:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 15:13:04,459 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 161 [2018-02-04 15:13:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:04,461 INFO L225 Difference]: With dead ends: 485 [2018-02-04 15:13:04,461 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 15:13:04,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2238, Invalid=4242, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 15:13:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 15:13:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 192. [2018-02-04 15:13:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 15:13:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-02-04 15:13:04,465 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 161 [2018-02-04 15:13:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:04,465 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-02-04 15:13:04,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 15:13:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-02-04 15:13:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-04 15:13:04,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:04,466 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:04,467 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 220227560, now seen corresponding path program 37 times [2018-02-04 15:13:04,467 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:04,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:05,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:05,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 15:13:05,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:05,453 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 15:13:05,454 INFO L182 omatonBuilderFactory]: Interpolants [17152#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 17153#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17154#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17155#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17156#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 17157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 17158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 17159#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17160#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17161#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 17163#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17164#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17165#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 17166#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 17167#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 364) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 17123#true, 17124#false, 17125#(<= 128 ~n), 17126#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 17127#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17128#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17129#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17130#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 17131#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 17132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 17133#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 17134#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 17135#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 17136#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17137#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 17138#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17139#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17140#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17141#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17142#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17143#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17144#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 17145#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 17146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 17147#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17148#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 17149#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17150#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n))] [2018-02-04 15:13:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:05,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 15:13:05,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 15:13:05,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=1220, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 15:13:05,454 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 45 states. [2018-02-04 15:13:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:06,874 INFO L93 Difference]: Finished difference Result 497 states and 536 transitions. [2018-02-04 15:13:06,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 15:13:06,874 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 165 [2018-02-04 15:13:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:06,875 INFO L225 Difference]: With dead ends: 497 [2018-02-04 15:13:06,875 INFO L226 Difference]: Without dead ends: 497 [2018-02-04 15:13:06,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2355, Invalid=4451, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 15:13:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-02-04 15:13:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 196. [2018-02-04 15:13:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 15:13:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-02-04 15:13:06,877 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 165 [2018-02-04 15:13:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:06,878 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-02-04 15:13:06,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 15:13:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-02-04 15:13:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 15:13:06,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:06,878 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:06,878 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:06,878 INFO L82 PathProgramCache]: Analyzing trace with hash 893739711, now seen corresponding path program 38 times [2018-02-04 15:13:06,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:06,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:07,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:07,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 15:13:07,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:07,972 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 15:13:07,972 INFO L182 omatonBuilderFactory]: Interpolants [17937#true, 17938#false, 17939#(<= 128 ~n), 17940#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 17941#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17942#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17943#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17944#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 17945#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 17946#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 17947#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 17948#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 17949#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 17950#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17951#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 17952#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17953#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17954#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17955#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17956#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17957#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17958#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 17959#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 17960#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 17961#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17962#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 17963#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17964#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17965#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 17966#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 17967#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17968#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17969#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17970#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 17971#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 17972#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 17973#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17974#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17975#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 17976#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 17977#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17978#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17979#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 17980#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 17981#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 17982#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 360) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:07,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 15:13:07,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 15:13:07,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=1271, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 15:13:07,973 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 46 states. [2018-02-04 15:13:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:09,570 INFO L93 Difference]: Finished difference Result 509 states and 549 transitions. [2018-02-04 15:13:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 15:13:09,570 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 169 [2018-02-04 15:13:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:09,571 INFO L225 Difference]: With dead ends: 509 [2018-02-04 15:13:09,571 INFO L226 Difference]: Without dead ends: 509 [2018-02-04 15:13:09,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2475, Invalid=4665, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 15:13:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-04 15:13:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 200. [2018-02-04 15:13:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 15:13:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-02-04 15:13:09,573 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 169 [2018-02-04 15:13:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:09,574 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-02-04 15:13:09,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 15:13:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-02-04 15:13:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 15:13:09,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:09,575 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:09,575 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2050169366, now seen corresponding path program 39 times [2018-02-04 15:13:09,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:09,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:10,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:10,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 15:13:10,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:10,697 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 15:13:10,698 INFO L182 omatonBuilderFactory]: Interpolants [18816#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 356) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 18770#true, 18771#false, 18772#(<= 128 ~n), 18773#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 18774#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18775#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18776#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18777#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 18778#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 18779#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 18780#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 18781#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 18782#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 18783#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18784#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 18785#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18786#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18787#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18788#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18789#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18790#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18791#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 18792#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 18793#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 18794#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18795#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 18796#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18797#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18798#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 18799#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 18800#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18801#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18802#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18803#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 18804#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 18805#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 18806#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18807#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18808#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 18809#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 18810#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18811#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18812#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 18813#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 18814#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 18815#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:10,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 15:13:10,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 15:13:10,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=1323, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 15:13:10,699 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 47 states. [2018-02-04 15:13:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:12,383 INFO L93 Difference]: Finished difference Result 521 states and 562 transitions. [2018-02-04 15:13:12,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 15:13:12,383 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 173 [2018-02-04 15:13:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:12,384 INFO L225 Difference]: With dead ends: 521 [2018-02-04 15:13:12,385 INFO L226 Difference]: Without dead ends: 521 [2018-02-04 15:13:12,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2598, Invalid=4884, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 15:13:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-04 15:13:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 204. [2018-02-04 15:13:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 15:13:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2018-02-04 15:13:12,387 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 173 [2018-02-04 15:13:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:12,387 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2018-02-04 15:13:12,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 15:13:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2018-02-04 15:13:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 15:13:12,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:12,388 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:12,388 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1741206035, now seen corresponding path program 40 times [2018-02-04 15:13:12,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:12,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:13,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:13,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 15:13:13,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:13,533 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 15:13:13,534 INFO L182 omatonBuilderFactory]: Interpolants [19648#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19649#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19650#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 19651#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 19652#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19653#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19654#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19655#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 19656#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 19657#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 19658#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19659#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19660#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 19662#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19663#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19664#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19665#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 19666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 19667#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 19668#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 19669#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 352) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 19622#true, 19623#false, 19624#(<= 128 ~n), 19625#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 19626#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19627#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19628#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19629#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 19630#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 19631#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 19632#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 19633#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 19634#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 19635#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19636#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 19637#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19638#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19639#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19640#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19641#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19642#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 19643#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 19644#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 19645#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 19646#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 19647#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n))] [2018-02-04 15:13:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:13,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 15:13:13,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 15:13:13,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=880, Invalid=1376, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 15:13:13,534 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 48 states. [2018-02-04 15:13:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:15,167 INFO L93 Difference]: Finished difference Result 533 states and 575 transitions. [2018-02-04 15:13:15,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 15:13:15,167 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 177 [2018-02-04 15:13:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:15,168 INFO L225 Difference]: With dead ends: 533 [2018-02-04 15:13:15,168 INFO L226 Difference]: Without dead ends: 533 [2018-02-04 15:13:15,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2724, Invalid=5108, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 15:13:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-04 15:13:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 208. [2018-02-04 15:13:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 15:13:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2018-02-04 15:13:15,172 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 177 [2018-02-04 15:13:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:15,172 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2018-02-04 15:13:15,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 15:13:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2018-02-04 15:13:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-02-04 15:13:15,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:15,173 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:15,173 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash -289423804, now seen corresponding path program 41 times [2018-02-04 15:13:15,174 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:15,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:16,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:16,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 15:13:16,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:16,466 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 15:13:16,466 INFO L182 omatonBuilderFactory]: Interpolants [20493#true, 20494#false, 20495#(<= 128 ~n), 20496#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 20497#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20498#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20499#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20500#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 20501#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 20502#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 20503#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 20504#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 20505#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 20506#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20507#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 20508#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20509#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20510#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20511#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20512#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20513#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20514#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 20515#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 20516#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 20517#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20518#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 20519#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20520#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20521#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 20522#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 20523#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20524#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20525#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20526#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 20527#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 20528#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 20529#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20530#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20531#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 20532#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 20533#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20534#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20535#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 20536#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 20537#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 20538#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 20539#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 20540#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 20541#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 348) (select |#length| ~a.base)))] [2018-02-04 15:13:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:16,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 15:13:16,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 15:13:16,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 15:13:16,466 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 49 states. [2018-02-04 15:13:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:18,259 INFO L93 Difference]: Finished difference Result 545 states and 588 transitions. [2018-02-04 15:13:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 15:13:18,259 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 181 [2018-02-04 15:13:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:18,260 INFO L225 Difference]: With dead ends: 545 [2018-02-04 15:13:18,260 INFO L226 Difference]: Without dead ends: 545 [2018-02-04 15:13:18,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2853, Invalid=5337, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 15:13:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-02-04 15:13:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 212. [2018-02-04 15:13:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 15:13:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2018-02-04 15:13:18,263 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 181 [2018-02-04 15:13:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:18,263 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2018-02-04 15:13:18,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 15:13:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-02-04 15:13:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 15:13:18,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:18,264 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:18,264 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:18,264 INFO L82 PathProgramCache]: Analyzing trace with hash -262526181, now seen corresponding path program 42 times [2018-02-04 15:13:18,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:18,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:19,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:19,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 15:13:19,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:19,531 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 15:13:19,531 INFO L182 omatonBuilderFactory]: Interpolants [21383#true, 21384#false, 21385#(<= 128 ~n), 21386#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 21387#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21388#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21389#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21390#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 21391#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 21392#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 21393#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 21394#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 21395#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 21396#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21397#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 21398#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21399#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21400#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21401#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21402#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21403#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21404#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 21405#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 21406#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 21407#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21408#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 21409#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21410#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21411#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 21412#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 21413#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21414#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21415#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21416#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 21417#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 21418#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 21419#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21420#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21421#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 21422#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 21423#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21424#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21425#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 21426#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 21427#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 21428#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 21429#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 21430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 21431#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 21432#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 344) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:19,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 15:13:19,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 15:13:19,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=1485, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 15:13:19,532 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 50 states. [2018-02-04 15:13:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:21,352 INFO L93 Difference]: Finished difference Result 557 states and 601 transitions. [2018-02-04 15:13:21,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 15:13:21,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 185 [2018-02-04 15:13:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:21,353 INFO L225 Difference]: With dead ends: 557 [2018-02-04 15:13:21,353 INFO L226 Difference]: Without dead ends: 557 [2018-02-04 15:13:21,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2985, Invalid=5571, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 15:13:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-04 15:13:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 216. [2018-02-04 15:13:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 15:13:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-02-04 15:13:21,356 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 185 [2018-02-04 15:13:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:21,356 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-02-04 15:13:21,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 15:13:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-02-04 15:13:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 15:13:21,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:21,357 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:21,358 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1833675662, now seen corresponding path program 43 times [2018-02-04 15:13:21,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:21,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:22,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:22,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 15:13:22,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:22,615 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 15:13:22,615 INFO L182 omatonBuilderFactory]: Interpolants [22292#true, 22293#false, 22294#(<= 128 ~n), 22295#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 22296#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22297#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22298#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 22300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 22301#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 22302#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 22303#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 22304#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 22305#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22306#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 22307#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22308#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22309#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22310#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22311#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22312#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22313#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 22314#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 22315#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 22316#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22317#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 22318#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22319#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22320#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 22321#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 22322#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22323#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22324#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22325#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 22326#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 22327#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 22328#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22329#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22330#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 22331#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 22332#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22333#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22334#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22335#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 22336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 22337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 22338#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 22339#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 22340#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 22341#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 22342#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 340) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:22,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 15:13:22,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 15:13:22,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1009, Invalid=1541, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 15:13:22,615 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 51 states. [2018-02-04 15:13:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:24,494 INFO L93 Difference]: Finished difference Result 569 states and 614 transitions. [2018-02-04 15:13:24,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 15:13:24,494 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 189 [2018-02-04 15:13:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:24,495 INFO L225 Difference]: With dead ends: 569 [2018-02-04 15:13:24,495 INFO L226 Difference]: Without dead ends: 569 [2018-02-04 15:13:24,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3120, Invalid=5810, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 15:13:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-02-04 15:13:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 220. [2018-02-04 15:13:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 15:13:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-02-04 15:13:24,498 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 189 [2018-02-04 15:13:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:24,498 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-02-04 15:13:24,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 15:13:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-02-04 15:13:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 15:13:24,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:24,499 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:24,499 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1097074103, now seen corresponding path program 44 times [2018-02-04 15:13:24,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:24,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:25,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:25,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 15:13:25,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:25,958 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 15:13:25,958 INFO L182 omatonBuilderFactory]: Interpolants [23220#true, 23221#false, 23222#(<= 128 ~n), 23223#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 23224#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23225#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23226#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23227#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 23228#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 23229#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 23230#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 23231#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 23232#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 23233#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23234#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 23235#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23236#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23237#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23238#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23239#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23240#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23241#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 23242#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 23243#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 23244#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23245#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 23246#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23247#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23248#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 23249#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 23250#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23251#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23252#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23253#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 23254#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 23255#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 23256#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23257#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23258#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 23259#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 23260#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23261#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23262#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23263#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 23264#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 23265#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 23266#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 23267#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23268#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 23269#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 23270#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 23271#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 336) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:25,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 15:13:25,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 15:13:25,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1054, Invalid=1598, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 15:13:25,959 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 52 states. [2018-02-04 15:13:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:27,877 INFO L93 Difference]: Finished difference Result 581 states and 627 transitions. [2018-02-04 15:13:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 15:13:27,878 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 193 [2018-02-04 15:13:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:27,879 INFO L225 Difference]: With dead ends: 581 [2018-02-04 15:13:27,879 INFO L226 Difference]: Without dead ends: 581 [2018-02-04 15:13:27,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3258, Invalid=6054, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 15:13:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-02-04 15:13:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 224. [2018-02-04 15:13:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-04 15:13:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2018-02-04 15:13:27,882 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 193 [2018-02-04 15:13:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:27,882 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2018-02-04 15:13:27,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 15:13:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2018-02-04 15:13:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 15:13:27,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:27,883 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:27,883 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1073816416, now seen corresponding path program 45 times [2018-02-04 15:13:27,883 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:27,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:29,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:29,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 15:13:29,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:29,243 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 15:13:29,243 INFO L182 omatonBuilderFactory]: Interpolants [24192#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 24193#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24194#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24195#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 24196#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 24197#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24198#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24199#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 24201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 24202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 24203#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24204#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24205#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 24207#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24208#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24209#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24210#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 24211#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 24212#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 24213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 24214#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24215#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 24217#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 24218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 24219#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 332) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 24167#true, 24168#false, 24169#(<= 128 ~n), 24170#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 24171#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24172#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24173#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24174#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 24175#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 24176#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 24177#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 24178#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 24179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 24180#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24181#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 24182#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24183#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24184#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 24185#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24186#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24187#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 24188#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 24189#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 24190#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 24191#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:13:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:29,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 15:13:29,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 15:13:29,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1100, Invalid=1656, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 15:13:29,244 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 53 states. [2018-02-04 15:13:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:31,177 INFO L93 Difference]: Finished difference Result 593 states and 640 transitions. [2018-02-04 15:13:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 15:13:31,177 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 197 [2018-02-04 15:13:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:31,178 INFO L225 Difference]: With dead ends: 593 [2018-02-04 15:13:31,178 INFO L226 Difference]: Without dead ends: 593 [2018-02-04 15:13:31,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3399, Invalid=6303, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 15:13:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-04 15:13:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 228. [2018-02-04 15:13:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 15:13:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 230 transitions. [2018-02-04 15:13:31,182 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 230 transitions. Word has length 197 [2018-02-04 15:13:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:31,182 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 230 transitions. [2018-02-04 15:13:31,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 15:13:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 230 transitions. [2018-02-04 15:13:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 15:13:31,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:31,183 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:31,183 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1242907785, now seen corresponding path program 46 times [2018-02-04 15:13:31,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:31,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:32,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:32,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 15:13:32,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:32,665 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 15:13:32,665 INFO L182 omatonBuilderFactory]: Interpolants [25133#true, 25134#false, 25135#(<= 128 ~n), 25136#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 25137#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25138#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25139#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25140#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 25141#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 25142#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 25143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 25144#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 25145#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 25146#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 25148#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25149#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25150#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25151#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25152#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25153#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25154#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 25155#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 25156#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 25157#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 25159#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25160#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 25162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 25163#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25164#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25165#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25166#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 25167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 25168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 25169#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25170#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25171#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 25172#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 25173#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25174#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25175#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25176#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 25177#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 25178#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 25179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 25180#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25181#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 25182#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 25183#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 25184#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 25185#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 82) ~n)), 25186#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 328) (select |#length| ~a.base)))] [2018-02-04 15:13:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:32,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 15:13:32,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 15:13:32,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=1715, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 15:13:32,666 INFO L87 Difference]: Start difference. First operand 228 states and 230 transitions. Second operand 54 states. [2018-02-04 15:13:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:34,772 INFO L93 Difference]: Finished difference Result 605 states and 653 transitions. [2018-02-04 15:13:34,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 15:13:34,772 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 201 [2018-02-04 15:13:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:34,773 INFO L225 Difference]: With dead ends: 605 [2018-02-04 15:13:34,774 INFO L226 Difference]: Without dead ends: 605 [2018-02-04 15:13:34,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3543, Invalid=6557, Unknown=0, NotChecked=0, Total=10100 [2018-02-04 15:13:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-04 15:13:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 232. [2018-02-04 15:13:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 15:13:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2018-02-04 15:13:34,777 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 201 [2018-02-04 15:13:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:34,777 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2018-02-04 15:13:34,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 15:13:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2018-02-04 15:13:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-02-04 15:13:34,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:34,778 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:34,778 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash 42817230, now seen corresponding path program 47 times [2018-02-04 15:13:34,779 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:34,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:36,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:36,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 15:13:36,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:36,254 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 15:13:36,255 INFO L182 omatonBuilderFactory]: Interpolants [26118#true, 26119#false, 26120#(<= 128 ~n), 26121#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 26122#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26123#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26124#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26125#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 26126#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 26127#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 26128#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 26129#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 26130#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 26131#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 26133#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26134#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26135#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26136#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26137#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26138#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26139#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 26140#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 26141#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 26142#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 26144#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26145#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 26147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 26148#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26149#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26150#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 26152#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 26153#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 26154#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26155#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26156#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 26157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 26158#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26159#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26160#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 26162#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 26163#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 26164#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 26165#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26166#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 26167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 26168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 26169#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 26170#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 82) ~n)), 26171#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 81) ~n)), 26172#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 324) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:36,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 15:13:36,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 15:13:36,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=1775, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 15:13:36,256 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 55 states. [2018-02-04 15:13:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:38,419 INFO L93 Difference]: Finished difference Result 617 states and 666 transitions. [2018-02-04 15:13:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 15:13:38,436 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 205 [2018-02-04 15:13:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:38,437 INFO L225 Difference]: With dead ends: 617 [2018-02-04 15:13:38,438 INFO L226 Difference]: Without dead ends: 617 [2018-02-04 15:13:38,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3690, Invalid=6816, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 15:13:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-02-04 15:13:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 236. [2018-02-04 15:13:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 15:13:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-02-04 15:13:38,441 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 205 [2018-02-04 15:13:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:38,442 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-02-04 15:13:38,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 15:13:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-02-04 15:13:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 15:13:38,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:38,444 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:38,444 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1154191707, now seen corresponding path program 48 times [2018-02-04 15:13:38,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:38,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:40,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:40,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 15:13:40,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:40,059 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 15:13:40,059 INFO L182 omatonBuilderFactory]: Interpolants [27136#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 27137#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27138#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27139#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27140#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27141#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27142#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 27144#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 27145#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 27146#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 27148#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27149#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27150#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 27151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 27152#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27153#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27154#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27155#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 27156#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 27157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 27158#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27159#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27160#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 27162#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27163#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27164#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27165#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 27166#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 27167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 27168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 27169#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27170#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27171#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 27172#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 27173#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 27174#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 27175#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 81) ~n)), 27176#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 27177#(and (<= (+ (* 4 foo_~i~0) 320) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 27122#true, 27123#false, 27124#(<= 128 ~n), 27125#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 27126#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27127#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 27128#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 27129#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 27130#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 27131#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 27132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 27133#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 27134#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 27135#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:13:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:40,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 15:13:40,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 15:13:40,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1244, Invalid=1836, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 15:13:40,060 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 56 states. [2018-02-04 15:13:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:42,248 INFO L93 Difference]: Finished difference Result 629 states and 679 transitions. [2018-02-04 15:13:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 15:13:42,249 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 209 [2018-02-04 15:13:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:42,250 INFO L225 Difference]: With dead ends: 629 [2018-02-04 15:13:42,250 INFO L226 Difference]: Without dead ends: 629 [2018-02-04 15:13:42,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3840, Invalid=7080, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 15:13:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-02-04 15:13:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 240. [2018-02-04 15:13:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 15:13:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2018-02-04 15:13:42,254 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 209 [2018-02-04 15:13:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:42,254 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2018-02-04 15:13:42,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 15:13:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2018-02-04 15:13:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 15:13:42,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:42,256 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:42,256 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:42,256 INFO L82 PathProgramCache]: Analyzing trace with hash 407749372, now seen corresponding path program 49 times [2018-02-04 15:13:42,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:42,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:43,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:43,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 15:13:43,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:43,885 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 15:13:43,885 INFO L182 omatonBuilderFactory]: Interpolants [28160#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28161#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28162#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28163#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28164#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28165#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28166#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 28167#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 28168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 28169#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28170#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 28171#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28172#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28173#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 28174#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 28175#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28176#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28177#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28178#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 28179#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 28180#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 28181#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28182#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28183#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28184#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 28185#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28186#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28187#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28188#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 28189#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 28190#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 28191#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 28192#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28193#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28194#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 28195#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 28196#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 28197#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 28198#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28199#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 28200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 28201#(and (<= (+ (* 4 foo_~i~0) 316) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 28145#true, 28146#false, 28147#(<= 128 ~n), 28148#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 28149#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28150#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 28151#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28152#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 28153#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 28154#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 28155#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 28156#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 28157#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 28158#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 28159#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n))] [2018-02-04 15:13:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:43,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 15:13:43,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 15:13:43,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=1898, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 15:13:43,886 INFO L87 Difference]: Start difference. First operand 240 states and 242 transitions. Second operand 57 states. [2018-02-04 15:13:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:46,106 INFO L93 Difference]: Finished difference Result 641 states and 692 transitions. [2018-02-04 15:13:46,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 15:13:46,106 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 213 [2018-02-04 15:13:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:46,108 INFO L225 Difference]: With dead ends: 641 [2018-02-04 15:13:46,108 INFO L226 Difference]: Without dead ends: 641 [2018-02-04 15:13:46,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3993, Invalid=7349, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 15:13:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-02-04 15:13:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 244. [2018-02-04 15:13:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 15:13:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 246 transitions. [2018-02-04 15:13:46,111 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 246 transitions. Word has length 213 [2018-02-04 15:13:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:46,112 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 246 transitions. [2018-02-04 15:13:46,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 15:13:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 246 transitions. [2018-02-04 15:13:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 15:13:46,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:46,113 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:46,113 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash -446229549, now seen corresponding path program 50 times [2018-02-04 15:13:46,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:46,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:47,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:47,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 15:13:47,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:47,803 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 15:13:47,803 INFO L182 omatonBuilderFactory]: Interpolants [29187#true, 29188#false, 29189#(<= 128 ~n), 29190#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 29191#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29192#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29193#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29194#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 29195#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 29196#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 29197#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 29198#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 29199#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 29200#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 29202#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29203#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29204#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29205#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29206#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29207#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29208#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 29209#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 29210#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 29211#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29212#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 29213#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29214#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 29216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 29217#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29218#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29219#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29220#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 29221#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 29222#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 29223#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29224#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29225#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29226#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 29227#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29228#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29229#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29230#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 29231#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 29232#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 29233#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 29234#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29235#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 29236#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 29237#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 29238#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 29239#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 29240#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 29241#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 29242#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 29243#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 29244#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 312) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:47,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 15:13:47,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 15:13:47,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1345, Invalid=1961, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:13:47,804 INFO L87 Difference]: Start difference. First operand 244 states and 246 transitions. Second operand 58 states. [2018-02-04 15:13:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:50,174 INFO L93 Difference]: Finished difference Result 653 states and 705 transitions. [2018-02-04 15:13:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 15:13:50,174 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 217 [2018-02-04 15:13:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:50,175 INFO L225 Difference]: With dead ends: 653 [2018-02-04 15:13:50,175 INFO L226 Difference]: Without dead ends: 653 [2018-02-04 15:13:50,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4149, Invalid=7623, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 15:13:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-02-04 15:13:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 248. [2018-02-04 15:13:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 15:13:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2018-02-04 15:13:50,178 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 217 [2018-02-04 15:13:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:50,178 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2018-02-04 15:13:50,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 15:13:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2018-02-04 15:13:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-02-04 15:13:50,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:50,179 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:50,179 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash -248635094, now seen corresponding path program 51 times [2018-02-04 15:13:50,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:50,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:51,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:51,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 15:13:51,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:51,907 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 15:13:51,908 INFO L182 omatonBuilderFactory]: Interpolants [30248#true, 30249#false, 30250#(<= 128 ~n), 30251#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 30252#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30253#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30254#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30255#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 30256#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 30257#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 30258#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 30259#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 30260#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 30261#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30262#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 30263#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30264#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30265#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30266#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30267#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30268#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30269#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 30270#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 30271#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 30272#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30273#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 30274#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30275#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30276#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 30277#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 30278#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30279#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30280#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30281#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 30282#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 30283#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 30284#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30285#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30286#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30287#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 30288#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30289#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30290#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30291#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 30292#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 30293#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 30294#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 30295#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30296#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30297#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 30298#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 30299#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 30300#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 30301#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 30302#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 30303#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 30304#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 30305#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 30306#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 308) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:13:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:51,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 15:13:51,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 15:13:51,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2025, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 15:13:51,908 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 59 states. [2018-02-04 15:13:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:54,323 INFO L93 Difference]: Finished difference Result 665 states and 718 transitions. [2018-02-04 15:13:54,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 15:13:54,324 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 221 [2018-02-04 15:13:54,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:54,325 INFO L225 Difference]: With dead ends: 665 [2018-02-04 15:13:54,325 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 15:13:54,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4308, Invalid=7902, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 15:13:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 15:13:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 252. [2018-02-04 15:13:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-04 15:13:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2018-02-04 15:13:54,328 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 221 [2018-02-04 15:13:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:54,328 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2018-02-04 15:13:54,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 15:13:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2018-02-04 15:13:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-04 15:13:54,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:54,329 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:54,329 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2104535809, now seen corresponding path program 52 times [2018-02-04 15:13:54,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:54,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:13:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:56,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:13:56,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 15:13:56,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:13:56,068 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 15:13:56,068 INFO L182 omatonBuilderFactory]: Interpolants [31360#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31361#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 31362#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 31363#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 31364#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31365#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31366#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31367#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 31368#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31369#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31370#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31371#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 31372#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 31373#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 31374#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 31375#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31376#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31377#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 31378#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 31379#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 31380#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 31381#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31382#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 31383#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31384#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31385#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 31386#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 31387#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 304) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 31328#true, 31329#false, 31330#(<= 128 ~n), 31331#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 31332#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31333#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31334#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31335#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 31336#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 31337#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 31338#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 31339#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 31340#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 31341#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31342#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 31343#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31344#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31345#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31346#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31347#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31348#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 31349#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 31350#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 31351#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 31352#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31353#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 31354#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31355#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31356#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 31357#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 31358#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 31359#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:13:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:13:56,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 15:13:56,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 15:13:56,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1450, Invalid=2090, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 15:13:56,069 INFO L87 Difference]: Start difference. First operand 252 states and 254 transitions. Second operand 60 states. [2018-02-04 15:13:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:13:58,468 INFO L93 Difference]: Finished difference Result 677 states and 731 transitions. [2018-02-04 15:13:58,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 15:13:58,468 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 225 [2018-02-04 15:13:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:13:58,470 INFO L225 Difference]: With dead ends: 677 [2018-02-04 15:13:58,470 INFO L226 Difference]: Without dead ends: 677 [2018-02-04 15:13:58,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4470, Invalid=8186, Unknown=0, NotChecked=0, Total=12656 [2018-02-04 15:13:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-02-04 15:13:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 256. [2018-02-04 15:13:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 15:13:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 258 transitions. [2018-02-04 15:13:58,473 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 258 transitions. Word has length 225 [2018-02-04 15:13:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:13:58,473 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 258 transitions. [2018-02-04 15:13:58,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 15:13:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 258 transitions. [2018-02-04 15:13:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-02-04 15:13:58,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:13:58,474 INFO L351 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:13:58,474 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:13:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1357090472, now seen corresponding path program 53 times [2018-02-04 15:13:58,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:13:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:13:58,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:00,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:00,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 15:14:00,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:00,311 INFO L182 omatonBuilderFactory]: Interpolants [32427#true, 32428#false, 32429#(<= 128 ~n), 32430#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 32431#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32432#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32433#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32434#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 32435#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 32436#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 32437#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 32438#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 32439#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 32440#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32441#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 32442#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32443#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32444#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32445#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32446#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32447#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32448#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 32449#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 32450#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 32451#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32452#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 32453#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32454#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32455#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 32456#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 32457#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32458#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32459#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32460#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 32461#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 32462#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 32463#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32464#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32465#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32466#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 32467#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32468#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32469#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32470#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 32471#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 32472#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 32473#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 32474#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32475#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32476#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 32477#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 32478#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 32479#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 32480#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 32481#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 32482#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32483#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 32484#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 32485#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 32486#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 32487#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 300) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:14:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:00,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 15:14:00,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 15:14:00,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1504, Invalid=2156, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 15:14:00,312 INFO L87 Difference]: Start difference. First operand 256 states and 258 transitions. Second operand 61 states. [2018-02-04 15:14:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:03,336 INFO L93 Difference]: Finished difference Result 689 states and 744 transitions. [2018-02-04 15:14:03,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 15:14:03,336 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 229 [2018-02-04 15:14:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:03,337 INFO L225 Difference]: With dead ends: 689 [2018-02-04 15:14:03,337 INFO L226 Difference]: Without dead ends: 689 [2018-02-04 15:14:03,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4635, Invalid=8475, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 15:14:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-02-04 15:14:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 260. [2018-02-04 15:14:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 15:14:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 262 transitions. [2018-02-04 15:14:03,340 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 262 transitions. Word has length 229 [2018-02-04 15:14:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:03,341 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 262 transitions. [2018-02-04 15:14:03,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 15:14:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 262 transitions. [2018-02-04 15:14:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 15:14:03,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:03,341 INFO L351 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:03,341 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:03,341 INFO L82 PathProgramCache]: Analyzing trace with hash -29412305, now seen corresponding path program 54 times [2018-02-04 15:14:03,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:03,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:05,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:05,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 15:14:05,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:05,247 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 15:14:05,248 INFO L182 omatonBuilderFactory]: Interpolants [33545#true, 33546#false, 33547#(<= 128 ~n), 33548#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 33549#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33550#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33551#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33552#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 33553#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 33554#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 33555#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 33556#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 33557#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 33558#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33559#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 33560#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33561#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33562#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33563#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33564#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33565#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33566#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 33567#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 33568#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 33569#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33570#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 33571#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33572#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33573#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 33574#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 33575#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33576#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33577#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33578#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 33579#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 33580#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 33581#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33582#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33583#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33584#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 33585#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33586#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33587#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33588#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 33589#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 33590#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 33591#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 33592#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33593#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33594#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 33595#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 33596#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 33597#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 33598#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 33599#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 33600#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33601#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 33602#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 33603#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 33604#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 33605#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 33606#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 296) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:14:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:05,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 15:14:05,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 15:14:05,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=2223, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 15:14:05,248 INFO L87 Difference]: Start difference. First operand 260 states and 262 transitions. Second operand 62 states. [2018-02-04 15:14:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:08,050 INFO L93 Difference]: Finished difference Result 701 states and 757 transitions. [2018-02-04 15:14:08,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 15:14:08,050 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 233 [2018-02-04 15:14:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:08,051 INFO L225 Difference]: With dead ends: 701 [2018-02-04 15:14:08,052 INFO L226 Difference]: Without dead ends: 701 [2018-02-04 15:14:08,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4803, Invalid=8769, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 15:14:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-04 15:14:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 264. [2018-02-04 15:14:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 15:14:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 266 transitions. [2018-02-04 15:14:08,057 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 266 transitions. Word has length 233 [2018-02-04 15:14:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:08,057 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 266 transitions. [2018-02-04 15:14:08,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 15:14:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 266 transitions. [2018-02-04 15:14:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 15:14:08,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:08,058 INFO L351 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:08,058 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1509510266, now seen corresponding path program 55 times [2018-02-04 15:14:08,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:08,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:10,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:10,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 15:14:10,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:10,029 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 15:14:10,030 INFO L182 omatonBuilderFactory]: Interpolants [34688#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34689#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 34690#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 34691#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 34692#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 34693#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 34694#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 34695#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34696#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 34697#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34698#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34699#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34700#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34701#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34702#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34703#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 34704#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 34705#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 34706#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34707#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 34708#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34709#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34710#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 34711#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 34712#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34713#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34714#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34715#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 34716#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 34717#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 34718#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34719#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34720#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34721#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 34722#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34723#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34724#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34725#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 34726#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 34727#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 34728#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 34729#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34730#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34731#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 34732#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 34733#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 34734#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 34735#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34736#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 34737#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34738#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 34739#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 34740#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 34741#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 34742#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 34743#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 34744#(and (<= (+ (* 4 foo_~i~0) 292) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 34682#true, 34683#false, 34684#(<= 128 ~n), 34685#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 34686#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 34687#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:14:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:10,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 15:14:10,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 15:14:10,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1615, Invalid=2291, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 15:14:10,031 INFO L87 Difference]: Start difference. First operand 264 states and 266 transitions. Second operand 63 states. [2018-02-04 15:14:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:12,890 INFO L93 Difference]: Finished difference Result 713 states and 770 transitions. [2018-02-04 15:14:12,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 15:14:12,890 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 237 [2018-02-04 15:14:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:12,891 INFO L225 Difference]: With dead ends: 713 [2018-02-04 15:14:12,892 INFO L226 Difference]: Without dead ends: 713 [2018-02-04 15:14:12,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4974, Invalid=9068, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 15:14:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-02-04 15:14:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 268. [2018-02-04 15:14:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 15:14:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 270 transitions. [2018-02-04 15:14:12,895 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 270 transitions. Word has length 237 [2018-02-04 15:14:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:12,895 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 270 transitions. [2018-02-04 15:14:12,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 15:14:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 270 transitions. [2018-02-04 15:14:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-02-04 15:14:12,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:12,896 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:12,896 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:12,896 INFO L82 PathProgramCache]: Analyzing trace with hash 348172125, now seen corresponding path program 56 times [2018-02-04 15:14:12,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:12,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:14,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:14,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 15:14:14,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:14,975 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 15:14:14,975 INFO L182 omatonBuilderFactory]: Interpolants [35840#(<= 128 ~n), 35841#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 35842#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35843#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35844#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35845#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 35846#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 35847#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 35848#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 35849#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 35850#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 35851#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35852#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 35853#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35854#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35855#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35856#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35857#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35858#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35859#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 35860#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 35861#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 35862#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35863#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 35864#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35865#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35866#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 35867#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 35868#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35869#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35870#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35871#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 35872#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 35873#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 35874#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35875#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35876#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35877#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 35878#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35879#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35880#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35881#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 35882#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 35883#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 35884#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 35885#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35886#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35887#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 35888#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 35889#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 35890#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 35891#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35892#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 35893#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35894#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 35895#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 35896#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 35897#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 35898#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 35899#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 35900#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 72) ~n)), 35901#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 288) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 35838#true, 35839#false] [2018-02-04 15:14:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:14,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 15:14:14,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 15:14:14,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1672, Invalid=2360, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 15:14:14,976 INFO L87 Difference]: Start difference. First operand 268 states and 270 transitions. Second operand 64 states. [2018-02-04 15:14:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:17,871 INFO L93 Difference]: Finished difference Result 725 states and 783 transitions. [2018-02-04 15:14:17,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 15:14:17,871 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 241 [2018-02-04 15:14:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:17,872 INFO L225 Difference]: With dead ends: 725 [2018-02-04 15:14:17,872 INFO L226 Difference]: Without dead ends: 725 [2018-02-04 15:14:17,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5148, Invalid=9372, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 15:14:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-02-04 15:14:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 272. [2018-02-04 15:14:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 15:14:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 274 transitions. [2018-02-04 15:14:17,876 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 274 transitions. Word has length 241 [2018-02-04 15:14:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:17,876 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 274 transitions. [2018-02-04 15:14:17,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-02-04 15:14:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 274 transitions. [2018-02-04 15:14:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-02-04 15:14:17,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:17,877 INFO L351 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:17,877 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:17,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1541072820, now seen corresponding path program 57 times [2018-02-04 15:14:17,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:17,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:19,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:19,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-02-04 15:14:19,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:19,991 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 15:14:19,991 INFO L182 omatonBuilderFactory]: Interpolants [37013#true, 37014#false, 37015#(<= 128 ~n), 37016#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 37017#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37018#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37019#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37020#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 37021#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 37022#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 37023#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 37024#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 37025#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 37026#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37027#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 37028#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37029#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37030#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37031#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37032#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37033#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37034#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 37035#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 37036#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 37037#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37038#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 37039#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37040#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37041#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 37042#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 37043#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37044#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37045#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37046#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 37047#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 37048#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 37049#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37050#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37051#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37052#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 37053#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37054#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37055#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37056#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 37057#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 37058#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 37059#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 37060#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37061#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37062#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 37063#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 37064#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 37065#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 37066#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37067#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 37068#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37069#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 37070#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 37071#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 37072#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 37073#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 37074#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 37075#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 72) ~n)), 37076#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 37077#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 284) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:14:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:19,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 15:14:19,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 15:14:19,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1730, Invalid=2430, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 15:14:19,992 INFO L87 Difference]: Start difference. First operand 272 states and 274 transitions. Second operand 65 states. [2018-02-04 15:14:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:23,017 INFO L93 Difference]: Finished difference Result 737 states and 796 transitions. [2018-02-04 15:14:23,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 15:14:23,017 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 245 [2018-02-04 15:14:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:23,018 INFO L225 Difference]: With dead ends: 737 [2018-02-04 15:14:23,018 INFO L226 Difference]: Without dead ends: 737 [2018-02-04 15:14:23,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5325, Invalid=9681, Unknown=0, NotChecked=0, Total=15006 [2018-02-04 15:14:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-02-04 15:14:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 276. [2018-02-04 15:14:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 15:14:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2018-02-04 15:14:23,021 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 245 [2018-02-04 15:14:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:23,021 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2018-02-04 15:14:23,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 15:14:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2018-02-04 15:14:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 15:14:23,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:23,023 INFO L351 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:23,023 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1612505973, now seen corresponding path program 58 times [2018-02-04 15:14:23,023 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:23,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:25,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:25,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-02-04 15:14:25,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:25,238 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 15:14:25,238 INFO L182 omatonBuilderFactory]: Interpolants [38272#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 280) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 38207#true, 38208#false, 38209#(<= 128 ~n), 38210#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 38211#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38212#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38213#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38214#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 38215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 38216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 38217#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 38218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 38219#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 38220#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38221#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 38222#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38223#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38224#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38225#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38226#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38227#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38228#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 38229#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 38230#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 38231#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38232#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 38233#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38234#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38235#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 38236#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 38237#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38238#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38239#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38240#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 38241#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 38242#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 38243#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38244#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38245#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38246#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 38247#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38248#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38249#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38250#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 38251#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 38252#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 38253#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 38254#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38255#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38256#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 38257#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 38258#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 38259#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 38260#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38261#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 38262#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38263#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 38264#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 38265#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 38266#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 38267#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 38268#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 38269#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 38270#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 38271#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:14:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:25,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 15:14:25,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 15:14:25,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1789, Invalid=2501, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 15:14:25,239 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 66 states. [2018-02-04 15:14:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:28,430 INFO L93 Difference]: Finished difference Result 749 states and 809 transitions. [2018-02-04 15:14:28,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 15:14:28,430 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 249 [2018-02-04 15:14:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:28,431 INFO L225 Difference]: With dead ends: 749 [2018-02-04 15:14:28,432 INFO L226 Difference]: Without dead ends: 749 [2018-02-04 15:14:28,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5505, Invalid=9995, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 15:14:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-02-04 15:14:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 280. [2018-02-04 15:14:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-04 15:14:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 282 transitions. [2018-02-04 15:14:28,435 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 282 transitions. Word has length 249 [2018-02-04 15:14:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:28,435 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 282 transitions. [2018-02-04 15:14:28,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 15:14:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 282 transitions. [2018-02-04 15:14:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 15:14:28,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:28,436 INFO L351 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:28,436 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2004415006, now seen corresponding path program 59 times [2018-02-04 15:14:28,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:28,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:30,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:30,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 15:14:30,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:30,808 INFO L182 omatonBuilderFactory]: Interpolants [39424#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39425#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39426#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39427#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 39428#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 39429#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 39430#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 39431#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 39432#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 39433#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39434#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 39435#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39436#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39437#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39438#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39439#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39440#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39441#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 39442#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 39443#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 39444#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39445#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 39446#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39447#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39448#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 39449#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 39450#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39451#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39452#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39453#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 39454#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 39455#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 39456#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39457#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39458#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39459#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 39460#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39461#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39462#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39463#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 39464#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 39465#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 39466#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 39467#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39468#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39469#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 39470#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 39471#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 39472#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 39473#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39474#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 39475#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39476#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 39477#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 39478#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 39479#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 39480#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 39481#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 39482#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 39483#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 39484#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 39485#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 39486#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 276) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 39420#true, 39421#false, 39422#(<= 128 ~n), 39423#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|))] [2018-02-04 15:14:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:30,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 15:14:30,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 15:14:30,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1849, Invalid=2573, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:14:30,809 INFO L87 Difference]: Start difference. First operand 280 states and 282 transitions. Second operand 67 states. [2018-02-04 15:14:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:33,957 INFO L93 Difference]: Finished difference Result 761 states and 822 transitions. [2018-02-04 15:14:33,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 15:14:33,957 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 253 [2018-02-04 15:14:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:33,959 INFO L225 Difference]: With dead ends: 761 [2018-02-04 15:14:33,959 INFO L226 Difference]: Without dead ends: 761 [2018-02-04 15:14:33,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5688, Invalid=10314, Unknown=0, NotChecked=0, Total=16002 [2018-02-04 15:14:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-02-04 15:14:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 284. [2018-02-04 15:14:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 15:14:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 286 transitions. [2018-02-04 15:14:33,962 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 286 transitions. Word has length 253 [2018-02-04 15:14:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:33,962 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 286 transitions. [2018-02-04 15:14:33,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 15:14:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 286 transitions. [2018-02-04 15:14:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 15:14:33,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:33,963 INFO L351 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:33,963 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1332446279, now seen corresponding path program 60 times [2018-02-04 15:14:33,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:34,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:36,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:36,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-02-04 15:14:36,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:36,293 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 15:14:36,293 INFO L182 omatonBuilderFactory]: Interpolants [40704#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 40705#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40706#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 40707#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40708#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40709#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 40710#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 40711#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 40712#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40713#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 40714#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 40715#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 40716#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 40717#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 40718#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 40719#(and (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ (* 4 foo_~i~0) 272) (select |#length| ~a.base))), 40652#true, 40653#false, 40654#(<= 128 ~n), 40655#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 40656#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40657#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40658#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40659#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 40660#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 40661#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 40662#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 40663#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 40664#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 40665#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40666#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 40667#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40668#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40669#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40670#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40671#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40672#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40673#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 40674#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 40675#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 40676#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40677#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 40678#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40679#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40680#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 40681#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 40682#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40683#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40684#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40685#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 40686#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 40687#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 40688#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40689#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40690#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 40691#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 40692#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40693#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40694#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40695#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 40696#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 40697#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 40698#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 40699#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40700#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 40701#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 40702#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 40703#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n))] [2018-02-04 15:14:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:36,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 15:14:36,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 15:14:36,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1910, Invalid=2646, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 15:14:36,294 INFO L87 Difference]: Start difference. First operand 284 states and 286 transitions. Second operand 68 states. [2018-02-04 15:14:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:39,323 INFO L93 Difference]: Finished difference Result 773 states and 835 transitions. [2018-02-04 15:14:39,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 15:14:39,323 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 257 [2018-02-04 15:14:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:39,324 INFO L225 Difference]: With dead ends: 773 [2018-02-04 15:14:39,325 INFO L226 Difference]: Without dead ends: 773 [2018-02-04 15:14:39,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5874, Invalid=10638, Unknown=0, NotChecked=0, Total=16512 [2018-02-04 15:14:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-02-04 15:14:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 288. [2018-02-04 15:14:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 15:14:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 290 transitions. [2018-02-04 15:14:39,328 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 290 transitions. Word has length 257 [2018-02-04 15:14:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:39,328 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 290 transitions. [2018-02-04 15:14:39,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 15:14:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 290 transitions. [2018-02-04 15:14:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-02-04 15:14:39,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:39,330 INFO L351 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:39,330 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash 368649744, now seen corresponding path program 61 times [2018-02-04 15:14:39,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:39,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:41,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:41,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-02-04 15:14:41,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:41,682 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 15:14:41,682 INFO L182 omatonBuilderFactory]: Interpolants [41903#true, 41904#false, 41905#(<= 128 ~n), 41906#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 41907#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41908#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41909#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41910#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 41911#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 41912#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 41913#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 41914#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 41915#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 41916#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41917#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 41918#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41919#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41920#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41921#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41922#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41923#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41924#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 41925#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 41926#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 41927#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41928#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 41929#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41930#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41931#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 41932#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 41933#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41934#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41935#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41936#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 41937#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 41938#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 41939#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41940#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41941#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41942#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 41943#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41944#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41945#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41946#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 41947#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 41948#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 41949#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 41950#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41951#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41952#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 41953#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 41954#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 41955#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 41956#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41957#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 41958#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41959#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41960#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 41961#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 41962#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 41963#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 41964#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 41965#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 41966#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 41967#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 41968#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 41969#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 41970#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 41971#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 268) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:14:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:41,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 15:14:41,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 15:14:41,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1972, Invalid=2720, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 15:14:41,683 INFO L87 Difference]: Start difference. First operand 288 states and 290 transitions. Second operand 69 states. [2018-02-04 15:14:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:44,991 INFO L93 Difference]: Finished difference Result 785 states and 848 transitions. [2018-02-04 15:14:44,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 15:14:44,991 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 261 [2018-02-04 15:14:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:44,993 INFO L225 Difference]: With dead ends: 785 [2018-02-04 15:14:44,993 INFO L226 Difference]: Without dead ends: 785 [2018-02-04 15:14:44,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2265 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6063, Invalid=10967, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 15:14:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-02-04 15:14:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 292. [2018-02-04 15:14:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-04 15:14:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 294 transitions. [2018-02-04 15:14:44,996 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 294 transitions. Word has length 261 [2018-02-04 15:14:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:44,997 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 294 transitions. [2018-02-04 15:14:44,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 15:14:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 294 transitions. [2018-02-04 15:14:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-02-04 15:14:44,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:44,997 INFO L351 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:44,997 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1983722265, now seen corresponding path program 62 times [2018-02-04 15:14:44,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:45,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:47,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:47,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-02-04 15:14:47,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:47,399 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 15:14:47,399 INFO L182 omatonBuilderFactory]: Interpolants [43173#true, 43174#false, 43175#(<= 128 ~n), 43176#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 43177#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43178#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43179#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43180#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 43181#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 43182#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 43183#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 43184#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 43185#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 43186#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43187#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 43188#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43189#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43190#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43191#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43192#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43193#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43194#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 43195#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 43196#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 43197#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43198#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 43199#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43200#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 43202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 43203#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43204#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43205#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 43207#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 43208#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 43209#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43210#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43211#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43212#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 43213#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43214#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43215#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43216#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 43217#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 43218#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 43219#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 43220#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43221#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43222#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 43223#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 43224#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 43225#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 43226#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43227#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 43228#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43229#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43230#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 43231#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 43232#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 43233#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 43234#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 43235#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 43236#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 43237#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 43238#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 43239#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n)), 43240#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 43241#(and (<= (+ foo_~i~0 66) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 43242#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 264) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:14:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:47,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 15:14:47,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 15:14:47,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2035, Invalid=2795, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 15:14:47,400 INFO L87 Difference]: Start difference. First operand 292 states and 294 transitions. Second operand 70 states. [2018-02-04 15:14:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:50,698 INFO L93 Difference]: Finished difference Result 797 states and 861 transitions. [2018-02-04 15:14:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 15:14:50,698 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 265 [2018-02-04 15:14:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:50,700 INFO L225 Difference]: With dead ends: 797 [2018-02-04 15:14:50,700 INFO L226 Difference]: Without dead ends: 797 [2018-02-04 15:14:50,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6255, Invalid=11301, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 15:14:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-02-04 15:14:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 296. [2018-02-04 15:14:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 15:14:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 298 transitions. [2018-02-04 15:14:50,703 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 298 transitions. Word has length 265 [2018-02-04 15:14:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:50,703 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 298 transitions. [2018-02-04 15:14:50,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 15:14:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 298 transitions. [2018-02-04 15:14:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-02-04 15:14:50,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:50,704 INFO L351 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:50,704 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash 538914878, now seen corresponding path program 63 times [2018-02-04 15:14:50,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:50,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:53,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:53,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-02-04 15:14:53,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:53,184 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 15:14:53,184 INFO L182 omatonBuilderFactory]: Interpolants [44462#true, 44463#false, 44464#(<= 128 ~n), 44465#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 44466#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44467#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44468#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44469#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 44470#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 44471#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 44472#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 44473#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 44474#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 44475#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44476#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 44477#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44478#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44479#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44480#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44481#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44482#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44483#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 44484#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 44485#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 44486#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44487#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 44488#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44489#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44490#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 44491#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 44492#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44493#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44494#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44495#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 44496#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 44497#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 44498#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44499#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44500#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44501#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 44502#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44503#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44504#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44505#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 44506#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 44507#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 44508#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 44509#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44510#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44511#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 44512#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 44513#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 44514#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 44515#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44516#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 44517#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44518#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44519#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 44520#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 44521#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 44522#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 44523#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 44524#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 44525#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 44526#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 44527#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44528#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n)), 44529#(and (<= (+ foo_~i~0 66) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 44530#(and (<= (+ foo_~i~0 66) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 44531#(and (<= (+ foo_~i~0 65) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 44532#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 260) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:14:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:53,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 15:14:53,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 15:14:53,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2099, Invalid=2871, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 15:14:53,185 INFO L87 Difference]: Start difference. First operand 296 states and 298 transitions. Second operand 71 states. [2018-02-04 15:14:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:14:56,562 INFO L93 Difference]: Finished difference Result 809 states and 874 transitions. [2018-02-04 15:14:56,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 15:14:56,562 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 269 [2018-02-04 15:14:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:14:56,563 INFO L225 Difference]: With dead ends: 809 [2018-02-04 15:14:56,564 INFO L226 Difference]: Without dead ends: 809 [2018-02-04 15:14:56,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6450, Invalid=11640, Unknown=0, NotChecked=0, Total=18090 [2018-02-04 15:14:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-02-04 15:14:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 300. [2018-02-04 15:14:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-04 15:14:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 302 transitions. [2018-02-04 15:14:56,569 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 302 transitions. Word has length 269 [2018-02-04 15:14:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:14:56,569 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 302 transitions. [2018-02-04 15:14:56,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 15:14:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 302 transitions. [2018-02-04 15:14:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-04 15:14:56,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:14:56,571 INFO L351 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:14:56,571 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:14:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1604579307, now seen corresponding path program 64 times [2018-02-04 15:14:56,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:14:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:14:56,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:14:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:59,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:14:59,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-04 15:14:59,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:14:59,122 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 15:14:59,122 INFO L182 omatonBuilderFactory]: Interpolants [45824#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 45825#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45826#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45827#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 45828#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 45829#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 45830#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45831#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 45832#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 45833#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 45834#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 45835#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45836#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n)), 45837#(and (<= (+ foo_~i~0 66) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45838#(and (<= (+ foo_~i~0 65) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45839#(and (<= (+ foo_~i~0 65) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 45840#(and (= ~a.offset 0) (<= (+ foo_~i~0 64) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 45841#(and (<= (+ (* 4 foo_~i~0) 256) (select |#length| ~a.base)) (= ~a.offset 0) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 45770#true, 45771#false, 45772#(<= 128 ~n), 45773#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 45774#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45775#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45776#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45777#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 45778#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 45779#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 45780#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 45781#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 45782#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 45783#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45784#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 45785#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45786#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45787#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45788#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45789#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45790#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45791#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 45792#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 45793#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 45794#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45795#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 45796#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45797#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45798#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 45799#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 45800#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45801#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45802#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45803#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 45804#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 45805#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 45806#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45807#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45808#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 45809#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 45810#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45811#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45812#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45813#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 45814#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 45815#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 45816#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 45817#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45818#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 45819#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 45820#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 45821#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 45822#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 45823#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:14:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:14:59,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 15:14:59,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 15:14:59,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=2948, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 15:14:59,123 INFO L87 Difference]: Start difference. First operand 300 states and 302 transitions. Second operand 72 states. [2018-02-04 15:15:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:15:02,624 INFO L93 Difference]: Finished difference Result 821 states and 887 transitions. [2018-02-04 15:15:02,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 15:15:02,624 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 273 [2018-02-04 15:15:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:15:02,626 INFO L225 Difference]: With dead ends: 821 [2018-02-04 15:15:02,626 INFO L226 Difference]: Without dead ends: 821 [2018-02-04 15:15:02,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6648, Invalid=11984, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 15:15:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-02-04 15:15:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 304. [2018-02-04 15:15:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-02-04 15:15:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 306 transitions. [2018-02-04 15:15:02,630 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 306 transitions. Word has length 273 [2018-02-04 15:15:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:15:02,630 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 306 transitions. [2018-02-04 15:15:02,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 15:15:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 306 transitions. [2018-02-04 15:15:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 15:15:02,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:15:02,631 INFO L351 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:15:02,631 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:15:02,631 INFO L82 PathProgramCache]: Analyzing trace with hash -186176404, now seen corresponding path program 65 times [2018-02-04 15:15:02,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:15:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:15:02,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:15:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:15:05,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:15:05,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-02-04 15:15:05,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:15:05,328 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 15:15:05,328 INFO L182 omatonBuilderFactory]: Interpolants [47104#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 47105#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 47106#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 47107#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 47108#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 47109#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 47110#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47111#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 47112#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47113#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47114#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47115#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47116#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47117#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47118#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 47119#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 47120#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 47121#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47122#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 47123#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47124#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47125#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 47126#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 47127#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47128#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47129#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47130#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 47131#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 47132#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 47133#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47134#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47135#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47136#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 47137#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47138#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47139#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47140#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 47141#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 47142#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 47143#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 47144#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47145#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47146#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 47147#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 47148#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 47149#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 47150#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47151#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 47152#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47153#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47154#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 47155#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 47156#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 47157#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47158#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 47159#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 47160#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 47161#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 47162#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47163#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n)), 47164#(and (<= (+ foo_~i~0 66) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47165#(and (<= (+ foo_~i~0 65) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 47166#(and (= ~a.offset 0) (<= (+ foo_~i~0 64) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47167#(and (= ~a.offset 0) (<= (+ foo_~i~0 64) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 47168#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 63) ~n)), 47169#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 252) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 47097#true, 47098#false, 47099#(<= 128 ~n), 47100#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 47101#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47102#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 47103#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:15:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:15:05,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 15:15:05,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 15:15:05,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3026, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 15:15:05,329 INFO L87 Difference]: Start difference. First operand 304 states and 306 transitions. Second operand 73 states. [2018-02-04 15:15:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:15:08,895 INFO L93 Difference]: Finished difference Result 833 states and 900 transitions. [2018-02-04 15:15:08,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 15:15:08,896 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 277 [2018-02-04 15:15:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:15:08,897 INFO L225 Difference]: With dead ends: 833 [2018-02-04 15:15:08,897 INFO L226 Difference]: Without dead ends: 833 [2018-02-04 15:15:08,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2543 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6849, Invalid=12333, Unknown=0, NotChecked=0, Total=19182 [2018-02-04 15:15:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2018-02-04 15:15:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 308. [2018-02-04 15:15:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 15:15:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 310 transitions. [2018-02-04 15:15:08,901 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 310 transitions. Word has length 277 [2018-02-04 15:15:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:15:08,901 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 310 transitions. [2018-02-04 15:15:08,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 15:15:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 310 transitions. [2018-02-04 15:15:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-02-04 15:15:08,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:15:08,902 INFO L351 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:15:08,902 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:15:08,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1689369277, now seen corresponding path program 66 times [2018-02-04 15:15:08,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:15:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:15:08,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:15:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:15:11,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:15:11,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-04 15:15:11,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:15:11,555 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 15:15:11,555 INFO L182 omatonBuilderFactory]: Interpolants [48512#(and (= ~a.offset 0) (<= (+ foo_~i~0 64) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48513#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 63) ~n)), 48514#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 63) ~n)), 48515#(and (= ~a.offset 0) (<= (+ foo_~i~0 62) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 48516#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 248) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 48443#true, 48444#false, 48445#(<= 128 ~n), 48446#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 48447#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48448#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48449#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48450#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 48451#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 48452#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 48453#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 48454#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 48455#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 48456#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48457#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 48458#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48459#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48460#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48461#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48462#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48463#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48464#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 48465#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 48466#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 48467#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48468#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 48469#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48470#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48471#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 48472#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 48473#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48474#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48475#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48476#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 48477#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 48478#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 48479#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48480#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48481#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48482#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 48483#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48484#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48485#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48486#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 48487#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 48488#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 48489#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 48490#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48491#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48492#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 48493#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 48494#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 48495#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 48496#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48497#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 48498#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48499#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48500#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 48501#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 48502#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 48503#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 48504#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 48505#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 48506#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 48507#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 48508#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48509#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n)), 48510#(and (<= (+ foo_~i~0 66) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 48511#(and (<= (+ foo_~i~0 65) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)))] [2018-02-04 15:15:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:15:11,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 15:15:11,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 15:15:11,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2297, Invalid=3105, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 15:15:11,556 INFO L87 Difference]: Start difference. First operand 308 states and 310 transitions. Second operand 74 states. [2018-02-04 15:15:14,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:15:14,909 INFO L93 Difference]: Finished difference Result 845 states and 913 transitions. [2018-02-04 15:15:14,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 15:15:14,909 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 281 [2018-02-04 15:15:14,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:15:14,911 INFO L225 Difference]: With dead ends: 845 [2018-02-04 15:15:14,911 INFO L226 Difference]: Without dead ends: 845 [2018-02-04 15:15:14,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7053, Invalid=12687, Unknown=0, NotChecked=0, Total=19740 [2018-02-04 15:15:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-02-04 15:15:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 312. [2018-02-04 15:15:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 15:15:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 314 transitions. [2018-02-04 15:15:14,917 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 314 transitions. Word has length 281 [2018-02-04 15:15:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:15:14,918 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 314 transitions. [2018-02-04 15:15:14,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 15:15:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 314 transitions. [2018-02-04 15:15:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-04 15:15:14,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:15:14,918 INFO L351 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:15:14,919 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:15:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash 339679898, now seen corresponding path program 67 times [2018-02-04 15:15:14,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:15:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:15:15,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:15:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:15:17,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:15:17,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-02-04 15:15:17,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:15:17,711 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 15:15:17,711 INFO L182 omatonBuilderFactory]: Interpolants [49808#true, 49809#false, 49810#(<= 128 ~n), 49811#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 49812#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49813#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49814#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49815#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n)), 49816#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 49817#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 49818#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 49819#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 49820#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 49821#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49822#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 49823#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49824#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49825#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49826#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49827#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49828#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49829#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 49830#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 49831#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 49832#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49833#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 49834#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49835#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49836#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 49837#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 49838#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49839#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49840#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49841#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 49842#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 49843#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 49844#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49845#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49846#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49847#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 49848#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49849#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49850#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49851#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 49852#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 49853#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 49854#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 49855#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49856#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49857#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 49858#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 49859#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 49860#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 49861#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49862#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 49863#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49864#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49865#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 49866#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 49867#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 49868#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49869#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 49870#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 49871#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 49872#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 49873#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49874#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n)), 49875#(and (<= (+ foo_~i~0 66) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49876#(and (<= (+ foo_~i~0 65) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 49877#(and (= ~a.offset 0) (<= (+ foo_~i~0 64) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49878#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 63) ~n)), 49879#(and (= ~a.offset 0) (<= (+ foo_~i~0 62) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 49880#(and (= ~a.offset 0) (<= (+ foo_~i~0 62) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 49881#(and (<= (+ foo_~i~0 61) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 49882#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 244) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:15:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:15:17,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 15:15:17,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 15:15:17,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2365, Invalid=3185, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 15:15:17,712 INFO L87 Difference]: Start difference. First operand 312 states and 314 transitions. Second operand 75 states. [2018-02-04 15:15:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:15:21,510 INFO L93 Difference]: Finished difference Result 857 states and 926 transitions. [2018-02-04 15:15:21,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 15:15:21,510 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 285 [2018-02-04 15:15:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:15:21,512 INFO L225 Difference]: With dead ends: 857 [2018-02-04 15:15:21,512 INFO L226 Difference]: Without dead ends: 857 [2018-02-04 15:15:21,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2688 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7260, Invalid=13046, Unknown=0, NotChecked=0, Total=20306 [2018-02-04 15:15:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-02-04 15:15:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 316. [2018-02-04 15:15:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 15:15:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 318 transitions. [2018-02-04 15:15:21,517 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 318 transitions. Word has length 285 [2018-02-04 15:15:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:15:21,517 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 318 transitions. [2018-02-04 15:15:21,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 15:15:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 318 transitions. [2018-02-04 15:15:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-02-04 15:15:21,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:15:21,518 INFO L351 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:15:21,518 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:15:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1401384049, now seen corresponding path program 68 times [2018-02-04 15:15:21,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:15:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:15:21,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:15:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:15:24,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:15:24,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 15:15:24,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:15:24,378 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 15:15:24,379 INFO L182 omatonBuilderFactory]: Interpolants [51200#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 125) ~n)), 51201#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 124) ~n)), 51202#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 123) ~n)), 51203#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 122) ~n)), 51204#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 121) ~n)), 51205#(and (<= (+ foo_~i~0 120) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51206#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 119) ~n)), 51207#(and (<= (+ foo_~i~0 118) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51208#(and (<= (+ foo_~i~0 117) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51209#(and (= ~a.offset 0) (<= (+ foo_~i~0 116) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51210#(and (<= (+ foo_~i~0 115) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51211#(and (<= (+ foo_~i~0 114) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51212#(and (<= (+ foo_~i~0 113) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51213#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 112) ~n)), 51214#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 111) ~n)), 51215#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 110) ~n)), 51216#(and (= ~a.offset 0) (<= (+ foo_~i~0 109) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51217#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 108) ~n)), 51218#(and (= ~a.offset 0) (<= (+ foo_~i~0 107) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51219#(and (= ~a.offset 0) (<= (+ foo_~i~0 106) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51220#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 105) ~n)), 51221#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 104) ~n)), 51222#(and (= ~a.offset 0) (<= (+ foo_~i~0 103) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51223#(and (= ~a.offset 0) (<= (+ foo_~i~0 102) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51224#(and (= ~a.offset 0) (<= (+ foo_~i~0 101) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51225#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 100) ~n)), 51226#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 99) ~n)), 51227#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 98) ~n)), 51228#(and (<= (+ foo_~i~0 97) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51229#(and (<= (+ foo_~i~0 96) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51230#(and (= ~a.offset 0) (<= (+ foo_~i~0 95) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51231#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 94) ~n)), 51232#(and (<= (+ foo_~i~0 93) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51233#(and (<= (+ foo_~i~0 92) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51234#(and (<= (+ foo_~i~0 91) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51235#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 90) ~n)), 51236#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 89) ~n)), 51237#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 88) ~n)), 51238#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 87) ~n)), 51239#(and (<= (+ foo_~i~0 86) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51240#(and (<= (+ foo_~i~0 85) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51241#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 84) ~n)), 51242#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 83) ~n)), 51243#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 82) ~n)), 51244#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 81) ~n)), 51245#(and (= ~a.offset 0) (<= (+ foo_~i~0 80) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51246#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 79) ~n)), 51247#(and (<= (+ foo_~i~0 78) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51248#(and (<= (+ foo_~i~0 77) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51249#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 76) ~n)), 51250#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 75) ~n)), 51251#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 74) ~n)), 51252#(and (= ~a.offset 0) (<= (+ foo_~i~0 73) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51253#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 72) ~n)), 51254#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 71) ~n)), 51255#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 70) ~n)), 51256#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 69) ~n)), 51257#(and (<= (+ foo_~i~0 68) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51258#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 67) ~n)), 51259#(and (<= (+ foo_~i~0 66) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51260#(and (<= (+ foo_~i~0 65) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51261#(and (= ~a.offset 0) (<= (+ foo_~i~0 64) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51262#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 63) ~n)), 51263#(and (= ~a.offset 0) (<= (+ foo_~i~0 62) ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51264#(and (<= (+ foo_~i~0 61) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51265#(and (<= (+ foo_~i~0 61) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 51266#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 60) ~n) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 51267#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 240) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 51192#true, 51193#false, 51194#(<= 128 ~n), 51195#(and (<= 128 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 51196#(and (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51197#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 128 ~n) (= (* 4 ~n) (select |#length| ~a.base))), 51198#(and (<= (+ foo_~i~0 127) ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 51199#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= (+ foo_~i~0 126) ~n))] [2018-02-04 15:15:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:15:24,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-04 15:15:24,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-04 15:15:24,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2434, Invalid=3266, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 15:15:24,380 INFO L87 Difference]: Start difference. First operand 316 states and 318 transitions. Second operand 76 states. [2018-02-04 15:15:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:15:28,252 INFO L93 Difference]: Finished difference Result 869 states and 939 transitions. [2018-02-04 15:15:28,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 15:15:28,280 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 289 [2018-02-04 15:15:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:15:28,281 INFO L225 Difference]: With dead ends: 869 [2018-02-04 15:15:28,281 INFO L226 Difference]: Without dead ends: 869 [2018-02-04 15:15:28,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2762 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7470, Invalid=13410, Unknown=0, NotChecked=0, Total=20880 [2018-02-04 15:15:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-02-04 15:15:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 320. [2018-02-04 15:15:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-02-04 15:15:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 322 transitions. [2018-02-04 15:15:28,285 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 322 transitions. Word has length 289 [2018-02-04 15:15:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:15:28,285 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 322 transitions. [2018-02-04 15:15:28,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-04 15:15:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 322 transitions. [2018-02-04 15:15:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-02-04 15:15:28,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:15:28,286 INFO L351 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:15:28,286 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:15:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash 806681288, now seen corresponding path program 69 times [2018-02-04 15:15:28,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:15:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:15:28,377 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 15:15:29,594 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 15:15:29,597 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 15:15:29,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:15:29 BoogieIcfgContainer [2018-02-04 15:15:29,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:15:29,598 INFO L168 Benchmark]: Toolchain (without parser) took 190323.20 ms. Allocated memory was 409.5 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 366.2 MB in the beginning and 547.3 MB in the end (delta: -181.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-02-04 15:15:29,599 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 409.5 MB. Free memory is still 372.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:15:29,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.16 ms. Allocated memory is still 409.5 MB. Free memory was 366.2 MB in the beginning and 355.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:15:29,599 INFO L168 Benchmark]: Boogie Preprocessor took 22.79 ms. Allocated memory is still 409.5 MB. Free memory was 355.5 MB in the beginning and 354.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:15:29,599 INFO L168 Benchmark]: RCFGBuilder took 192.43 ms. Allocated memory is still 409.5 MB. Free memory was 354.2 MB in the beginning and 334.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 15:15:29,599 INFO L168 Benchmark]: TraceAbstraction took 189957.17 ms. Allocated memory was 409.5 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 334.3 MB in the beginning and 547.3 MB in the end (delta: -212.9 MB). Peak memory consumption was 991.9 MB. Max. memory is 5.3 GB. [2018-02-04 15:15:29,600 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.20 ms. Allocated memory is still 409.5 MB. Free memory is still 372.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.16 ms. Allocated memory is still 409.5 MB. Free memory was 366.2 MB in the beginning and 355.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.79 ms. Allocated memory is still 409.5 MB. Free memory was 355.5 MB in the beginning and 354.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 192.43 ms. Allocated memory is still 409.5 MB. Free memory was 354.2 MB in the beginning and 334.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 189957.17 ms. Allocated memory was 409.5 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 334.3 MB in the beginning and 547.3 MB in the end (delta: -212.9 MB). Peak memory consumption was 991.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 294 with TraceHistMax 70, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 17 error locations. TIMEOUT Result, 189.9s OverallTime, 73 OverallIterations, 70 TraceHistogramMax, 109.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2120 SDtfs, 119780 SDslu, 45770 SDs, 0 SdLazy, 52207 SolverSat, 29172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5328 GetRequests, 73 SyntacticMatches, 70 SemanticMatches, 5185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69352 ImplicationChecksByTransitivity, 130.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/216614 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 72 MinimizatonAttempts, 19113 StatesRemovedByMinimization, 69 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 72.2s InterpolantComputationTime, 10596 NumberOfCodeBlocks, 10596 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 10524 ConstructedInterpolants, 0 QuantifiedInterpolants, 31748800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 72 InterpolantComputations, 4 PerfectInterpolantSequences, 0/216614 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/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-15-29-605.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-15-29-605.csv Completed graceful shutdown