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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:40:33,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:40:33,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:40:33,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:40:33,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:40:33,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:40:33,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:40:33,557 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:40:33,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:40:33,559 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:40:33,560 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:40:33,560 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:40:33,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:40:33,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:40:33,563 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:40:33,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:40:33,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:40:33,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:40:33,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:40:33,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:40:33,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:40:33,571 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:40:33,571 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:40:33,572 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:40:33,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:40:33,574 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:40:33,574 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:40:33,574 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:40:33,575 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:40:33,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:40:33,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:40:33,575 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 02:40:33,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:40:33,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:40:33,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:40:33,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:40:33,586 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:40:33,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:40:33,587 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:40:33,587 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:40:33,587 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:40:33,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:40:33,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:40:33,588 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:40:33,588 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:40:33,588 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:40:33,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:40:33,588 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:40:33,588 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:40:33,588 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:40:33,589 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:40:33,589 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:40:33,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:40:33,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:40:33,589 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:40:33,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:40:33,629 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:40:33,633 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:40:33,634 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:40:33,634 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:40:33,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-02-04 02:40:33,772 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:40:33,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:40:33,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:40:33,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:40:33,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:40:33,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de4fb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33, skipping insertion in model container [2018-02-04 02:40:33,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,795 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:40:33,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:40:33,903 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:40:33,915 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:40:33,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33 WrapperNode [2018-02-04 02:40:33,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:40:33,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:40:33,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:40:33,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:40:33,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (1/1) ... [2018-02-04 02:40:33,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:40:33,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:40:33,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:40:33,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:40:33,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (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 02:40:33,982 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:40:33,982 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:40:33,982 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 02:40:33,982 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:40:33,982 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:40:33,982 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:40:33,983 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:40:34,123 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:40:34,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:40:34 BoogieIcfgContainer [2018-02-04 02:40:34,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:40:34,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:40:34,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:40:34,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:40:34,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:40:33" (1/3) ... [2018-02-04 02:40:34,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8a8624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:40:34, skipping insertion in model container [2018-02-04 02:40:34,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:40:33" (2/3) ... [2018-02-04 02:40:34,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8a8624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:40:34, skipping insertion in model container [2018-02-04 02:40:34,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:40:34" (3/3) ... [2018-02-04 02:40:34,128 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-02-04 02:40:34,133 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:40:34,138 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 02:40:34,160 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:40:34,160 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:40:34,160 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:40:34,161 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:40:34,161 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:40:34,161 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:40:34,161 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:40:34,161 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:40:34,161 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:40:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-04 02:40:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:40:34,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:34,179 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:34,179 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-02-04 02:40:34,232 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:34,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:34,304 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 02:40:34,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:34,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:40:34,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:34,308 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 02:40:34,309 INFO L182 omatonBuilderFactory]: Interpolants [62#true, 63#false] [2018-02-04 02:40:34,309 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 02:40:34,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 02:40:34,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 02:40:34,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:40:34,325 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-02-04 02:40:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:34,344 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-02-04 02:40:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:40:34,345 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 02:40:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:34,354 INFO L225 Difference]: With dead ends: 59 [2018-02-04 02:40:34,355 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 02:40:34,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:40:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 02:40:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 02:40:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 02:40:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 02:40:34,438 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-02-04 02:40:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:34,438 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 02:40:34,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 02:40:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 02:40:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:40:34,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:34,439 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:34,439 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:34,439 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-02-04 02:40:34,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:34,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:34,505 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 02:40:34,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:34,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:40:34,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:34,505 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 02:40:34,505 INFO L182 omatonBuilderFactory]: Interpolants [179#true, 180#false, 181#(= 1 (select |#valid| |main_#t~malloc7.base|)), 182#(= 1 (select |#valid| |main_#t~post8.base|))] [2018-02-04 02:40:34,505 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 02:40:34,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:40:34,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:40:34,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:40:34,507 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-02-04 02:40:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:34,623 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 02:40:34,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:40:34,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:40:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:34,624 INFO L225 Difference]: With dead ends: 55 [2018-02-04 02:40:34,625 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 02:40:34,625 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 02:40:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 02:40:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 02:40:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 02:40:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 02:40:34,630 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-02-04 02:40:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:34,631 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 02:40:34,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:40:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 02:40:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:40:34,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:34,631 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:34,631 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-02-04 02:40:34,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:34,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:34,700 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 02:40:34,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:34,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:40:34,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:34,701 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 02:40:34,701 INFO L182 omatonBuilderFactory]: Interpolants [295#true, 296#false, 297#(<= 1 ~n), 298#(and (= 0 |main_#t~malloc7.offset|) (<= 4 (select |#length| |main_#t~malloc7.base|))), 299#(and (= |main_#t~post8.offset| 0) (<= 4 (select |#length| |main_#t~post8.base|)))] [2018-02-04 02:40:34,701 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 02:40:34,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:40:34,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:40:34,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:40:34,702 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-02-04 02:40:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:34,760 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-02-04 02:40:34,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:40:34,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 02:40:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:34,761 INFO L225 Difference]: With dead ends: 54 [2018-02-04 02:40:34,761 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 02:40:34,761 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 02:40:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 02:40:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 02:40:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 02:40:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-02-04 02:40:34,765 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-02-04 02:40:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:34,765 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-02-04 02:40:34,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:40:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-02-04 02:40:34,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 02:40:34,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:34,765 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:34,765 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-02-04 02:40:34,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:34,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:34,843 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 02:40:34,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:34,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:40:34,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:34,844 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 02:40:34,844 INFO L182 omatonBuilderFactory]: Interpolants [416#(or (= ~a.base |main_#t~malloc7.base|) (= 1 (select |#valid| ~a.base))), 417#(or (= 1 (select |#valid| ~a.base)) (= ~a.base |main_#t~post8.base|)), 412#true, 413#false, 414#(= 1 (select |#valid| |main_#t~malloc6.base|)), 415#(= 1 (select |#valid| ~a.base))] [2018-02-04 02:40:34,844 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 02:40:34,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:40:34,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:40:34,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:40:34,844 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-02-04 02:40:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:34,895 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 02:40:34,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:40:34,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 02:40:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:34,897 INFO L225 Difference]: With dead ends: 51 [2018-02-04 02:40:34,897 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 02:40:34,897 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 02:40:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 02:40:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 02:40:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 02:40:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 02:40:34,901 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-02-04 02:40:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:34,901 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 02:40:34,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:40:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 02:40:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 02:40:34,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:34,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:34,902 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-02-04 02:40:34,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:34,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:34,997 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 02:40:34,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:34,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:40:34,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:34,998 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 02:40:34,998 INFO L182 omatonBuilderFactory]: Interpolants [528#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 4 (select |#length| ~a.base))), 522#true, 523#false, 524#(<= 1 ~n), 525#(and (= 0 |main_#t~malloc6.offset|) (<= 1 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc6.base|))), 526#(and (<= 1 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 527#(and (= foo_~i~0 0) (<= 1 ~n) (= ~a.offset 0) (= (select |#length| ~a.base) (* 4 ~n)))] [2018-02-04 02:40:34,998 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 02:40:34,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:40:34,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:40:34,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:40:34,999 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-02-04 02:40:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:35,072 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-04 02:40:35,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:40:35,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 02:40:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:35,075 INFO L225 Difference]: With dead ends: 61 [2018-02-04 02:40:35,075 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 02:40:35,075 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 02:40:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 02:40:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-02-04 02:40:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 02:40:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 02:40:35,079 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-02-04 02:40:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:35,080 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 02:40:35,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:40:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 02:40:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 02:40:35,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:35,081 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:35,081 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-02-04 02:40:35,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:35,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:35,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:35,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:40:35,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:35,146 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 02:40:35,146 INFO L182 omatonBuilderFactory]: Interpolants [644#true, 645#false, 646#(<= ~n 1), 647#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 1)), 648#(and (= ~a.offset 0) (<= ~n 1)), 649#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 4))), 650#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:40:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:35,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:40:35,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:40:35,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:40:35,147 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2018-02-04 02:40:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:35,249 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 02:40:35,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:40:35,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 02:40:35,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:35,250 INFO L225 Difference]: With dead ends: 92 [2018-02-04 02:40:35,250 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 02:40:35,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:40:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 02:40:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-02-04 02:40:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 02:40:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-02-04 02:40:35,254 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-02-04 02:40:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:35,254 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-02-04 02:40:35,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:40:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-02-04 02:40:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:40:35,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:35,254 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:35,254 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:35,255 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-02-04 02:40:35,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:35,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:35,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:35,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:40:35,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:35,426 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 02:40:35,427 INFO L182 omatonBuilderFactory]: Interpolants [823#true, 824#false, 825#(<= 1 ~n), 826#(<= 2 ~n), 827#(and (= 0 |main_#t~malloc6.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc6.base|)) (<= 2 ~n)), 828#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 2 ~n)), 829#(and (= foo_~i~0 0) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 2 ~n)), 830#(and (= ~a.offset 0) (<= (+ foo_~i~0 1) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 831#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 4) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:40:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:35,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:40:35,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:40:35,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:35,427 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-02-04 02:40:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:35,578 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-02-04 02:40:35,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:40:35,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 02:40:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:35,580 INFO L225 Difference]: With dead ends: 111 [2018-02-04 02:40:35,580 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 02:40:35,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:40:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 02:40:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2018-02-04 02:40:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 02:40:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-02-04 02:40:35,585 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 27 [2018-02-04 02:40:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:35,586 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-02-04 02:40:35,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:40:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-02-04 02:40:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 02:40:35,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:35,587 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:35,587 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash 616992647, now seen corresponding path program 1 times [2018-02-04 02:40:35,588 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:35,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:35,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:35,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:40:35,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:35,617 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 02:40:35,618 INFO L182 omatonBuilderFactory]: Interpolants [1025#true, 1026#false, 1027#(= |main_#t~post8.base| ~b.base), 1028#(= 1 (select |#valid| ~b.base))] [2018-02-04 02:40:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:35,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:40:35,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:40:35,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:40:35,619 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 4 states. [2018-02-04 02:40:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:35,652 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-04 02:40:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:40:35,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 02:40:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:35,653 INFO L225 Difference]: With dead ends: 77 [2018-02-04 02:40:35,653 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 02:40:35,654 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 02:40:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 02:40:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 02:40:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 02:40:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 02:40:35,659 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2018-02-04 02:40:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:35,659 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 02:40:35,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:40:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 02:40:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 02:40:35,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:35,660 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:35,660 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash 616992648, now seen corresponding path program 1 times [2018-02-04 02:40:35,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:35,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:35,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:35,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:40:35,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:35,744 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 02:40:35,744 INFO L182 omatonBuilderFactory]: Interpolants [1185#true, 1186#false, 1187#(<= 1 ~n), 1188#(and (= 0 |main_#t~malloc7.offset|) (<= 1 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 1189#(and (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset (+ (* 4 ~n) |main_#t~post8.offset|))), 1190#(and (<= 4 ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset (* 4 ~n))), 1191#(and (<= 4 ~b.offset) (<= ~b.offset (select |#length| ~b.base)))] [2018-02-04 02:40:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:35,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:40:35,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:40:35,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:40:35,745 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-02-04 02:40:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:35,850 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-02-04 02:40:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:40:35,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 02:40:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:35,852 INFO L225 Difference]: With dead ends: 76 [2018-02-04 02:40:35,852 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 02:40:35,852 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 02:40:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 02:40:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 02:40:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-02-04 02:40:35,856 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 29 [2018-02-04 02:40:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:35,857 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-02-04 02:40:35,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:40:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-02-04 02:40:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 02:40:35,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:35,858 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:35,858 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1946902913, now seen corresponding path program 1 times [2018-02-04 02:40:35,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:35,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:35,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:35,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:40:35,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:35,892 INFO L182 omatonBuilderFactory]: Interpolants [1348#true, 1349#false, 1350#(and (<= 1 ~n) (<= ~n 1)), 1351#(and (<= 8 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ (select |#length| ~b.base) 4)))] [2018-02-04 02:40:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:35,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:40:35,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:40:35,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:40:35,892 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 4 states. [2018-02-04 02:40:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:35,937 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-04 02:40:35,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:40:35,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-04 02:40:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:35,938 INFO L225 Difference]: With dead ends: 90 [2018-02-04 02:40:35,938 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 02:40:35,938 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 02:40:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 02:40:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-02-04 02:40:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 02:40:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-04 02:40:35,940 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 30 [2018-02-04 02:40:35,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:35,941 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-04 02:40:35,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:40:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-04 02:40:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:40:35,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:35,941 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:35,941 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash 746385703, now seen corresponding path program 2 times [2018-02-04 02:40:35,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:35,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:35,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:35,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:40:35,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:35,995 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 02:40:35,995 INFO L182 omatonBuilderFactory]: Interpolants [1522#true, 1523#false, 1524#(<= ~n 1), 1525#(<= ~n 2), 1526#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 2)), 1527#(and (= ~a.offset 0) (<= ~n 2)), 1528#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 8))), 1529#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 4))), 1530#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:40:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:35,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:40:35,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:40:35,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:35,996 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-02-04 02:40:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:36,128 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-02-04 02:40:36,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:40:36,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 02:40:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:36,128 INFO L225 Difference]: With dead ends: 136 [2018-02-04 02:40:36,128 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 02:40:36,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:40:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 02:40:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-02-04 02:40:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 02:40:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-04 02:40:36,133 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2018-02-04 02:40:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:36,133 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-04 02:40:36,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:40:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-04 02:40:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:40:36,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:36,134 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:36,134 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash 946337879, now seen corresponding path program 1 times [2018-02-04 02:40:36,135 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:36,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:36,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:36,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:40:36,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:36,178 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 02:40:36,178 INFO L182 omatonBuilderFactory]: Interpolants [1792#true, 1793#false, 1794#(= 0 |main_#t~malloc7.offset|), 1795#(and (= |main_#t~post8.offset| 0) (<= ~b.offset 4)), 1796#(<= ~b.offset 4), 1797#(and (<= 4 ~b.offset) (<= ~b.offset 4))] [2018-02-04 02:40:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:36,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:40:36,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:40:36,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:40:36,179 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 6 states. [2018-02-04 02:40:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:36,206 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-02-04 02:40:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:40:36,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 02:40:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:36,207 INFO L225 Difference]: With dead ends: 107 [2018-02-04 02:40:36,207 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 02:40:36,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 02:40:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 02:40:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 02:40:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-04 02:40:36,210 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 33 [2018-02-04 02:40:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:36,210 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-04 02:40:36,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:40:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-04 02:40:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:40:36,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:36,211 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:36,211 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash 946337880, now seen corresponding path program 1 times [2018-02-04 02:40:36,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:36,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:36,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:36,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:40:36,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:36,305 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 02:40:36,305 INFO L182 omatonBuilderFactory]: Interpolants [2018#true, 2019#false, 2020#(and (not (= 0 |main_#t~malloc6.base|)) (= 1 (select |#valid| |main_#t~malloc6.base|))), 2021#(and (= 1 (select |#valid| ~a.base)) (not (= 0 ~a.base))), 2022#(and (not (= ~a.base |main_#t~malloc7.base|)) (not (= 0 ~a.base))), 2023#(and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (not (= 0 ~a.base))), 2024#(and (= 1 (select (store |#valid| ~a.base 0) ~b.base)) (not (= 0 ~a.base))), 2025#(= 1 (select |#valid| ~b.base))] [2018-02-04 02:40:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:36,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:40:36,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:40:36,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:40:36,306 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 8 states. [2018-02-04 02:40:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:36,436 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-04 02:40:36,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:40:36,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 02:40:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:36,438 INFO L225 Difference]: With dead ends: 105 [2018-02-04 02:40:36,438 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 02:40:36,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:40:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 02:40:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-04 02:40:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 02:40:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-04 02:40:36,442 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 33 [2018-02-04 02:40:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:36,442 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-04 02:40:36,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:40:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-04 02:40:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:40:36,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:36,443 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:36,443 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash 946329935, now seen corresponding path program 1 times [2018-02-04 02:40:36,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:36,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:36,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:36,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:40:36,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:36,677 INFO L182 omatonBuilderFactory]: Interpolants [2251#true, 2252#false, 2253#(= 1 ~n), 2254#(and (= (select |#valid| |main_#t~malloc6.base|) 1) (= 1 ~n)), 2255#(and (= (select |#valid| ~a.base) 1) (= 1 ~n)), 2256#(and (not (= ~a.base |main_#t~malloc7.base|)) (= |main_#t~malloc7.offset| 0) (= 1 ~n)), 2257#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (not (= |main_#t~post8.base| ~a.base)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 8)) (= 1 ~n)), 2258#(and (not (= ~a.base ~b.base)) (or (not (= 8 (+ ~b.offset (* 4 ~n)))) (= 1 (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (<= ~b.offset 4) (= 1 ~n)), 2259#(= |#memory_int| |old(#memory_int)|), 2260#(or (not (= 1 ~n)) (= |#memory_int| |old(#memory_int)|)), 2261#(or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (not (= 1 ~n))), 2262#(and (or (not (= 8 (+ ~b.offset (* 4 ~n)))) (= 1 (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (<= ~b.offset 4) (= 1 ~n)), 2263#(and (= 1 (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 8 (+ ~b.offset (* 4 ~n))) (= 1 |main_#t~mem10|) (= 1 ~n)), 2264#(and (= |main_#t~mem11| 1) (= 1 |main_#t~mem10|))] [2018-02-04 02:40:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:36,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:40:36,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:40:36,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:40:36,678 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 14 states. [2018-02-04 02:40:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:36,964 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-04 02:40:36,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:40:36,965 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-02-04 02:40:36,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:36,965 INFO L225 Difference]: With dead ends: 113 [2018-02-04 02:40:36,966 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 02:40:36,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:40:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 02:40:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-02-04 02:40:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 02:40:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-04 02:40:36,971 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 33 [2018-02-04 02:40:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:36,971 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-04 02:40:36,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:40:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-04 02:40:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:40:36,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:36,972 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:36,973 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash 529142380, now seen corresponding path program 1 times [2018-02-04 02:40:36,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:36,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:40:37,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:37,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:40:37,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:37,076 INFO L182 omatonBuilderFactory]: Interpolants [2512#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 2 ~n)), 2513#(and (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ ~b.offset 4) (+ (* 4 ~n) |main_#t~post8.offset|))), 2514#(and (<= (+ ~b.offset 4) (* 4 ~n)) (<= 4 ~b.offset) (= (* 4 ~n) (select |#length| ~b.base))), 2515#(and (<= (+ ~b.offset 4) (* 4 ~n)) (= foo_~i~0 0) (<= 4 ~b.offset) (= (* 4 ~n) (select |#length| ~b.base))), 2516#(and (= foo_~i~0 0) (<= 4 ~b.offset) (<= (+ ~b.offset 4) (select |#length| ~b.base))), 2508#true, 2509#false, 2510#(<= 1 ~n), 2511#(<= 2 ~n)] [2018-02-04 02:40:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:40:37,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:40:37,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:40:37,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:37,076 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-02-04 02:40:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:37,206 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-02-04 02:40:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:40:37,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-04 02:40:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:37,207 INFO L225 Difference]: With dead ends: 113 [2018-02-04 02:40:37,207 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 02:40:37,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:40:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 02:40:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-02-04 02:40:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 02:40:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-04 02:40:37,209 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 34 [2018-02-04 02:40:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:37,209 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-04 02:40:37,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:40:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-04 02:40:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:40:37,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:37,210 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:37,210 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 569056812, now seen corresponding path program 3 times [2018-02-04 02:40:37,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:37,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:40:37,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:37,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:40:37,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:37,280 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 02:40:37,280 INFO L182 omatonBuilderFactory]: Interpolants [2741#true, 2742#false, 2743#(and (= 0 |main_#t~malloc6.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc6.base|))), 2744#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 2745#(and (= ~a.offset 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset)) (= (select |#length| ~a.base) (* 4 ~n))), 2746#(and (= ~a.offset 0) (= (select |#length| ~a.base) (* 4 ~n)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 2747#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 4) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:40:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 02:40:37,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:40:37,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:40:37,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:40:37,281 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 7 states. [2018-02-04 02:40:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:37,342 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-04 02:40:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:40:37,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-04 02:40:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:37,343 INFO L225 Difference]: With dead ends: 107 [2018-02-04 02:40:37,343 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 02:40:37,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 02:40:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-02-04 02:40:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 02:40:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-02-04 02:40:37,346 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 34 [2018-02-04 02:40:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:37,346 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-02-04 02:40:37,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:40:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-02-04 02:40:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:40:37,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:37,347 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:37,347 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1102363112, now seen corresponding path program 1 times [2018-02-04 02:40:37,347 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:37,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:37,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:37,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:40:37,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:37,537 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 02:40:37,537 INFO L182 omatonBuilderFactory]: Interpolants [2964#true, 2965#false, 2966#(= |#valid| |old(#valid)|), 2967#(and (not (= 0 |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|)), 2968#(and (not (= 0 ~a.base)) (= |old(#valid)| (store |#valid| ~a.base 0))), 2969#(and (or (= ~a.base |main_#t~malloc7.base|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) ~a.base (select (store |#valid| ~a.base 0) ~a.base)))) (not (= |main_#t~malloc7.base| 0)) (not (= 0 ~a.base))), 2970#(and (or (and (= (store (store |#valid| ~b.base 0) ~a.base (select (store |#valid| ~a.base 0) ~a.base)) |old(#valid)|) (not (= ~a.base ~b.base))) (= |main_#t~post8.base| ~a.base)) (or (not (= |main_#t~post8.base| ~a.base)) (= ~a.base ~b.base)) (not (= ~b.base 0)) (not (= 0 ~a.base))), 2971#(and (or (= (store (store |#valid| ~b.base 0) ~a.base (select (store |#valid| ~a.base 0) ~a.base)) |old(#valid)|) (= ~a.base ~b.base)) (not (= ~b.base 0)) (not (= 0 ~a.base))), 2972#(and (or (= 0 (select |#valid| ~b.base)) (= |old(#valid)| (store |#valid| ~b.base (select (store |#valid| ~b.base 0) ~b.base)))) (not (= ~b.base 0)))] [2018-02-04 02:40:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:37,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:40:37,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:40:37,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:37,537 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 9 states. [2018-02-04 02:40:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:37,677 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-04 02:40:37,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:40:37,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-04 02:40:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:37,678 INFO L225 Difference]: With dead ends: 104 [2018-02-04 02:40:37,678 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 02:40:37,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:40:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 02:40:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 02:40:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 02:40:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-04 02:40:37,680 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-02-04 02:40:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:37,680 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-04 02:40:37,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:40:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-04 02:40:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:40:37,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:37,680 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:37,680 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 984721596, now seen corresponding path program 1 times [2018-02-04 02:40:37,681 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:37,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:40:37,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:37,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:40:37,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:37,723 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 02:40:37,723 INFO L182 omatonBuilderFactory]: Interpolants [3168#(<= 2 ~n), 3169#(<= (+ (* 4 foo_~i~0) ~b.offset 4) (select |#length| ~b.base)), 3170#(<= (+ (* 4 foo_~i~0) ~b.offset) (select |#length| ~b.base)), 3171#(<= (+ ~b.offset (* 4 ~n)) (+ (select |#length| ~b.base) 4)), 3172#(and (<= (+ ~b.offset (* 4 ~n)) (+ (select |#length| ~b.base) 4)) (<= 2 ~n)), 3173#(and (<= 12 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ (select |#length| ~b.base) 4))), 3165#true, 3166#false, 3167#(<= 1 ~n)] [2018-02-04 02:40:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:40:37,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:40:37,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:40:37,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:37,724 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-02-04 02:40:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:37,809 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-02-04 02:40:37,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:40:37,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 02:40:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:37,810 INFO L225 Difference]: With dead ends: 77 [2018-02-04 02:40:37,810 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 02:40:37,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:40:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 02:40:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 02:40:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 02:40:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-02-04 02:40:37,813 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 41 [2018-02-04 02:40:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:37,813 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-02-04 02:40:37,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:40:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-02-04 02:40:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:40:37,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:37,814 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:37,814 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:37,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1657687266, now seen corresponding path program 1 times [2018-02-04 02:40:37,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:37,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:40:37,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:37,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:40:37,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:37,860 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 02:40:37,861 INFO L182 omatonBuilderFactory]: Interpolants [3344#(<= (+ foo_~i~0 1) ~n), 3337#true, 3338#false, 3339#(<= 1 ~n), 3340#(<= 2 ~n), 3341#(<= 3 ~n), 3342#(and (= foo_~i~0 0) (<= 3 ~n)), 3343#(<= (+ foo_~i~0 2) ~n)] [2018-02-04 02:40:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:40:37,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:40:37,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:40:37,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:40:37,861 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 8 states. [2018-02-04 02:40:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:37,928 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-04 02:40:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:40:37,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-02-04 02:40:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:37,929 INFO L225 Difference]: With dead ends: 90 [2018-02-04 02:40:37,929 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 02:40:37,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:40:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 02:40:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-02-04 02:40:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 02:40:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-02-04 02:40:37,931 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-02-04 02:40:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:37,931 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-02-04 02:40:37,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:40:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-02-04 02:40:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 02:40:37,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:37,932 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:37,932 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1214448692, now seen corresponding path program 1 times [2018-02-04 02:40:37,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:37,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:38,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:38,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:40:38,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:38,431 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 02:40:38,431 INFO L182 omatonBuilderFactory]: Interpolants [3527#true, 3528#false, 3529#(and (<= 1 ~n) (<= ~n 1)), 3530#(and (<= ~n 2) (<= 2 ~n)), 3531#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 2) (<= 2 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 3532#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 2) (<= 2 ~n)), 3533#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= ~n 2) (<= 2 ~n)), 3534#(and (= |main_#t~post8.offset| 0) (= ~a.offset 0) (or (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 12)) (<= 2 ~n)) (not (= ~b.offset 4))) (<= ~b.offset 4)), 3535#(and (= ~a.offset 0) (or (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset (* 4 ~n)) 12) (<= 2 ~n)) (not (= ~b.offset 4))) (<= ~b.offset 4)), 3536#(= |#memory_int| |old(#memory_int)|), 3537#(and (= foo_~i~0 0) (= |#memory_int| |old(#memory_int)|)), 3538#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3539#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 1) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3540#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= 1 ~a.offset) (= ~a.offset 0))), 3541#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 ~a.offset) (or (= foo_~i~0 0) (<= 1 ~a.offset))), 3542#(or (= ~a.base ~b.base) (and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 11)) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ foo_~i~0 1) 0) (<= 13 (+ ~b.offset (* 4 ~n)))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (not (= ~b.offset 4))), 3543#(or (and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 11)) (<= foo_~i~0 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= 13 (+ ~b.offset (* 4 ~n)))) (or (<= (* 4 foo_~i~0) 0) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (= ~a.base ~b.base) (not (= ~b.offset 4))), 3544#(or (= ~a.base ~b.base) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= ~b.offset (+ ~a.offset 3)) (<= 13 (+ ~b.offset (* 4 ~n))) (<= ~n 1)) (or (<= (* 4 ~n) 4) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (not (= ~b.offset 4))), 3545#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= ~b.offset 4))) (<= ~b.offset 4)), 3546#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= ~b.offset 4)), 3547#(and (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|) (< |main_#t~mem10| (+ |main_#t~mem11| 1)) (= ~b.offset 4))] [2018-02-04 02:40:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:38,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:40:38,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:40:38,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:40:38,432 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 21 states. [2018-02-04 02:40:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:39,447 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 02:40:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:40:39,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-02-04 02:40:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:39,448 INFO L225 Difference]: With dead ends: 95 [2018-02-04 02:40:39,448 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 02:40:39,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:40:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 02:40:39,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-02-04 02:40:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 02:40:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 02:40:39,450 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2018-02-04 02:40:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:39,450 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 02:40:39,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:40:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 02:40:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 02:40:39,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:39,450 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:39,450 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1501091225, now seen corresponding path program 2 times [2018-02-04 02:40:39,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:39,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 02:40:39,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:39,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:40:39,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:39,530 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 02:40:39,530 INFO L182 omatonBuilderFactory]: Interpolants [3746#true, 3747#false, 3748#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 3749#(and (= |main_#t~post8.offset| 0) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (= (* 4 ~n) (select |#length| ~b.base))), 3750#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset 4)), 3751#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= 0 (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset 4)), 3752#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= 4 (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset 4)), 3753#(and (<= (+ (* 4 foo_~i~0) ~b.offset 4) (select |#length| ~b.base)) (<= 4 (+ (* 4 foo_~i~0) ~b.offset)))] [2018-02-04 02:40:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 02:40:39,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:40:39,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:40:39,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:40:39,531 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 8 states. [2018-02-04 02:40:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:39,634 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-02-04 02:40:39,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:40:39,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-02-04 02:40:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:39,635 INFO L225 Difference]: With dead ends: 56 [2018-02-04 02:40:39,635 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 02:40:39,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:40:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 02:40:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 02:40:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 02:40:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 02:40:39,637 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 45 [2018-02-04 02:40:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:39,638 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 02:40:39,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:40:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 02:40:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 02:40:39,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:39,638 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:39,638 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693807, now seen corresponding path program 2 times [2018-02-04 02:40:39,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:39,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:40,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:40,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:40:40,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:40,363 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 02:40:40,363 INFO L182 omatonBuilderFactory]: Interpolants [3872#true, 3873#false, 3874#(and (<= 1 ~n) (<= ~n 1)), 3875#(and (<= ~n 2) (<= 2 ~n)), 3876#(and (<= 3 ~n) (<= ~n 3)), 3877#(and (= 0 |main_#t~malloc6.offset|) (<= 3 ~n) (<= ~n 3) (= (select |#valid| |main_#t~malloc6.base|) 1)), 3878#(and (<= 3 ~n) (= (select |#valid| ~a.base) 1) (= 0 ~a.offset) (<= ~n 3)), 3879#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= 3 ~n) (= 0 ~a.offset) (<= ~n 3)), 3880#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 16) (+ ~b.offset (* 4 ~n))) (not (= |main_#t~post8.base| ~a.base)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 16)) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= 0 ~a.offset)), 3881#(and (<= 4 ~b.offset) (not (= ~a.base ~b.base)) (<= 12 (* 4 ~n)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset (* 4 ~n)) 16) (= 0 ~a.offset)), 3882#(= |#memory_int| |old(#memory_int)|), 3883#(and (= foo_~i~0 0) (= |#memory_int| |old(#memory_int)|)), 3884#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 3885#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 1) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 3886#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 2)), 3887#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset)) (<= 12 (+ ~a.offset (* 4 ~n))) (<= foo_~i~0 2)), 3888#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ ~a.offset (* 4 ~n))) (<= 0 ~a.offset)), 3889#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (and (= foo_~i~0 0) (<= 0 ~a.offset)) (<= (+ foo_~i~0 1) 0)) (or (<= 12 (+ ~a.offset (* 4 ~n))) (< 0 (+ foo_~i~0 1)))), 3890#(and (or (and (= foo_~i~0 0) (<= 0 ~a.offset)) (<= (+ foo_~i~0 1) 0)) (or (<= 12 (+ ~a.offset (* 4 ~n))) (< 0 (+ foo_~i~0 1))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 3891#(and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 15)) (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= (+ (* 4 foo_~i~0) 12) (+ ~a.offset (* 4 ~n))) (<= 17 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset))), 3892#(and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 15)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) 12) (+ ~a.offset (* 4 ~n))) (<= 17 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset))), 3893#(and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 15)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) 8) (+ ~a.offset (* 4 ~n))) (<= 17 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset)) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4))), 3894#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 8)) (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 15)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 17 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset))), 3895#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 0 ~a.offset)), 3896#(and (= ~n |main_#t~mem10|) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 0 ~a.offset)), 3897#(and (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset))] [2018-02-04 02:40:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:40,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:40:40,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:40:40,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:40:40,363 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2018-02-04 02:40:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:41,729 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-02-04 02:40:41,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:40:41,730 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-02-04 02:40:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:41,731 INFO L225 Difference]: With dead ends: 121 [2018-02-04 02:40:41,731 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 02:40:41,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=2701, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 02:40:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 02:40:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2018-02-04 02:40:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 02:40:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-02-04 02:40:41,733 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 55 [2018-02-04 02:40:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:41,734 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-02-04 02:40:41,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:40:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-02-04 02:40:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 02:40:41,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:41,734 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:41,734 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1655485324, now seen corresponding path program 3 times [2018-02-04 02:40:41,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:41,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:40:41,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:41,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:40:41,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:41,794 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 02:40:41,795 INFO L182 omatonBuilderFactory]: Interpolants [4177#true, 4178#false, 4179#(<= 1 ~n), 4180#(<= 2 ~n), 4181#(<= 3 ~n), 4182#(<= 4 ~n), 4183#(= foo_~i~0 0), 4184#(<= foo_~i~0 1), 4185#(<= foo_~i~0 2), 4186#(<= foo_~i~0 3), 4187#(<= ~n 3)] [2018-02-04 02:40:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:40:41,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:40:41,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:40:41,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:40:41,795 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 11 states. [2018-02-04 02:40:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:42,001 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-02-04 02:40:42,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:40:42,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-02-04 02:40:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:42,002 INFO L225 Difference]: With dead ends: 159 [2018-02-04 02:40:42,002 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 02:40:42,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:40:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 02:40:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-02-04 02:40:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 02:40:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-04 02:40:42,004 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 58 [2018-02-04 02:40:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:42,004 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-04 02:40:42,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:40:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-04 02:40:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 02:40:42,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:42,005 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:42,005 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:42,005 INFO L82 PathProgramCache]: Analyzing trace with hash 554046854, now seen corresponding path program 4 times [2018-02-04 02:40:42,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:42,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:40:42,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:42,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:40:42,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:42,160 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 02:40:42,160 INFO L182 omatonBuilderFactory]: Interpolants [4481#true, 4482#false, 4483#(<= ~n 1), 4484#(<= ~n 2), 4485#(<= ~n 3), 4486#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 3)), 4487#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 8))), 4488#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 8))), 4489#(= foo_~i~0 0), 4490#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 4491#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 4492#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 4493#(or (<= (+ ~b.offset 12) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-04 02:40:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:40:42,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:40:42,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:40:42,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:40:42,161 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 13 states. [2018-02-04 02:40:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:42,418 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-02-04 02:40:42,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:40:42,418 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-02-04 02:40:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:42,419 INFO L225 Difference]: With dead ends: 101 [2018-02-04 02:40:42,419 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 02:40:42,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:40:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 02:40:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-02-04 02:40:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 02:40:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-02-04 02:40:42,421 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 59 [2018-02-04 02:40:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:42,422 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-02-04 02:40:42,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:40:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-02-04 02:40:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 02:40:42,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:42,422 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:42,422 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1456637332, now seen corresponding path program 5 times [2018-02-04 02:40:42,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:42,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:43,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:43,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:40:43,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:43,336 INFO L182 omatonBuilderFactory]: Interpolants [4679#true, 4680#false, 4681#(and (<= 1 ~n) (<= ~n 1)), 4682#(and (<= ~n 2) (<= 2 ~n)), 4683#(and (<= 3 ~n) (<= ~n 3)), 4684#(and (<= 4 ~n) (<= ~n 4)), 4685#(and (= 0 |main_#t~malloc6.offset|) (<= 4 ~n) (<= ~n 4) (= (select |#valid| |main_#t~malloc6.base|) 1)), 4686#(and (= (select |#valid| ~a.base) 1) (= 0 ~a.offset) (<= 4 ~n) (<= ~n 4)), 4687#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= 0 ~a.offset) (<= 4 ~n) (<= ~n 4)), 4688#(and (or (and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (not (= |main_#t~post8.base| ~a.base)) (= 0 ~a.offset) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 20)) (<= ~n 4)) (<= (+ ~b.offset (* 4 ~n)) 19)) (<= 4 ~n)), 4689#(and (or (<= (+ ~b.offset (* 4 ~n)) 19) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= 0 ~a.offset) (<= ~b.offset 4) (<= ~n 4))) (<= 4 ~n)), 4690#(= |#memory_int| |old(#memory_int)|), 4691#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 4692#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 4693#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset))), 4694#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset))), 4695#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset)) (<= (+ foo_~i~0 1) ~n)), 4696#(and (<= 16 (+ ~a.offset (* 4 ~n))) (or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 17 (+ ~a.offset (* 4 ~n))))), 4697#(or (<= (+ ~b.offset (* 4 ~n)) 19) (<= 21 (+ ~b.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4698#(or (<= (+ ~b.offset (* 4 ~n)) 19) (<= 21 (+ ~b.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 3)) (<= (+ ~n 5) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4699#(or (<= (+ ~b.offset (* 4 ~n)) 19) (and (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= 21 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n)) (+ (* 4 foo_~i~0) ~b.offset 3)) (<= ~b.offset (+ ~a.offset 3))), 4700#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 19) (and (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= 21 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3))), 4701#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 19) (<= 21 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4702#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 19) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (<= 21 (+ ~b.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4703#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 19) (<= 21 (+ ~b.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)))) (<= ~b.offset (+ ~a.offset 3))), 4704#(and (or (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= 0 ~a.offset) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))) (<= ~b.offset 4)) (<= (+ ~b.offset (* 4 ~n)) 19)) (<= 4 ~n)), 4705#(and (= ~n |main_#t~mem10|) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= ~b.offset 4) (= 0 ~a.offset) (<= 20 (+ ~b.offset (* 4 ~n)))), 4706#(and (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset) (= ~b.offset 4))] [2018-02-04 02:40:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:43,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:40:43,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:40:43,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:40:43,336 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 28 states. [2018-02-04 02:40:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:45,882 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-02-04 02:40:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 02:40:45,882 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2018-02-04 02:40:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:45,882 INFO L225 Difference]: With dead ends: 134 [2018-02-04 02:40:45,883 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 02:40:45,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=628, Invalid=4342, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 02:40:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 02:40:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2018-02-04 02:40:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 02:40:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-02-04 02:40:45,886 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 66 [2018-02-04 02:40:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:45,886 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-02-04 02:40:45,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:40:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-02-04 02:40:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 02:40:45,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:45,886 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:45,886 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash -590785937, now seen corresponding path program 6 times [2018-02-04 02:40:45,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:45,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:40:46,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:46,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:40:46,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:46,044 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 02:40:46,044 INFO L182 omatonBuilderFactory]: Interpolants [5056#(<= ~n 4), 5044#true, 5045#false, 5046#(<= 1 ~n), 5047#(<= 2 ~n), 5048#(<= 3 ~n), 5049#(<= 4 ~n), 5050#(<= 5 ~n), 5051#(= foo_~i~0 0), 5052#(<= foo_~i~0 1), 5053#(<= foo_~i~0 2), 5054#(<= foo_~i~0 3), 5055#(<= foo_~i~0 4)] [2018-02-04 02:40:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 02:40:46,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:40:46,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:40:46,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:40:46,045 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 13 states. [2018-02-04 02:40:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:46,236 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-02-04 02:40:46,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:40:46,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-02-04 02:40:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:46,236 INFO L225 Difference]: With dead ends: 182 [2018-02-04 02:40:46,236 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 02:40:46,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=600, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:40:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 02:40:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 125. [2018-02-04 02:40:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 02:40:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-02-04 02:40:46,239 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 69 [2018-02-04 02:40:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:46,240 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-02-04 02:40:46,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:40:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-02-04 02:40:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 02:40:46,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:46,241 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:46,241 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:46,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1507073493, now seen corresponding path program 7 times [2018-02-04 02:40:46,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:46,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 02:40:46,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:46,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:40:46,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:46,303 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 02:40:46,304 INFO L182 omatonBuilderFactory]: Interpolants [5408#(<= 5 ~n), 5398#true, 5399#false, 5400#(<= ~n 1), 5401#(<= ~n 2), 5402#(<= ~n 3), 5403#(<= ~n 4), 5404#(= foo_~i~0 0), 5405#(<= 1 foo_~i~0), 5406#(<= 2 foo_~i~0), 5407#(<= 3 foo_~i~0)] [2018-02-04 02:40:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 02:40:46,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:40:46,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:40:46,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:40:46,304 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 11 states. [2018-02-04 02:40:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:46,424 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-02-04 02:40:46,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:40:46,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-02-04 02:40:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:46,425 INFO L225 Difference]: With dead ends: 119 [2018-02-04 02:40:46,425 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 02:40:46,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:40:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 02:40:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 02:40:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 02:40:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-04 02:40:46,427 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 70 [2018-02-04 02:40:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:46,427 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-04 02:40:46,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:40:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-04 02:40:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 02:40:46,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:46,428 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:46,428 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:46,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1302767729, now seen corresponding path program 8 times [2018-02-04 02:40:46,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:46,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:47,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:47,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 02:40:47,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:47,363 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 02:40:47,363 INFO L182 omatonBuilderFactory]: Interpolants [5632#(= |#memory_int| |old(#memory_int)|), 5633#(and (= foo_~i~0 0) (= |#memory_int| |old(#memory_int)|)), 5634#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 5635#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 1) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 5636#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 2)), 5637#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 3)), 5638#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 4) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 5639#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 ~a.offset)), 5640#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (= foo_~i~0 0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 0 ~a.offset))), 5641#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= foo_~i~0 0) (and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 23)) (<= 25 (+ ~b.offset (* 4 ~n))) (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 20))) (<= 0 ~a.offset))))), 5642#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)) (or (and (or (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 23)) (<= 25 (+ ~b.offset (* 4 ~n))) (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 16))) (<= 0 ~a.offset)) (<= foo_~i~0 1)))), 5643#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= 25 (+ ~b.offset (* 4 ~n))) (<= foo_~i~0 2) (<= ~b.offset (+ ~a.offset 3))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)))), 5644#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 25 (+ ~b.offset (* 4 ~n))) (<= foo_~i~0 2) (<= ~b.offset (+ ~a.offset 3))) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)))), 5645#(or (<= (+ ~b.offset (* 4 ~n)) 23) (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 25 (+ ~b.offset (* 4 ~n))) (<= foo_~i~0 3) (<= ~b.offset (+ ~a.offset 3))))), 5646#(or (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 16)) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 25 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= ~n 4))) (not (= 4 ~b.offset))), 5647#(and (= 0 ~a.offset) (<= 5 ~n) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 5648#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (< 23 (+ ~b.offset (* 4 ~n))) (= 0 ~a.offset)), 5649#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset)), 5620#true, 5621#false, 5622#(and (<= 1 ~n) (<= ~n 1)), 5623#(and (<= ~n 2) (<= 2 ~n)), 5624#(and (<= 3 ~n) (<= ~n 3)), 5625#(and (<= 4 ~n) (<= ~n 4)), 5626#(and (<= ~n 5) (<= 5 ~n)), 5627#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 5) (<= 5 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 5628#(and (<= ~n 5) (= (select |#valid| ~a.base) 1) (= 0 ~a.offset) (<= 5 ~n)), 5629#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= ~n 5) (= 0 ~a.offset) (<= 5 ~n)), 5630#(and (= |main_#t~post8.offset| 0) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 24)))) (= 0 ~a.offset) (<= 5 ~n) (<= ~b.offset 4)), 5631#(and (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset (* 4 ~n)) 24))) (= 0 ~a.offset) (<= 5 ~n) (<= ~b.offset 4))] [2018-02-04 02:40:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:47,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 02:40:47,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 02:40:47,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:40:47,365 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 30 states. [2018-02-04 02:40:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:49,095 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2018-02-04 02:40:49,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 02:40:49,095 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-02-04 02:40:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:49,096 INFO L225 Difference]: With dead ends: 164 [2018-02-04 02:40:49,096 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 02:40:49,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=546, Invalid=3486, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 02:40:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 02:40:49,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2018-02-04 02:40:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 02:40:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-02-04 02:40:49,100 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 77 [2018-02-04 02:40:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:49,101 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-02-04 02:40:49,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 02:40:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-02-04 02:40:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 02:40:49,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:49,102 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:49,102 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash 459506644, now seen corresponding path program 9 times [2018-02-04 02:40:49,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:49,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 02:40:49,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:49,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:40:49,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:49,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 02:40:49,204 INFO L182 omatonBuilderFactory]: Interpolants [6018#true, 6019#false, 6020#(<= 1 ~n), 6021#(<= 2 ~n), 6022#(<= 3 ~n), 6023#(<= 4 ~n), 6024#(<= 5 ~n), 6025#(<= 6 ~n), 6026#(= foo_~i~0 0), 6027#(<= foo_~i~0 1), 6028#(<= foo_~i~0 2), 6029#(<= foo_~i~0 3), 6030#(<= foo_~i~0 4), 6031#(<= foo_~i~0 5), 6032#(<= ~n 5)] [2018-02-04 02:40:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 02:40:49,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:40:49,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:40:49,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:40:49,205 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 15 states. [2018-02-04 02:40:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:49,455 INFO L93 Difference]: Finished difference Result 205 states and 212 transitions. [2018-02-04 02:40:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:40:49,455 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2018-02-04 02:40:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:49,456 INFO L225 Difference]: With dead ends: 205 [2018-02-04 02:40:49,456 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 02:40:49,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:40:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 02:40:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 144. [2018-02-04 02:40:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 02:40:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2018-02-04 02:40:49,459 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 80 [2018-02-04 02:40:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:49,460 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2018-02-04 02:40:49,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:40:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2018-02-04 02:40:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 02:40:49,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:49,461 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:49,461 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1572028070, now seen corresponding path program 10 times [2018-02-04 02:40:49,462 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:49,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 02:40:49,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:49,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:40:49,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:49,552 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 02:40:49,552 INFO L182 omatonBuilderFactory]: Interpolants [6432#(<= 3 foo_~i~0), 6433#(<= 4 foo_~i~0), 6434#(<= 6 ~n), 6422#true, 6423#false, 6424#(<= ~n 1), 6425#(<= ~n 2), 6426#(<= ~n 3), 6427#(<= ~n 4), 6428#(<= ~n 5), 6429#(= foo_~i~0 0), 6430#(<= 1 foo_~i~0), 6431#(<= 2 foo_~i~0)] [2018-02-04 02:40:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 02:40:49,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:40:49,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:40:49,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:40:49,553 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 13 states. [2018-02-04 02:40:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:49,743 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-02-04 02:40:49,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:40:49,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-02-04 02:40:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:49,744 INFO L225 Difference]: With dead ends: 138 [2018-02-04 02:40:49,744 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 02:40:49,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:40:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 02:40:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-04 02:40:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 02:40:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-02-04 02:40:49,746 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 81 [2018-02-04 02:40:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:49,746 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-02-04 02:40:49,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:40:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-02-04 02:40:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 02:40:49,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:49,747 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:49,747 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash -559166732, now seen corresponding path program 11 times [2018-02-04 02:40:49,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:49,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:50,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:50,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 02:40:50,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:50,951 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 02:40:50,951 INFO L182 omatonBuilderFactory]: Interpolants [6679#true, 6680#false, 6681#(and (<= 1 ~n) (<= ~n 1)), 6682#(and (<= ~n 2) (<= 2 ~n)), 6683#(and (<= 3 ~n) (<= ~n 3)), 6684#(and (<= 4 ~n) (<= ~n 4)), 6685#(and (<= ~n 5) (<= 5 ~n)), 6686#(and (<= 6 ~n) (<= ~n 6)), 6687#(and (= 0 |main_#t~malloc6.offset|) (<= 6 ~n) (<= ~n 6) (= (select |#valid| |main_#t~malloc6.base|) 1)), 6688#(and (= (select |#valid| ~a.base) 1) (<= 6 ~n) (= 0 ~a.offset) (<= ~n 6)), 6689#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= 6 ~n) (= 0 ~a.offset) (<= ~n 6)), 6690#(and (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 28)) (= |main_#t~post8.offset| 0) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)))) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (= 0 ~a.offset) (<= (+ |main_#t~post8.offset| 28) (+ ~b.offset (* 4 ~n)))), 6691#(and (<= 28 (+ ~b.offset (* 4 ~n))) (= 0 ~a.offset) (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (<= (+ ~b.offset (* 4 ~n)) 28) (<= ~b.offset 4)), 6692#(= |#memory_int| |old(#memory_int)|), 6693#(and (= foo_~i~0 0) (= |#memory_int| |old(#memory_int)|)), 6694#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 6695#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 1) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 6696#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 2)), 6697#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 3)), 6698#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= foo_~i~0 4) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 6699#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 20 (+ (* 4 foo_~i~0) ~a.offset)) (<= foo_~i~0 5)), 6700#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 ~a.offset)), 6701#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= 1 ~a.offset) (and (= foo_~i~0 0) (<= 0 ~a.offset)))), 6702#(and (or (and (= foo_~i~0 0) (<= 0 ~a.offset)) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 6703#(and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (and (or (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 24)) (<= (* 4 foo_~i~0) (+ ~a.offset 3))) (<= (* 4 foo_~i~0) (+ ~a.offset 4))) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)))), 6704#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)) (or (<= 29 (+ ~b.offset (* 4 ~n))) (and (<= (* 4 foo_~i~0) (+ ~a.offset 8)) (or (<= (* 4 foo_~i~0) (+ ~a.offset 7)) (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 20)))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)))), 6705#(and (or (and (<= (* 4 foo_~i~0) (+ ~a.offset 12)) (or (<= (* 4 foo_~i~0) (+ ~a.offset 11)) (= (+ ~b.offset (* 4 ~n)) (+ (* 4 foo_~i~0) 16)))) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8))), 6706#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~a.offset 19)) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)) (<= 5 ~b.offset))), 6707#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~a.offset 19)) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)) (<= 5 ~b.offset))), 6708#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~a.offset 23)) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)) (<= 5 ~b.offset)) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16))), 6709#(and (or (<= (* 4 ~n) 20) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 29 (+ ~b.offset (* 4 ~n))) (<= (+ ~b.offset (* 4 ~n)) (+ ~a.offset 27)) (<= 5 ~b.offset))), 6710#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 0 ~a.offset)), 6711#(and (= ~n |main_#t~mem10|) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= 0 ~a.offset)), 6712#(and (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset))] [2018-02-04 02:40:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:50,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 02:40:50,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 02:40:50,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:40:50,952 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 34 states. [2018-02-04 02:40:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:53,032 INFO L93 Difference]: Finished difference Result 178 states and 183 transitions. [2018-02-04 02:40:53,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 02:40:53,032 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-02-04 02:40:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:53,033 INFO L225 Difference]: With dead ends: 178 [2018-02-04 02:40:53,033 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 02:40:53,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=581, Invalid=4531, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 02:40:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 02:40:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2018-02-04 02:40:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 02:40:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 160 transitions. [2018-02-04 02:40:53,036 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 160 transitions. Word has length 88 [2018-02-04 02:40:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:53,037 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 160 transitions. [2018-02-04 02:40:53,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 02:40:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2018-02-04 02:40:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 02:40:53,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:53,037 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:53,038 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash -424693361, now seen corresponding path program 12 times [2018-02-04 02:40:53,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:53,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 02:40:53,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:53,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:40:53,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:53,165 INFO L182 omatonBuilderFactory]: Interpolants [7136#(<= foo_~i~0 5), 7137#(<= ~n 6), 7122#true, 7123#false, 7124#(<= 1 ~n), 7125#(<= 2 ~n), 7126#(<= 3 ~n), 7127#(<= 4 ~n), 7128#(<= 5 ~n), 7129#(<= 6 ~n), 7130#(<= 7 ~n), 7131#(= foo_~i~0 0), 7132#(<= foo_~i~0 1), 7133#(<= foo_~i~0 2), 7134#(<= foo_~i~0 3), 7135#(<= foo_~i~0 4)] [2018-02-04 02:40:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 02:40:53,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:40:53,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:40:53,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:40:53,166 INFO L87 Difference]: Start difference. First operand 155 states and 160 transitions. Second operand 16 states. [2018-02-04 02:40:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:53,338 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-02-04 02:40:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:40:53,339 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-02-04 02:40:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:53,340 INFO L225 Difference]: With dead ends: 173 [2018-02-04 02:40:53,340 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 02:40:53,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:40:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 02:40:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 93. [2018-02-04 02:40:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 02:40:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-02-04 02:40:53,342 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 91 [2018-02-04 02:40:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:53,342 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-02-04 02:40:53,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:40:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-02-04 02:40:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 02:40:53,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:53,343 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:53,343 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1797486475, now seen corresponding path program 13 times [2018-02-04 02:40:53,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:53,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 32 proven. 85 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 02:40:53,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:53,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:40:53,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:53,448 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 02:40:53,448 INFO L182 omatonBuilderFactory]: Interpolants [7456#(<= 7 ~n), 7442#true, 7443#false, 7444#(<= ~n 1), 7445#(<= ~n 2), 7446#(<= ~n 3), 7447#(<= ~n 4), 7448#(<= ~n 5), 7449#(<= ~n 6), 7450#(= foo_~i~0 0), 7451#(<= 1 foo_~i~0), 7452#(<= 2 foo_~i~0), 7453#(<= 3 foo_~i~0), 7454#(<= 4 foo_~i~0), 7455#(<= 5 foo_~i~0)] [2018-02-04 02:40:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 32 proven. 85 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 02:40:53,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:40:53,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:40:53,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:40:53,450 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 15 states. [2018-02-04 02:40:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:53,641 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2018-02-04 02:40:53,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:40:53,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-02-04 02:40:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:53,641 INFO L225 Difference]: With dead ends: 153 [2018-02-04 02:40:53,641 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 02:40:53,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:40:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 02:40:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 02:40:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 02:40:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-02-04 02:40:53,643 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 92 [2018-02-04 02:40:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:53,644 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-02-04 02:40:53,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:40:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-02-04 02:40:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 02:40:53,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:53,644 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:53,644 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1800181926, now seen corresponding path program 14 times [2018-02-04 02:40:53,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:53,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 02:40:53,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:53,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:40:53,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:53,773 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 02:40:53,773 INFO L182 omatonBuilderFactory]: Interpolants [7726#true, 7727#false, 7728#(<= 1 ~n), 7729#(<= 2 ~n), 7730#(<= 3 ~n), 7731#(<= 4 ~n), 7732#(<= 5 ~n), 7733#(<= 6 ~n), 7734#(<= 7 ~n), 7735#(= foo_~i~0 0), 7736#(<= foo_~i~0 1), 7737#(<= foo_~i~0 2), 7738#(<= foo_~i~0 3), 7739#(<= foo_~i~0 4), 7740#(<= foo_~i~0 5), 7741#(<= foo_~i~0 6), 7742#(<= ~n 6)] [2018-02-04 02:40:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 02:40:53,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:40:53,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:40:53,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:40:53,774 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 17 states. [2018-02-04 02:40:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:53,915 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-02-04 02:40:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:40:53,916 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-02-04 02:40:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:53,916 INFO L225 Difference]: With dead ends: 110 [2018-02-04 02:40:53,916 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 02:40:53,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:40:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 02:40:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-02-04 02:40:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 02:40:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-02-04 02:40:53,919 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2018-02-04 02:40:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:53,919 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-02-04 02:40:53,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:40:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-02-04 02:40:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 02:40:53,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:53,920 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:53,920 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1419901777, now seen corresponding path program 15 times [2018-02-04 02:40:53,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:53,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 86 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-04 02:40:55,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:55,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 02:40:55,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:55,077 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 02:40:55,078 INFO L182 omatonBuilderFactory]: Interpolants [7969#true, 7970#false, 7971#(<= 1 ~n), 7972#(<= 2 ~n), 7973#(<= 3 ~n), 7974#(<= 4 ~n), 7975#(<= 5 ~n), 7976#(<= 6 ~n), 7977#(<= 7 ~n), 7978#(and (= 0 |main_#t~malloc6.offset|) (<= 7 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 7979#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 7 ~n)), 7980#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 7 ~n)), 7981#(and (= |main_#t~post8.offset| 0) (= ~a.offset 0) (or (and (= ~b.base |main_#t~post8.base|) (<= (+ |main_#t~post8.offset| 32) (+ ~b.offset (* 4 ~n))) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base))) (not (= ~b.offset 4))) (<= ~b.offset 4)), 7982#(and (= ~a.offset 0) (<= ~b.offset 4) (or (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 28 (* 4 ~n))) (not (= ~b.offset 4)))), 7983#(= |#memory_int| |old(#memory_int)|), 7984#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 7985#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 7986#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= (+ (* 4 foo_~i~0) 1) (* 4 ~n)) (= (* 4 ~n) (* 4 foo_~i~0)))), 7987#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 7988#(or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 7989#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4) (not (= ~b.offset 4))), 7990#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8) (not (= ~b.offset 4))), 7991#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 7992#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16) (not (= ~b.offset 4))), 7993#(or (and (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16))) (= ~a.base ~b.base) (not (= ~b.offset 4))), 7994#(or (and (or (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))) (= ~a.base ~b.base) (not (= ~b.offset 4))), 7995#(or (= ~a.base ~b.base) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 24))) (not (= ~b.offset 4))), 7996#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= ~b.offset 4))) (<= ~b.offset 4)), 7997#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= ~b.offset 4)), 7998#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|) (= ~b.offset 4))] [2018-02-04 02:40:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 86 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-04 02:40:55,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 02:40:55,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 02:40:55,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:40:55,078 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 30 states. [2018-02-04 02:40:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:56,840 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-02-04 02:40:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 02:40:56,840 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 99 [2018-02-04 02:40:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:56,841 INFO L225 Difference]: With dead ends: 111 [2018-02-04 02:40:56,841 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 02:40:56,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1005, Invalid=3825, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 02:40:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 02:40:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-02-04 02:40:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 02:40:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-02-04 02:40:56,843 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 99 [2018-02-04 02:40:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:56,844 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-02-04 02:40:56,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 02:40:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-02-04 02:40:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-04 02:40:56,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:56,844 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:56,845 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1134797882, now seen corresponding path program 16 times [2018-02-04 02:40:56,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:56,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 106 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 02:40:57,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:57,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:40:57,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:57,154 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 02:40:57,154 INFO L182 omatonBuilderFactory]: Interpolants [8294#true, 8295#false, 8296#(<= ~n 1), 8297#(<= ~n 2), 8298#(<= ~n 3), 8299#(<= ~n 4), 8300#(<= ~n 5), 8301#(<= ~n 6), 8302#(<= ~n 7), 8303#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 7) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 8304#(and (= |main_#t~post8.offset| 0) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 24)) (= (* 4 ~n) (select |#length| ~b.base))), 8305#(and (<= (* 4 ~n) (+ ~b.offset 24)) (= (* 4 ~n) (select |#length| ~b.base))), 8306#(= foo_~i~0 0), 8307#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8308#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8309#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8310#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8311#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8312#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 8313#(or (<= (+ ~b.offset 28) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-04 02:40:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 106 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 02:40:57,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:40:57,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:40:57,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:40:57,154 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 20 states. [2018-02-04 02:40:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:57,553 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-02-04 02:40:57,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:40:57,553 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2018-02-04 02:40:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:57,554 INFO L225 Difference]: With dead ends: 173 [2018-02-04 02:40:57,554 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 02:40:57,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:40:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 02:40:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-02-04 02:40:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 02:40:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-02-04 02:40:57,555 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 103 [2018-02-04 02:40:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:57,555 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-02-04 02:40:57,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:40:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-02-04 02:40:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 02:40:57,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:57,556 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:57,556 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash -291435573, now seen corresponding path program 17 times [2018-02-04 02:40:57,557 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:57,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 84 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 02:40:57,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:57,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:40:57,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:57,689 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 02:40:57,689 INFO L182 omatonBuilderFactory]: Interpolants [8640#(<= foo_~i~0 7), 8641#(<= ~n 7), 8623#true, 8624#false, 8625#(<= 1 ~n), 8626#(<= 2 ~n), 8627#(<= 3 ~n), 8628#(<= 4 ~n), 8629#(<= 5 ~n), 8630#(<= 6 ~n), 8631#(<= 7 ~n), 8632#(<= 8 ~n), 8633#(= foo_~i~0 0), 8634#(<= foo_~i~0 1), 8635#(<= foo_~i~0 2), 8636#(<= foo_~i~0 3), 8637#(<= foo_~i~0 4), 8638#(<= foo_~i~0 5), 8639#(<= foo_~i~0 6)] [2018-02-04 02:40:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 84 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 02:40:57,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:40:57,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:40:57,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:40:57,690 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 19 states. [2018-02-04 02:40:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:57,814 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-02-04 02:40:57,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:40:57,815 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 106 [2018-02-04 02:40:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:57,815 INFO L225 Difference]: With dead ends: 121 [2018-02-04 02:40:57,815 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 02:40:57,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:40:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 02:40:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-02-04 02:40:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 02:40:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-02-04 02:40:57,817 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 106 [2018-02-04 02:40:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:57,817 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-02-04 02:40:57,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:40:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-02-04 02:40:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 02:40:57,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:57,817 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:57,817 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:40:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1856187308, now seen corresponding path program 18 times [2018-02-04 02:40:57,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:57,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 91 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:59,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:59,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 02:40:59,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:59,586 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 02:40:59,586 INFO L182 omatonBuilderFactory]: Interpolants [8896#(and (<= 3 ~n) (<= ~n 3)), 8897#(and (<= 4 ~n) (<= ~n 4)), 8898#(and (<= ~n 5) (<= 5 ~n)), 8899#(and (<= 6 ~n) (<= ~n 6)), 8900#(and (<= ~n 7) (<= 7 ~n)), 8901#(and (<= 8 ~n) (<= ~n 8)), 8902#(and (<= 8 ~n) (= 0 |main_#t~malloc6.offset|) (<= ~n 8) (= (select |#valid| |main_#t~malloc6.base|) 1)), 8903#(and (<= 8 ~n) (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 8)), 8904#(and (<= 8 ~n) (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= ~n 8)), 8905#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= (+ |main_#t~post8.offset| 28) (+ ~b.offset (* 3 ~n))) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 36))), 8906#(and (<= 4 ~b.offset) (<= (+ ~b.offset (* 4 ~n)) 36) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset 4) ~n)), 8907#(= |#memory_int| |old(#memory_int)|), 8908#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 8909#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 8910#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (< 7 (+ (* 4 foo_~i~0) ~a.offset))), 8911#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset))), 8912#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 8913#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 20 (+ (* 4 foo_~i~0) ~a.offset))), 8914#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 24 (+ (* 4 foo_~i~0) ~a.offset))), 8915#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 28 (+ (* 4 foo_~i~0) ~a.offset))), 8916#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n) (<= 28 (+ (* 4 foo_~i~0) ~a.offset))), 8917#(and (or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 33 (+ ~a.offset (* 4 ~n)))) (<= 32 (+ ~a.offset (* 4 ~n)))), 8918#(and (= foo_~i~0 0) (or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 33 (+ ~a.offset (* 4 ~n)))) (<= 32 (+ ~a.offset (* 4 ~n)))), 8919#(and (= foo_~i~0 0) (or (<= 37 (+ ~b.offset (* 4 ~n))) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3))) (<= 32 (+ ~a.offset (* 4 ~n)))), 8920#(and (or (<= (+ (* 4 foo_~i~0) 29) (+ ~a.offset (* 4 ~n))) (<= 37 (+ ~b.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (<= ~b.offset (+ ~a.offset 3))) (<= (+ (* 4 foo_~i~0) 28) (+ ~a.offset (* 4 ~n)))), 8921#(and (<= (+ (* 4 foo_~i~0) 24) (+ ~a.offset (* 4 ~n))) (or (<= 37 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3))) (= ~b.offset (+ ~a.offset 4))) (<= (+ (* 4 foo_~i~0) 25) (+ ~a.offset (* 4 ~n))))), 8922#(and (<= (+ (* 4 foo_~i~0) 20) (+ ~a.offset (* 4 ~n))) (or (<= (+ (* 4 foo_~i~0) 21) (+ ~a.offset (* 4 ~n))) (<= 37 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3))) (= ~b.offset (+ ~a.offset 4))))), 8923#(and (<= (+ (* 4 foo_~i~0) 16) (+ ~a.offset (* 4 ~n))) (or (<= (+ (* 4 foo_~i~0) 17) (+ ~a.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (= ~a.base ~b.base) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 11)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3)))) (<= 37 (+ ~b.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)))), 8924#(and (or (<= 37 (+ ~b.offset (* 4 ~n))) (and (= ~b.offset (+ ~a.offset 4)) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 15)) (<= ~n (+ ~b.offset 3)))) (<= ~b.offset (+ ~a.offset 3)) (<= (+ (* 4 foo_~i~0) 13) (+ ~a.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) 12) (+ ~a.offset (* 4 ~n)))), 8925#(or (<= 37 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset) (and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3))) (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)))), 8926#(or (<= 37 (+ ~b.offset (* 4 ~n))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3)))) (<= 5 ~b.offset)), 8927#(or (<= 37 (+ ~b.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 23)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3)))) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset)), 8928#(or (<= 37 (+ ~b.offset (* 4 ~n))) (and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n (+ ~b.offset 3))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (<= ~b.offset (+ ~a.offset 3)) (<= 5 ~b.offset)), 8929#(and (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 8930#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 8931#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|)), 8892#true, 8893#false, 8894#(and (<= 1 ~n) (<= ~n 1)), 8895#(and (<= ~n 2) (<= 2 ~n))] [2018-02-04 02:40:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 91 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:59,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 02:40:59,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 02:40:59,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:40:59,587 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 40 states. [2018-02-04 02:41:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:01,995 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2018-02-04 02:41:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 02:41:01,995 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 110 [2018-02-04 02:41:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:01,996 INFO L225 Difference]: With dead ends: 212 [2018-02-04 02:41:01,996 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 02:41:01,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=760, Invalid=6212, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 02:41:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 02:41:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 193. [2018-02-04 02:41:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 02:41:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 198 transitions. [2018-02-04 02:41:01,999 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 198 transitions. Word has length 110 [2018-02-04 02:41:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:01,999 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 198 transitions. [2018-02-04 02:41:01,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 02:41:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 198 transitions. [2018-02-04 02:41:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 02:41:01,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:02,000 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:02,000 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash -522713937, now seen corresponding path program 19 times [2018-02-04 02:41:02,000 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:02,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 108 proven. 98 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 02:41:02,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:02,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 02:41:02,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:02,265 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 02:41:02,265 INFO L182 omatonBuilderFactory]: Interpolants [9440#(<= foo_~i~0 4), 9441#(<= foo_~i~0 5), 9442#(<= foo_~i~0 6), 9443#(<= foo_~i~0 7), 9444#(<= ~n 8), 9425#true, 9426#false, 9427#(<= 1 ~n), 9428#(<= 2 ~n), 9429#(<= 3 ~n), 9430#(<= 4 ~n), 9431#(<= 5 ~n), 9432#(<= 6 ~n), 9433#(<= 7 ~n), 9434#(<= 8 ~n), 9435#(<= 9 ~n), 9436#(= foo_~i~0 0), 9437#(<= foo_~i~0 1), 9438#(<= foo_~i~0 2), 9439#(<= foo_~i~0 3)] [2018-02-04 02:41:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 108 proven. 98 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 02:41:02,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 02:41:02,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 02:41:02,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:41:02,266 INFO L87 Difference]: Start difference. First operand 193 states and 198 transitions. Second operand 20 states. [2018-02-04 02:41:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:02,575 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-02-04 02:41:02,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:41:02,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-02-04 02:41:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:02,576 INFO L225 Difference]: With dead ends: 211 [2018-02-04 02:41:02,576 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 02:41:02,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=437, Invalid=895, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:41:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 02:41:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 115. [2018-02-04 02:41:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 02:41:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-02-04 02:41:02,578 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 113 [2018-02-04 02:41:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:02,578 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-02-04 02:41:02,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:41:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-02-04 02:41:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 02:41:02,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:02,579 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:02,579 INFO L371 AbstractCegarLoop]: === Iteration 40 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash -512700181, now seen corresponding path program 20 times [2018-02-04 02:41:02,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:02,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 72 proven. 140 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 02:41:02,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:02,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:41:02,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:02,764 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 02:41:02,764 INFO L182 omatonBuilderFactory]: Interpolants [9824#(<= ~n 2), 9825#(<= ~n 3), 9826#(<= ~n 4), 9827#(<= ~n 5), 9828#(<= ~n 6), 9829#(<= ~n 7), 9830#(<= ~n 8), 9831#(= foo_~i~0 0), 9832#(<= 1 foo_~i~0), 9833#(<= 2 foo_~i~0), 9834#(<= 3 foo_~i~0), 9835#(<= 4 foo_~i~0), 9836#(<= 5 foo_~i~0), 9837#(<= 6 foo_~i~0), 9838#(<= 7 foo_~i~0), 9839#(<= 9 ~n), 9821#true, 9822#false, 9823#(<= ~n 1)] [2018-02-04 02:41:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 72 proven. 140 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 02:41:02,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:41:02,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:41:02,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:41:02,765 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 19 states. [2018-02-04 02:41:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:03,121 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2018-02-04 02:41:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:41:03,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 114 [2018-02-04 02:41:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:03,122 INFO L225 Difference]: With dead ends: 191 [2018-02-04 02:41:03,122 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 02:41:03,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:41:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 02:41:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-04 02:41:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 02:41:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-02-04 02:41:03,124 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 114 [2018-02-04 02:41:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:03,125 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-02-04 02:41:03,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:41:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-02-04 02:41:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 02:41:03,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:03,125 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:03,126 INFO L371 AbstractCegarLoop]: === Iteration 41 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:03,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1529455674, now seen corresponding path program 21 times [2018-02-04 02:41:03,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:03,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 02:41:03,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:03,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:41:03,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:03,340 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 02:41:03,340 INFO L182 omatonBuilderFactory]: Interpolants [10176#false, 10177#(<= 1 ~n), 10178#(<= 2 ~n), 10179#(<= 3 ~n), 10180#(<= 4 ~n), 10181#(<= 5 ~n), 10182#(<= 6 ~n), 10183#(<= 7 ~n), 10184#(<= 8 ~n), 10185#(<= 9 ~n), 10186#(= foo_~i~0 0), 10187#(<= foo_~i~0 1), 10188#(<= foo_~i~0 2), 10189#(<= foo_~i~0 3), 10190#(<= foo_~i~0 4), 10191#(<= foo_~i~0 5), 10192#(<= foo_~i~0 6), 10193#(<= foo_~i~0 7), 10194#(<= foo_~i~0 8), 10195#(<= ~n 8), 10175#true] [2018-02-04 02:41:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 108 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-04 02:41:03,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:41:03,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:41:03,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:41:03,341 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 21 states. [2018-02-04 02:41:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:03,526 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-02-04 02:41:03,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:41:03,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-02-04 02:41:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:03,527 INFO L225 Difference]: With dead ends: 132 [2018-02-04 02:41:03,527 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 02:41:03,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=295, Invalid=635, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:41:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 02:41:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-02-04 02:41:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 02:41:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-02-04 02:41:03,529 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 117 [2018-02-04 02:41:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:03,529 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-02-04 02:41:03,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:41:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-02-04 02:41:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 02:41:03,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:03,529 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:03,529 INFO L371 AbstractCegarLoop]: === Iteration 42 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1776114225, now seen corresponding path program 22 times [2018-02-04 02:41:03,530 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:03,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 120 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:41:05,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:05,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 02:41:05,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:05,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 02:41:05,311 INFO L182 omatonBuilderFactory]: Interpolants [10496#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n) (<= 32 (+ (* 4 foo_~i~0) ~a.offset))), 10497#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 36 (+ ~a.offset (* 4 ~n)))), 10498#(and (or (<= 36 (+ ~a.offset (* 4 ~n))) (< (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 32)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 10499#(and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 27)) (and (<= (+ (* 4 foo_~i~0) ~b.offset 64) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (or (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 68)) (<= (+ (* 4 foo_~i~0) ~b.offset 65) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n))))) (not (= (* 4 ~n) (select |#length| ~b.base))))), 10500#(and (or (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 61) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 64)) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) ~b.offset 60) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n)))) (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 23)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4))), 10501#(and (or (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 57) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 60)) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) ~b.offset 56) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n)))) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 19))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8))), 10502#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 15)) (and (<= (+ (* 4 foo_~i~0) ~b.offset 52) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (or (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 56)) (<= (+ (* 4 foo_~i~0) ~b.offset 53) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n))))) (not (= (* 4 ~n) (select |#length| ~b.base))))), 10503#(and (or (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 11)) (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 49) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 52)) (<= ~b.offset (+ ~a.offset 3)) (<= 41 (+ ~b.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) ~b.offset 48) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n)))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16))), 10504#(and (or (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 45) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (= (+ (select |#length| ~b.base) (* 4 ~n)) (+ (* 4 foo_~i~0) 48)) (<= 41 (+ ~b.offset (* 4 ~n)))) (<= (+ (* 4 foo_~i~0) ~b.offset 44) (+ (select |#length| ~b.base) ~a.offset (* 4 ~n)))) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 7))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 10505#(and (or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= 37 (select |#length| ~b.base)) (<= (select |#length| ~b.base) (+ (* 4 foo_~i~0) ~b.offset 3)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 41 (+ ~b.offset (* 4 ~n))))), 10506#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= 37 (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 41 (+ ~b.offset (* 4 ~n)))) (or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 10507#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= 37 (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 41 (+ ~b.offset (* 4 ~n))))), 10508#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= 37 (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 41 (+ ~b.offset (* 4 ~n)))) (or (<= (* 4 ~n) 32) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 10509#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 10510#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 10511#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|)), 10470#true, 10471#false, 10472#(and (<= 1 ~n) (<= ~n 1)), 10473#(and (<= ~n 2) (<= 2 ~n)), 10474#(and (<= 3 ~n) (<= ~n 3)), 10475#(and (<= 4 ~n) (<= ~n 4)), 10476#(and (<= ~n 5) (<= 5 ~n)), 10477#(and (<= 6 ~n) (<= ~n 6)), 10478#(and (<= ~n 7) (<= 7 ~n)), 10479#(and (<= 8 ~n) (<= ~n 8)), 10480#(and (<= ~n 9) (<= 9 ~n)), 10481#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 9) (<= 9 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 10482#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 9) (<= 9 ~n)), 10483#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= ~n 9) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 9 ~n)), 10484#(and (= ~b.base |main_#t~post8.base|) (= 4 ~b.offset) (<= (+ |main_#t~post8.offset| 40) (+ ~b.offset (* 4 ~n))) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)) (= (+ |main_#t~post8.offset| 4) ~b.offset) (<= (+ ~b.offset (* 4 ~n)) (+ |main_#t~post8.offset| 40))), 10485#(and (= 4 ~b.offset) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~n 9) (<= 36 (* 4 ~n)) (= (* 4 ~n) (select |#length| ~b.base))), 10486#(= |#memory_int| |old(#memory_int)|), 10487#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 10488#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 10489#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset))), 10490#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset))), 10491#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 10492#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 20 (+ (* 4 foo_~i~0) ~a.offset))), 10493#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 24 (+ (* 4 foo_~i~0) ~a.offset))), 10494#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 28 (+ (* 4 foo_~i~0) ~a.offset))), 10495#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 32 (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:41:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 120 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:41:05,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 02:41:05,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 02:41:05,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1572, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:41:05,312 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 42 states. [2018-02-04 02:41:07,285 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 164 DAG size of output 102 [2018-02-04 02:41:07,546 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 161 DAG size of output 107 [2018-02-04 02:41:07,810 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 155 DAG size of output 104 [2018-02-04 02:41:08,044 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 144 DAG size of output 99 [2018-02-04 02:41:08,281 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 138 DAG size of output 96 [2018-02-04 02:41:08,515 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 128 DAG size of output 92 [2018-02-04 02:41:08,741 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 122 DAG size of output 89 [2018-02-04 02:41:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:10,651 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2018-02-04 02:41:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 02:41:10,651 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2018-02-04 02:41:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:10,652 INFO L225 Difference]: With dead ends: 235 [2018-02-04 02:41:10,652 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 02:41:10,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3406 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1362, Invalid=10628, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 02:41:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 02:41:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2018-02-04 02:41:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 02:41:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2018-02-04 02:41:10,656 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 121 [2018-02-04 02:41:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:10,656 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2018-02-04 02:41:10,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 02:41:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2018-02-04 02:41:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 02:41:10,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:10,657 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:10,657 INFO L371 AbstractCegarLoop]: === Iteration 43 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:10,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1726955156, now seen corresponding path program 23 times [2018-02-04 02:41:10,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:10,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 135 proven. 128 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 02:41:10,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:10,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:41:10,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:10,763 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 02:41:10,763 INFO L182 omatonBuilderFactory]: Interpolants [11104#(<= 7 ~n), 11105#(<= 8 ~n), 11106#(<= 9 ~n), 11107#(<= 10 ~n), 11108#(= foo_~i~0 0), 11109#(<= foo_~i~0 1), 11110#(<= foo_~i~0 2), 11111#(<= foo_~i~0 3), 11112#(<= foo_~i~0 4), 11113#(<= foo_~i~0 5), 11114#(<= foo_~i~0 6), 11115#(<= foo_~i~0 7), 11116#(<= foo_~i~0 8), 11117#(<= ~n 9), 11096#true, 11097#false, 11098#(<= 1 ~n), 11099#(<= 2 ~n), 11100#(<= 3 ~n), 11101#(<= 4 ~n), 11102#(<= 5 ~n), 11103#(<= 6 ~n)] [2018-02-04 02:41:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 135 proven. 128 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 02:41:10,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:41:10,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:41:10,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:41:10,764 INFO L87 Difference]: Start difference. First operand 212 states and 217 transitions. Second operand 22 states. [2018-02-04 02:41:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:10,998 INFO L93 Difference]: Finished difference Result 230 states and 234 transitions. [2018-02-04 02:41:10,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:41:10,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 124 [2018-02-04 02:41:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:10,999 INFO L225 Difference]: With dead ends: 230 [2018-02-04 02:41:10,999 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 02:41:10,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=540, Invalid=1100, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:41:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 02:41:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 126. [2018-02-04 02:41:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 02:41:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-02-04 02:41:11,001 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 124 [2018-02-04 02:41:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:11,002 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-02-04 02:41:11,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:41:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-02-04 02:41:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 02:41:11,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:11,002 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:11,002 INFO L371 AbstractCegarLoop]: === Iteration 44 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2085917466, now seen corresponding path program 24 times [2018-02-04 02:41:11,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:11,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 105 proven. 165 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 02:41:11,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:11,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:41:11,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:11,257 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 02:41:11,257 INFO L182 omatonBuilderFactory]: Interpolants [11530#true, 11531#false, 11532#(<= ~n 1), 11533#(<= ~n 2), 11534#(<= ~n 3), 11535#(<= ~n 4), 11536#(<= ~n 5), 11537#(<= ~n 6), 11538#(<= ~n 7), 11539#(<= ~n 8), 11540#(<= ~n 9), 11541#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 9) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 11542#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 32))), 11543#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 32))), 11544#(= foo_~i~0 0), 11545#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11546#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11547#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11548#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11549#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11550#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11551#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11552#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11553#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 11554#(or (<= (+ ~b.offset 36) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-04 02:41:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 105 proven. 165 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 02:41:11,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:41:11,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:41:11,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:41:11,257 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 25 states. [2018-02-04 02:41:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:11,793 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-02-04 02:41:11,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:41:11,793 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 125 [2018-02-04 02:41:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:11,793 INFO L225 Difference]: With dead ends: 211 [2018-02-04 02:41:11,794 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 02:41:11,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:41:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 02:41:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-02-04 02:41:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 02:41:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-02-04 02:41:11,795 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 125 [2018-02-04 02:41:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:11,795 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-02-04 02:41:11,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:41:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-02-04 02:41:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 02:41:11,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:11,796 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:11,796 INFO L371 AbstractCegarLoop]: === Iteration 45 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2000952107, now seen corresponding path program 25 times [2018-02-04 02:41:11,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:11,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 135 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 02:41:11,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:11,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:41:11,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:11,922 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 02:41:11,923 INFO L182 omatonBuilderFactory]: Interpolants [11936#(<= 5 ~n), 11937#(<= 6 ~n), 11938#(<= 7 ~n), 11939#(<= 8 ~n), 11940#(<= 9 ~n), 11941#(<= 10 ~n), 11942#(= foo_~i~0 0), 11943#(<= foo_~i~0 1), 11944#(<= foo_~i~0 2), 11945#(<= foo_~i~0 3), 11946#(<= foo_~i~0 4), 11947#(<= foo_~i~0 5), 11948#(<= foo_~i~0 6), 11949#(<= foo_~i~0 7), 11950#(<= foo_~i~0 8), 11951#(<= foo_~i~0 9), 11952#(<= ~n 9), 11930#true, 11931#false, 11932#(<= 1 ~n), 11933#(<= 2 ~n), 11934#(<= 3 ~n), 11935#(<= 4 ~n)] [2018-02-04 02:41:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 135 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 02:41:11,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:41:11,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:41:11,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:41:11,923 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 23 states. [2018-02-04 02:41:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:12,095 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2018-02-04 02:41:12,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:41:12,096 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 128 [2018-02-04 02:41:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:12,096 INFO L225 Difference]: With dead ends: 143 [2018-02-04 02:41:12,096 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 02:41:12,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=357, Invalid=765, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:41:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 02:41:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-02-04 02:41:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 02:41:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-02-04 02:41:12,098 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2018-02-04 02:41:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:12,098 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-02-04 02:41:12,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:41:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-02-04 02:41:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 02:41:12,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:12,099 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:12,099 INFO L371 AbstractCegarLoop]: === Iteration 46 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1725145524, now seen corresponding path program 26 times [2018-02-04 02:41:12,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:12,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 170 proven. 191 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 02:41:13,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:13,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 02:41:13,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:13,342 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 02:41:13,342 INFO L182 omatonBuilderFactory]: Interpolants [12251#true, 12252#false, 12253#(<= 1 ~n), 12254#(<= 2 ~n), 12255#(<= 3 ~n), 12256#(<= 4 ~n), 12257#(<= 5 ~n), 12258#(<= 6 ~n), 12259#(<= 7 ~n), 12260#(<= 8 ~n), 12261#(<= 9 ~n), 12262#(<= 10 ~n), 12263#(and (= 0 |main_#t~malloc6.offset|) (<= 10 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 12264#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 10 ~n)), 12265#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 10 ~n)), 12266#(and (or (not (= 4 ~b.offset)) (and (<= (+ |main_#t~post8.offset| 44) (+ ~b.offset (* 4 ~n))) (= (* 4 ~n) (select |#length| ~b.base)))) (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= ~b.offset 4)), 12267#(and (= ~a.offset 0) (not (= ~a.base ~b.base)) (or (and (<= 40 (* 4 ~n)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 12268#(= |#memory_int| |old(#memory_int)|), 12269#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 12270#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 12271#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 12272#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12273#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12274#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 12275#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 12276#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12277#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 12278#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12279#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 12280#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 12281#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)))), 12282#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 12283#(or (and (or (<= (* 4 ~n) 36) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 12284#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 12285#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 12286#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-04 02:41:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 170 proven. 191 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 02:41:13,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 02:41:13,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 02:41:13,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:41:13,343 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 36 states. [2018-02-04 02:41:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:15,390 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-02-04 02:41:15,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 02:41:15,390 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 132 [2018-02-04 02:41:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:15,391 INFO L225 Difference]: With dead ends: 144 [2018-02-04 02:41:15,391 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 02:41:15,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1580, Invalid=5392, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 02:41:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 02:41:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-02-04 02:41:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 02:41:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-02-04 02:41:15,393 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 132 [2018-02-04 02:41:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:15,393 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-02-04 02:41:15,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 02:41:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-02-04 02:41:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 02:41:15,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:15,393 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:15,393 INFO L371 AbstractCegarLoop]: === Iteration 47 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1510075979, now seen corresponding path program 27 times [2018-02-04 02:41:15,394 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:15,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 136 proven. 199 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 02:41:15,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:15,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:41:15,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:15,663 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 02:41:15,663 INFO L182 omatonBuilderFactory]: Interpolants [12672#(<= ~n 7), 12673#(<= ~n 8), 12674#(<= ~n 9), 12675#(<= ~n 10), 12676#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 10) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 12677#(and (= |main_#t~post8.offset| 0) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 36)) (= (* 4 ~n) (select |#length| ~b.base))), 12678#(and (<= (* 4 ~n) (+ ~b.offset 36)) (= (* 4 ~n) (select |#length| ~b.base))), 12679#(= foo_~i~0 0), 12680#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12681#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12682#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12683#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12684#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12685#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12686#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12687#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12688#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12689#(or (<= (+ ~b.offset 40) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 12664#true, 12665#false, 12666#(<= ~n 1), 12667#(<= ~n 2), 12668#(<= ~n 3), 12669#(<= ~n 4), 12670#(<= ~n 5), 12671#(<= ~n 6)] [2018-02-04 02:41:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 136 proven. 199 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 02:41:15,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:41:15,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:41:15,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:41:15,664 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 26 states. [2018-02-04 02:41:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:16,111 INFO L93 Difference]: Finished difference Result 230 states and 233 transitions. [2018-02-04 02:41:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:41:16,111 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 136 [2018-02-04 02:41:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:16,112 INFO L225 Difference]: With dead ends: 230 [2018-02-04 02:41:16,112 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 02:41:16,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:41:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 02:41:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-02-04 02:41:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 02:41:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-04 02:41:16,113 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 136 [2018-02-04 02:41:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:16,113 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-04 02:41:16,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:41:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-04 02:41:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 02:41:16,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:16,114 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:16,114 INFO L371 AbstractCegarLoop]: === Iteration 48 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:16,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2001595674, now seen corresponding path program 28 times [2018-02-04 02:41:16,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:16,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 165 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 02:41:16,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:16,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:41:16,269 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:16,269 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 02:41:16,269 INFO L182 omatonBuilderFactory]: Interpolants [13120#(<= foo_~i~0 9), 13121#(<= foo_~i~0 10), 13122#(<= ~n 10), 13098#true, 13099#false, 13100#(<= 1 ~n), 13101#(<= 2 ~n), 13102#(<= 3 ~n), 13103#(<= 4 ~n), 13104#(<= 5 ~n), 13105#(<= 6 ~n), 13106#(<= 7 ~n), 13107#(<= 8 ~n), 13108#(<= 9 ~n), 13109#(<= 10 ~n), 13110#(<= 11 ~n), 13111#(= foo_~i~0 0), 13112#(<= foo_~i~0 1), 13113#(<= foo_~i~0 2), 13114#(<= foo_~i~0 3), 13115#(<= foo_~i~0 4), 13116#(<= foo_~i~0 5), 13117#(<= foo_~i~0 6), 13118#(<= foo_~i~0 7), 13119#(<= foo_~i~0 8)] [2018-02-04 02:41:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 165 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 02:41:16,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:41:16,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:41:16,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:41:16,270 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 25 states. [2018-02-04 02:41:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:16,432 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-02-04 02:41:16,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:41:16,432 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2018-02-04 02:41:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:16,433 INFO L225 Difference]: With dead ends: 154 [2018-02-04 02:41:16,433 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 02:41:16,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=425, Invalid=907, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:41:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 02:41:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2018-02-04 02:41:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 02:41:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-02-04 02:41:16,434 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 139 [2018-02-04 02:41:16,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:16,435 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-02-04 02:41:16,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:41:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-02-04 02:41:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-04 02:41:16,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:16,435 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:16,435 INFO L371 AbstractCegarLoop]: === Iteration 49 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -808371473, now seen corresponding path program 29 times [2018-02-04 02:41:16,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:16,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 204 proven. 232 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 02:41:17,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:17,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 02:41:17,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:17,743 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 02:41:17,743 INFO L182 omatonBuilderFactory]: Interpolants [13445#true, 13446#false, 13447#(<= 1 ~n), 13448#(<= 2 ~n), 13449#(<= 3 ~n), 13450#(<= 4 ~n), 13451#(<= 5 ~n), 13452#(<= 6 ~n), 13453#(<= 7 ~n), 13454#(<= 8 ~n), 13455#(<= 9 ~n), 13456#(<= 10 ~n), 13457#(<= 11 ~n), 13458#(and (= 0 |main_#t~malloc6.offset|) (<= 11 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 13459#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 11 ~n)), 13460#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 11 ~n)), 13461#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ |main_#t~post8.offset| 48) (+ ~b.offset (* 4 ~n)))), 13462#(and (<= 44 (* 4 ~n)) (<= 4 ~b.offset) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset 4)), 13463#(= |#memory_int| |old(#memory_int)|), 13464#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 13465#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 13466#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 13467#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13468#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13469#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 13470#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 13471#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13472#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 13473#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13474#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 13475#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 13476#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 13477#(and (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32))), 13478#(and (or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 13479#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 40)) (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 13480#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 13481#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 13482#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-04 02:41:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 204 proven. 232 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 02:41:17,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 02:41:17,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 02:41:17,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:41:17,744 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 38 states. [2018-02-04 02:41:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:19,769 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-02-04 02:41:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 02:41:19,770 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2018-02-04 02:41:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:19,770 INFO L225 Difference]: With dead ends: 155 [2018-02-04 02:41:19,770 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 02:41:19,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1963 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1823, Invalid=6009, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 02:41:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 02:41:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-04 02:41:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 02:41:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-02-04 02:41:19,773 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 143 [2018-02-04 02:41:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:19,773 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-02-04 02:41:19,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 02:41:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-02-04 02:41:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 02:41:19,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:19,774 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:19,774 INFO L371 AbstractCegarLoop]: === Iteration 50 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1808429574, now seen corresponding path program 30 times [2018-02-04 02:41:19,775 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:19,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 171 proven. 236 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 02:41:20,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:20,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 02:41:20,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:20,214 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 02:41:20,214 INFO L182 omatonBuilderFactory]: Interpolants [13888#true, 13889#false, 13890#(<= ~n 1), 13891#(<= ~n 2), 13892#(<= ~n 3), 13893#(<= ~n 4), 13894#(<= ~n 5), 13895#(<= ~n 6), 13896#(<= ~n 7), 13897#(<= ~n 8), 13898#(<= ~n 9), 13899#(<= ~n 10), 13900#(<= ~n 11), 13901#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 11) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 13902#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 40))), 13903#(and (<= (* 4 ~n) (+ ~b.offset 40)) (= (* 4 ~n) (select |#length| ~b.base))), 13904#(= foo_~i~0 0), 13905#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13906#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13907#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13908#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13909#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13910#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13911#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13912#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13913#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13914#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13915#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 13916#(or (<= (+ ~b.offset 44) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-04 02:41:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 171 proven. 236 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 02:41:20,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 02:41:20,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 02:41:20,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:41:20,215 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 29 states. [2018-02-04 02:41:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:20,878 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2018-02-04 02:41:20,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:41:20,902 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 147 [2018-02-04 02:41:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:20,903 INFO L225 Difference]: With dead ends: 249 [2018-02-04 02:41:20,903 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 02:41:20,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=346, Invalid=1546, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:41:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 02:41:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-02-04 02:41:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 02:41:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-02-04 02:41:20,905 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 147 [2018-02-04 02:41:20,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:20,905 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-02-04 02:41:20,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 02:41:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-02-04 02:41:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-02-04 02:41:20,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:20,906 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:20,906 INFO L371 AbstractCegarLoop]: === Iteration 51 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash -756355445, now seen corresponding path program 31 times [2018-02-04 02:41:20,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:20,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 198 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 02:41:21,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:21,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:41:21,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:21,086 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 02:41:21,086 INFO L182 omatonBuilderFactory]: Interpolants [14358#true, 14359#false, 14360#(<= 1 ~n), 14361#(<= 2 ~n), 14362#(<= 3 ~n), 14363#(<= 4 ~n), 14364#(<= 5 ~n), 14365#(<= 6 ~n), 14366#(<= 7 ~n), 14367#(<= 8 ~n), 14368#(<= 9 ~n), 14369#(<= 10 ~n), 14370#(<= 11 ~n), 14371#(<= 12 ~n), 14372#(= foo_~i~0 0), 14373#(<= foo_~i~0 1), 14374#(<= foo_~i~0 2), 14375#(<= foo_~i~0 3), 14376#(<= foo_~i~0 4), 14377#(<= foo_~i~0 5), 14378#(<= foo_~i~0 6), 14379#(<= foo_~i~0 7), 14380#(<= foo_~i~0 8), 14381#(<= foo_~i~0 9), 14382#(<= foo_~i~0 10), 14383#(<= foo_~i~0 11), 14384#(<= ~n 11)] [2018-02-04 02:41:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 198 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 02:41:21,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:41:21,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:41:21,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:41:21,087 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 27 states. [2018-02-04 02:41:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:21,314 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-02-04 02:41:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:41:21,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 150 [2018-02-04 02:41:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:21,315 INFO L225 Difference]: With dead ends: 165 [2018-02-04 02:41:21,315 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 02:41:21,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=499, Invalid=1061, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:41:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 02:41:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2018-02-04 02:41:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 02:41:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-02-04 02:41:21,317 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 150 [2018-02-04 02:41:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:21,317 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-02-04 02:41:21,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:41:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-02-04 02:41:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 02:41:21,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:21,318 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:21,318 INFO L371 AbstractCegarLoop]: === Iteration 52 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:21,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1115802860, now seen corresponding path program 32 times [2018-02-04 02:41:21,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:21,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 43 proven. 475 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 02:41:23,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:23,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 02:41:23,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:23,330 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 02:41:23,330 INFO L182 omatonBuilderFactory]: Interpolants [14731#true, 14732#false, 14733#(and (<= 1 ~n) (<= ~n 1)), 14734#(and (<= ~n 2) (<= 2 ~n)), 14735#(and (<= 3 ~n) (<= ~n 3)), 14736#(and (<= 4 ~n) (<= ~n 4)), 14737#(and (<= ~n 5) (<= 5 ~n)), 14738#(and (<= 6 ~n) (<= ~n 6)), 14739#(and (<= ~n 7) (<= 7 ~n)), 14740#(and (<= 8 ~n) (<= ~n 8)), 14741#(and (<= ~n 9) (<= 9 ~n)), 14742#(and (<= ~n 10) (<= 10 ~n)), 14743#(and (<= ~n 11) (<= 11 ~n)), 14744#(and (<= ~n 12) (<= 12 ~n)), 14745#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 12) (<= 12 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 14746#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 12) (<= 12 ~n)), 14747#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= ~n 12) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 12 ~n)), 14748#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ ~b.offset (* 3 ~n)) (+ |main_#t~post8.offset| 40)) (<= 12 ~n)), 14749#(and (= 4 ~b.offset) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~n 12) (<= 12 ~n)), 14750#(= |#memory_int| |old(#memory_int)|), 14751#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 14752#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 14753#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= 37 (+ ~a.offset (* 3 ~n))) (<= (+ (* 4 foo_~i~0) ~a.offset) (+ ~n 35)) (< foo_~i~0 (+ ~n 1)))), 14754#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14755#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14756#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 14757#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 14758#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14759#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 14760#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14761#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14762#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 14763#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 14764#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 14765#(and (or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~a.offset (* 3 ~n)) 35) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= 41 (+ ~b.offset (* 3 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 14766#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)) (or (<= (+ ~a.offset (* 3 ~n)) 35) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 41 (+ ~b.offset (* 3 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 14767#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 44)) (or (<= (+ ~a.offset (* 3 ~n)) 35) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= 41 (+ ~b.offset (* 3 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 14768#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 14769#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 14770#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-04 02:41:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 43 proven. 475 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 02:41:23,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 02:41:23,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 02:41:23,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:41:23,331 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 40 states. [2018-02-04 02:41:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:26,992 INFO L93 Difference]: Finished difference Result 292 states and 298 transitions. [2018-02-04 02:41:26,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-04 02:41:26,992 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-02-04 02:41:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:26,993 INFO L225 Difference]: With dead ends: 292 [2018-02-04 02:41:26,993 INFO L226 Difference]: Without dead ends: 287 [2018-02-04 02:41:26,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3783 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1966, Invalid=11606, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 02:41:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-04 02:41:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 269. [2018-02-04 02:41:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 02:41:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 274 transitions. [2018-02-04 02:41:26,997 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 274 transitions. Word has length 154 [2018-02-04 02:41:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:26,997 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 274 transitions. [2018-02-04 02:41:26,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 02:41:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 274 transitions. [2018-02-04 02:41:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 02:41:26,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:26,999 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:26,999 INFO L371 AbstractCegarLoop]: === Iteration 53 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash 471238383, now seen corresponding path program 33 times [2018-02-04 02:41:26,999 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:27,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 234 proven. 288 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 02:41:27,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:27,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 02:41:27,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:27,214 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 02:41:27,214 INFO L182 omatonBuilderFactory]: Interpolants [15488#false, 15489#(<= 1 ~n), 15490#(<= 2 ~n), 15491#(<= 3 ~n), 15492#(<= 4 ~n), 15493#(<= 5 ~n), 15494#(<= 6 ~n), 15495#(<= 7 ~n), 15496#(<= 8 ~n), 15497#(<= 9 ~n), 15498#(<= 10 ~n), 15499#(<= 11 ~n), 15500#(<= 12 ~n), 15501#(<= 13 ~n), 15502#(= foo_~i~0 0), 15503#(<= foo_~i~0 1), 15504#(<= foo_~i~0 2), 15505#(<= foo_~i~0 3), 15506#(<= foo_~i~0 4), 15507#(<= foo_~i~0 5), 15508#(<= foo_~i~0 6), 15509#(<= foo_~i~0 7), 15510#(<= foo_~i~0 8), 15511#(<= foo_~i~0 9), 15512#(<= foo_~i~0 10), 15513#(<= foo_~i~0 11), 15514#(<= foo_~i~0 12), 15515#(<= ~n 12), 15487#true] [2018-02-04 02:41:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 234 proven. 288 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 02:41:27,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 02:41:27,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 02:41:27,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:41:27,214 INFO L87 Difference]: Start difference. First operand 269 states and 274 transitions. Second operand 29 states. [2018-02-04 02:41:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:27,716 INFO L93 Difference]: Finished difference Result 366 states and 373 transitions. [2018-02-04 02:41:27,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 02:41:27,716 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 157 [2018-02-04 02:41:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:27,717 INFO L225 Difference]: With dead ends: 366 [2018-02-04 02:41:27,717 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 02:41:27,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1518, Invalid=3312, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 02:41:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 02:41:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 277. [2018-02-04 02:41:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-04 02:41:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 282 transitions. [2018-02-04 02:41:27,721 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 282 transitions. Word has length 157 [2018-02-04 02:41:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:27,721 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 282 transitions. [2018-02-04 02:41:27,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 02:41:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 282 transitions. [2018-02-04 02:41:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 02:41:27,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:27,722 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:27,722 INFO L371 AbstractCegarLoop]: === Iteration 54 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1279578027, now seen corresponding path program 34 times [2018-02-04 02:41:27,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:27,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 200 proven. 286 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 02:41:27,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:27,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:41:27,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:27,923 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 02:41:27,923 INFO L182 omatonBuilderFactory]: Interpolants [16256#(<= 1 foo_~i~0), 16257#(<= 2 foo_~i~0), 16258#(<= 3 foo_~i~0), 16259#(<= 4 foo_~i~0), 16260#(<= 5 foo_~i~0), 16261#(<= 6 foo_~i~0), 16262#(<= 7 foo_~i~0), 16263#(<= 8 foo_~i~0), 16264#(<= 9 foo_~i~0), 16265#(<= 10 foo_~i~0), 16266#(<= 11 foo_~i~0), 16267#(<= 13 ~n), 16241#true, 16242#false, 16243#(<= ~n 1), 16244#(<= ~n 2), 16245#(<= ~n 3), 16246#(<= ~n 4), 16247#(<= ~n 5), 16248#(<= ~n 6), 16249#(<= ~n 7), 16250#(<= ~n 8), 16251#(<= ~n 9), 16252#(<= ~n 10), 16253#(<= ~n 11), 16254#(<= ~n 12), 16255#(= foo_~i~0 0)] [2018-02-04 02:41:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 200 proven. 286 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-02-04 02:41:27,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:41:27,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:41:27,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:41:27,923 INFO L87 Difference]: Start difference. First operand 277 states and 282 transitions. Second operand 27 states. [2018-02-04 02:41:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:28,370 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2018-02-04 02:41:28,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:41:28,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 158 [2018-02-04 02:41:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:28,370 INFO L225 Difference]: With dead ends: 271 [2018-02-04 02:41:28,370 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 02:41:28,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=344, Invalid=1216, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:41:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 02:41:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-04 02:41:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 02:41:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-02-04 02:41:28,372 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 158 [2018-02-04 02:41:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:28,372 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-02-04 02:41:28,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:41:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-02-04 02:41:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-04 02:41:28,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:28,373 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:28,373 INFO L371 AbstractCegarLoop]: === Iteration 55 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash -955005937, now seen corresponding path program 35 times [2018-02-04 02:41:28,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:28,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 281 proven. 326 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-04 02:41:30,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:30,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 02:41:30,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:30,245 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 02:41:30,245 INFO L182 omatonBuilderFactory]: Interpolants [16768#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16769#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 16770#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 16771#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16772#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 16773#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16774#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16775#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 16776#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 16777#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 16778#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)), 16779#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 16780#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 16781#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 ~n) 48) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 16782#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 16783#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 16784#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|)), 16743#true, 16744#false, 16745#(<= 1 ~n), 16746#(<= 2 ~n), 16747#(<= 3 ~n), 16748#(<= 4 ~n), 16749#(<= 5 ~n), 16750#(<= 6 ~n), 16751#(<= 7 ~n), 16752#(<= 8 ~n), 16753#(<= 9 ~n), 16754#(<= 10 ~n), 16755#(<= 11 ~n), 16756#(<= 12 ~n), 16757#(<= 13 ~n), 16758#(and (= 0 |main_#t~malloc6.offset|) (<= 13 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 16759#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 13 ~n)), 16760#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= 13 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 16761#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (or (not (= 4 ~b.offset)) (and (<= (+ |main_#t~post8.offset| 56) (+ ~b.offset (* 4 ~n))) (= (* 4 ~n) (select |#length| ~b.base)))) (<= ~b.offset 4)), 16762#(and (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 52 (* 4 ~n))) (not (= 4 ~b.offset))) (= ~a.offset 0) (not (= ~a.base ~b.base)) (<= ~b.offset 4)), 16763#(= |#memory_int| |old(#memory_int)|), 16764#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 16765#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 16766#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (< foo_~i~0 (+ ~n 1))), 16767#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))] [2018-02-04 02:41:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 281 proven. 326 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-04 02:41:30,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 02:41:30,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 02:41:30,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:41:30,245 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 42 states. [2018-02-04 02:41:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:32,835 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-02-04 02:41:32,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 02:41:32,836 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 165 [2018-02-04 02:41:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:32,836 INFO L225 Difference]: With dead ends: 177 [2018-02-04 02:41:32,836 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 02:41:32,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 14 SyntacticMatches, 12 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2291, Invalid=7411, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 02:41:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 02:41:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-02-04 02:41:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 02:41:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-02-04 02:41:32,838 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 165 [2018-02-04 02:41:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:32,838 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-02-04 02:41:32,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 02:41:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-02-04 02:41:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 02:41:32,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:32,839 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:32,839 INFO L371 AbstractCegarLoop]: === Iteration 56 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:32,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2120444710, now seen corresponding path program 36 times [2018-02-04 02:41:32,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:32,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 253 proven. 319 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 02:41:33,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:33,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 02:41:33,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:33,270 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 02:41:33,270 INFO L182 omatonBuilderFactory]: Interpolants [17246#true, 17247#false, 17248#(<= ~n 1), 17249#(<= ~n 2), 17250#(<= ~n 3), 17251#(<= ~n 4), 17252#(<= ~n 5), 17253#(<= ~n 6), 17254#(<= ~n 7), 17255#(<= ~n 8), 17256#(<= ~n 9), 17257#(<= ~n 10), 17258#(<= ~n 11), 17259#(<= ~n 12), 17260#(<= ~n 13), 17261#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 13)), 17262#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 48))), 17263#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 48))), 17264#(= foo_~i~0 0), 17265#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17266#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17267#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17268#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17269#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17270#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17271#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17272#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17273#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17274#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17275#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17276#(or (<= 11 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17277#(or (<= 12 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 17278#(or (<= (+ ~b.offset 52) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-04 02:41:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 253 proven. 319 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 02:41:33,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 02:41:33,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 02:41:33,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:41:33,271 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 33 states. [2018-02-04 02:41:34,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:34,109 INFO L93 Difference]: Finished difference Result 287 states and 290 transitions. [2018-02-04 02:41:34,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 02:41:34,109 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 169 [2018-02-04 02:41:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:34,109 INFO L225 Difference]: With dead ends: 287 [2018-02-04 02:41:34,109 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 02:41:34,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=454, Invalid=1996, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:41:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 02:41:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-02-04 02:41:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 02:41:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-02-04 02:41:34,111 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 169 [2018-02-04 02:41:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:34,111 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-02-04 02:41:34,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 02:41:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-02-04 02:41:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 02:41:34,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:34,112 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:34,112 INFO L371 AbstractCegarLoop]: === Iteration 57 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1602455019, now seen corresponding path program 37 times [2018-02-04 02:41:34,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:34,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 273 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 02:41:34,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:34,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 02:41:34,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:34,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 02:41:34,328 INFO L182 omatonBuilderFactory]: Interpolants [17792#(<= 5 ~n), 17793#(<= 6 ~n), 17794#(<= 7 ~n), 17795#(<= 8 ~n), 17796#(<= 9 ~n), 17797#(<= 10 ~n), 17798#(<= 11 ~n), 17799#(<= 12 ~n), 17800#(<= 13 ~n), 17801#(<= 14 ~n), 17802#(= foo_~i~0 0), 17803#(<= foo_~i~0 1), 17804#(<= foo_~i~0 2), 17805#(<= foo_~i~0 3), 17806#(<= foo_~i~0 4), 17807#(<= foo_~i~0 5), 17808#(<= foo_~i~0 6), 17809#(<= foo_~i~0 7), 17810#(<= foo_~i~0 8), 17811#(<= foo_~i~0 9), 17812#(<= foo_~i~0 10), 17813#(<= foo_~i~0 11), 17814#(<= foo_~i~0 12), 17815#(<= foo_~i~0 13), 17816#(<= ~n 13), 17786#true, 17787#false, 17788#(<= 1 ~n), 17789#(<= 2 ~n), 17790#(<= 3 ~n), 17791#(<= 4 ~n)] [2018-02-04 02:41:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 273 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 02:41:34,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 02:41:34,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 02:41:34,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:41:34,328 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 31 states. [2018-02-04 02:41:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:34,594 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-02-04 02:41:34,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:41:34,594 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 172 [2018-02-04 02:41:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:34,595 INFO L225 Difference]: With dead ends: 187 [2018-02-04 02:41:34,595 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 02:41:34,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=665, Invalid=1405, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 02:41:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 02:41:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2018-02-04 02:41:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 02:41:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2018-02-04 02:41:34,596 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 172 [2018-02-04 02:41:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:34,597 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2018-02-04 02:41:34,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 02:41:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2018-02-04 02:41:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-02-04 02:41:34,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:34,597 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:34,597 INFO L371 AbstractCegarLoop]: === Iteration 58 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2051704948, now seen corresponding path program 38 times [2018-02-04 02:41:34,598 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:34,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 187 proven. 516 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-02-04 02:41:36,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:36,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 02:41:36,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:36,299 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 02:41:36,299 INFO L182 omatonBuilderFactory]: Interpolants [18240#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 3 foo_~i~0)), 18241#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 4 foo_~i~0)), 18242#(or (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 5 foo_~i~0)) (not (= 4 ~b.offset))), 18243#(or (not (= 4 ~b.offset)) (and (<= 6 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 18244#(or (not (= 4 ~b.offset)) (and (<= 7 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 18245#(or (not (= 4 ~b.offset)) (and (<= 8 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 18246#(or (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 9 foo_~i~0)) (not (= 4 ~b.offset))), 18247#(or (not (= 4 ~b.offset)) (and (<= 10 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 18248#(or (and (<= 11 foo_~i~0) (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (not (= 4 ~b.offset))), 18249#(or (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 12 foo_~i~0)) (not (= 4 ~b.offset))), 18250#(or (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (and (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~b.offset 53) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))) (<= 12 foo_~i~0))), 18251#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~b.offset 53) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 18252#(and (= 0 ~a.offset) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 18253#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= 0 ~a.offset)), 18254#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset)), 18211#true, 18212#false, 18213#(<= ~n 1), 18214#(<= ~n 2), 18215#(<= ~n 3), 18216#(<= ~n 4), 18217#(<= ~n 5), 18218#(<= ~n 6), 18219#(<= ~n 7), 18220#(<= ~n 8), 18221#(<= ~n 9), 18222#(<= ~n 10), 18223#(<= ~n 11), 18224#(<= ~n 12), 18225#(<= ~n 13), 18226#(<= ~n 14), 18227#(and (<= ~n 14) (= 0 |main_#t~malloc6.offset|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 18228#(and (<= ~n 14) (= (select |#valid| ~a.base) 1) (= 0 ~a.offset)), 18229#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= ~n 14) (= 0 ~a.offset) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 18230#(and (= 4 ~b.offset) (= ~b.base |main_#t~post8.base|) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 52)) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)) (= (+ |main_#t~post8.offset| 4) ~b.offset) (= 0 ~a.offset)), 18231#(and (= 0 ~a.offset) (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 52)))) (<= ~b.offset 4)), 18232#(= |#memory_int| |old(#memory_int)|), 18233#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 18234#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 18235#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 18236#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (= foo_~i~0 0)), 18237#(and (= foo_~i~0 0) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 18238#(and (<= 1 foo_~i~0) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))), 18239#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (<= 2 foo_~i~0))] [2018-02-04 02:41:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 187 proven. 516 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-02-04 02:41:36,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 02:41:36,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 02:41:36,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1663, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:41:36,300 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand 44 states. [2018-02-04 02:41:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:40,920 INFO L93 Difference]: Finished difference Result 308 states and 312 transitions. [2018-02-04 02:41:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-02-04 02:41:40,920 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 176 [2018-02-04 02:41:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:40,921 INFO L225 Difference]: With dead ends: 308 [2018-02-04 02:41:40,921 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 02:41:40,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 15 SyntacticMatches, 13 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6944 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2723, Invalid=19033, Unknown=0, NotChecked=0, Total=21756 [2018-02-04 02:41:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 02:41:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-02-04 02:41:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 02:41:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-02-04 02:41:40,923 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 176 [2018-02-04 02:41:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:40,924 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-02-04 02:41:40,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 02:41:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-02-04 02:41:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-04 02:41:40,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:40,925 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:40,925 INFO L371 AbstractCegarLoop]: === Iteration 59 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:40,925 INFO L82 PathProgramCache]: Analyzing trace with hash -469715441, now seen corresponding path program 39 times [2018-02-04 02:41:40,925 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:40,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 315 proven. 338 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 02:41:41,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:41,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 02:41:41,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:41,160 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 02:41:41,160 INFO L182 omatonBuilderFactory]: Interpolants [18951#true, 18952#false, 18953#(<= 1 ~n), 18954#(<= 2 ~n), 18955#(<= 3 ~n), 18956#(<= 4 ~n), 18957#(<= 5 ~n), 18958#(<= 6 ~n), 18959#(<= 7 ~n), 18960#(<= 8 ~n), 18961#(<= 9 ~n), 18962#(<= 10 ~n), 18963#(<= 11 ~n), 18964#(<= 12 ~n), 18965#(<= 13 ~n), 18966#(<= 14 ~n), 18967#(<= 15 ~n), 18968#(= foo_~i~0 0), 18969#(<= foo_~i~0 1), 18970#(<= foo_~i~0 2), 18971#(<= foo_~i~0 3), 18972#(<= foo_~i~0 4), 18973#(<= foo_~i~0 5), 18974#(<= foo_~i~0 6), 18975#(<= foo_~i~0 7), 18976#(<= foo_~i~0 8), 18977#(<= foo_~i~0 9), 18978#(<= foo_~i~0 10), 18979#(<= foo_~i~0 11), 18980#(<= foo_~i~0 12), 18981#(<= foo_~i~0 13), 18982#(<= ~n 14)] [2018-02-04 02:41:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 315 proven. 338 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 02:41:41,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 02:41:41,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 02:41:41,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:41:41,160 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 32 states. [2018-02-04 02:41:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:41,442 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-02-04 02:41:41,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:41:41,442 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 179 [2018-02-04 02:41:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:41,443 INFO L225 Difference]: With dead ends: 188 [2018-02-04 02:41:41,443 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 02:41:41,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=695, Invalid=1467, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:41:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 02:41:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2018-02-04 02:41:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 02:41:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-02-04 02:41:41,445 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 179 [2018-02-04 02:41:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:41,445 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-02-04 02:41:41,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 02:41:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-02-04 02:41:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-04 02:41:41,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:41,445 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:41,445 INFO L371 AbstractCegarLoop]: === Iteration 60 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:41,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1752736474, now seen corresponding path program 40 times [2018-02-04 02:41:41,446 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:41,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 315 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 02:41:41,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:41,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 02:41:41,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:41,701 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 02:41:41,701 INFO L182 omatonBuilderFactory]: Interpolants [19399#true, 19400#false, 19401#(<= 1 ~n), 19402#(<= 2 ~n), 19403#(<= 3 ~n), 19404#(<= 4 ~n), 19405#(<= 5 ~n), 19406#(<= 6 ~n), 19407#(<= 7 ~n), 19408#(<= 8 ~n), 19409#(<= 9 ~n), 19410#(<= 10 ~n), 19411#(<= 11 ~n), 19412#(<= 12 ~n), 19413#(<= 13 ~n), 19414#(<= 14 ~n), 19415#(<= 15 ~n), 19416#(= foo_~i~0 0), 19417#(<= foo_~i~0 1), 19418#(<= foo_~i~0 2), 19419#(<= foo_~i~0 3), 19420#(<= foo_~i~0 4), 19421#(<= foo_~i~0 5), 19422#(<= foo_~i~0 6), 19423#(<= foo_~i~0 7), 19424#(<= foo_~i~0 8), 19425#(<= foo_~i~0 9), 19426#(<= foo_~i~0 10), 19427#(<= foo_~i~0 11), 19428#(<= foo_~i~0 12), 19429#(<= foo_~i~0 13), 19430#(<= foo_~i~0 14), 19431#(<= ~n 14)] [2018-02-04 02:41:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 315 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-02-04 02:41:41,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 02:41:41,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 02:41:41,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:41:41,702 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 33 states. [2018-02-04 02:41:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:42,004 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2018-02-04 02:41:42,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:41:42,004 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 183 [2018-02-04 02:41:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:42,004 INFO L225 Difference]: With dead ends: 198 [2018-02-04 02:41:42,005 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 02:41:42,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=757, Invalid=1595, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 02:41:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 02:41:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2018-02-04 02:41:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 02:41:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-02-04 02:41:42,006 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 183 [2018-02-04 02:41:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:42,006 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-02-04 02:41:42,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 02:41:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-02-04 02:41:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 02:41:42,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:42,007 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:42,007 INFO L371 AbstractCegarLoop]: === Iteration 61 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash -602652369, now seen corresponding path program 41 times [2018-02-04 02:41:42,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:42,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 370 proven. 436 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-02-04 02:41:44,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:44,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 02:41:44,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:44,072 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 02:41:44,072 INFO L182 omatonBuilderFactory]: Interpolants [19850#true, 19851#false, 19852#(<= 1 ~n), 19853#(<= 2 ~n), 19854#(<= 3 ~n), 19855#(<= 4 ~n), 19856#(<= 5 ~n), 19857#(<= 6 ~n), 19858#(<= 7 ~n), 19859#(<= 8 ~n), 19860#(<= 9 ~n), 19861#(<= 10 ~n), 19862#(<= 11 ~n), 19863#(<= 12 ~n), 19864#(<= 13 ~n), 19865#(<= 14 ~n), 19866#(<= 15 ~n), 19867#(and (= 0 |main_#t~malloc6.offset|) (<= 15 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 19868#(and (= (select |#valid| ~a.base) 1) (= 0 ~a.offset) (<= 15 ~n)), 19869#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= 0 ~a.offset) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 15 ~n)), 19870#(and (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 64) (+ ~b.offset (* 4 ~n))) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)))) (= 0 ~a.offset) (<= ~b.offset 4)), 19871#(and (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= 60 (* 4 ~n)) (= (* 4 ~n) (select |#length| ~b.base)))) (= 0 ~a.offset) (<= ~b.offset 4)), 19872#(= |#memory_int| |old(#memory_int)|), 19873#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 19874#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 19875#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 19876#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19877#(or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19878#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 19879#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 19880#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19881#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 19882#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19883#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19884#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 19885#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 19886#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19887#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)), 19888#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44)), 19889#(or (<= (* 4 foo_~i~0) 48) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 19890#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 48) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 19891#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 52)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 19892#(or (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 56))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 19893#(and (= 0 ~a.offset) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 19894#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (= 0 ~a.offset)), 19895#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset))] [2018-02-04 02:41:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 370 proven. 436 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-02-04 02:41:44,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 02:41:44,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 02:41:44,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1663, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 02:41:44,073 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 46 states. [2018-02-04 02:41:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:47,062 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-02-04 02:41:47,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 02:41:47,062 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 187 [2018-02-04 02:41:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:47,063 INFO L225 Difference]: With dead ends: 199 [2018-02-04 02:41:47,063 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 02:41:47,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 16 SyntacticMatches, 14 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2848, Invalid=9142, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 02:41:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 02:41:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-02-04 02:41:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 02:41:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-02-04 02:41:47,065 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 187 [2018-02-04 02:41:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:47,065 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-02-04 02:41:47,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 02:41:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-02-04 02:41:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-02-04 02:41:47,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:47,065 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:47,065 INFO L371 AbstractCegarLoop]: === Iteration 62 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:47,065 INFO L82 PathProgramCache]: Analyzing trace with hash -157263802, now seen corresponding path program 42 times [2018-02-04 02:41:47,066 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:47,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 351 proven. 414 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 02:41:47,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:47,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 02:41:47,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:47,609 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 02:41:47,610 INFO L182 omatonBuilderFactory]: Interpolants [20416#false, 20417#(<= ~n 1), 20418#(<= ~n 2), 20419#(<= ~n 3), 20420#(<= ~n 4), 20421#(<= ~n 5), 20422#(<= ~n 6), 20423#(<= ~n 7), 20424#(<= ~n 8), 20425#(<= ~n 9), 20426#(<= ~n 10), 20427#(<= ~n 11), 20428#(<= ~n 12), 20429#(<= ~n 13), 20430#(<= ~n 14), 20431#(<= ~n 15), 20432#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 15)), 20433#(and (= |main_#t~post8.offset| 0) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 56)) (= (* 4 ~n) (select |#length| ~b.base))), 20434#(and (<= (* 4 ~n) (+ ~b.offset 56)) (= (* 4 ~n) (select |#length| ~b.base))), 20435#(= foo_~i~0 0), 20436#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20437#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20438#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20439#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20440#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20441#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20442#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20443#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20444#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20445#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20446#(or (<= 11 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20447#(or (<= 12 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20448#(or (<= 13 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20449#(or (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 14 foo_~i~0)), 20450#(or (<= (+ ~b.offset 60) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 20415#true] [2018-02-04 02:41:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 351 proven. 414 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 02:41:47,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 02:41:47,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 02:41:47,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:41:47,610 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 36 states. [2018-02-04 02:41:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:48,590 INFO L93 Difference]: Finished difference Result 325 states and 328 transitions. [2018-02-04 02:41:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 02:41:48,590 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 191 [2018-02-04 02:41:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:48,591 INFO L225 Difference]: With dead ends: 325 [2018-02-04 02:41:48,591 INFO L226 Difference]: Without dead ends: 196 [2018-02-04 02:41:48,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=574, Invalid=2396, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 02:41:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-04 02:41:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-02-04 02:41:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 02:41:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-02-04 02:41:48,593 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 191 [2018-02-04 02:41:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:48,593 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-02-04 02:41:48,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 02:41:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-02-04 02:41:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-04 02:41:48,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:48,593 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:48,593 INFO L371 AbstractCegarLoop]: === Iteration 63 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:48,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1635508555, now seen corresponding path program 43 times [2018-02-04 02:41:48,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:48,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 360 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 02:41:48,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:48,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 02:41:48,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:48,872 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 02:41:48,872 INFO L182 omatonBuilderFactory]: Interpolants [21056#(<= foo_~i~0 14), 21057#(<= foo_~i~0 15), 21058#(<= ~n 15), 21024#true, 21025#false, 21026#(<= 1 ~n), 21027#(<= 2 ~n), 21028#(<= 3 ~n), 21029#(<= 4 ~n), 21030#(<= 5 ~n), 21031#(<= 6 ~n), 21032#(<= 7 ~n), 21033#(<= 8 ~n), 21034#(<= 9 ~n), 21035#(<= 10 ~n), 21036#(<= 11 ~n), 21037#(<= 12 ~n), 21038#(<= 13 ~n), 21039#(<= 14 ~n), 21040#(<= 15 ~n), 21041#(<= 16 ~n), 21042#(= foo_~i~0 0), 21043#(<= foo_~i~0 1), 21044#(<= foo_~i~0 2), 21045#(<= foo_~i~0 3), 21046#(<= foo_~i~0 4), 21047#(<= foo_~i~0 5), 21048#(<= foo_~i~0 6), 21049#(<= foo_~i~0 7), 21050#(<= foo_~i~0 8), 21051#(<= foo_~i~0 9), 21052#(<= foo_~i~0 10), 21053#(<= foo_~i~0 11), 21054#(<= foo_~i~0 12), 21055#(<= foo_~i~0 13)] [2018-02-04 02:41:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 360 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 02:41:48,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 02:41:48,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 02:41:48,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:41:48,873 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 35 states. [2018-02-04 02:41:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:41:49,162 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2018-02-04 02:41:49,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:41:49,162 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 194 [2018-02-04 02:41:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:41:49,163 INFO L225 Difference]: With dead ends: 209 [2018-02-04 02:41:49,163 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 02:41:49,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=855, Invalid=1797, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 02:41:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 02:41:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2018-02-04 02:41:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 02:41:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2018-02-04 02:41:49,164 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 194 [2018-02-04 02:41:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:41:49,165 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2018-02-04 02:41:49,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 02:41:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2018-02-04 02:41:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-02-04 02:41:49,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:41:49,165 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:41:49,165 INFO L371 AbstractCegarLoop]: === Iteration 64 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:41:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash 682009044, now seen corresponding path program 44 times [2018-02-04 02:41:49,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:41:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:41:49,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:41:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 29 proven. 887 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-02-04 02:41:52,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:41:52,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 02:41:52,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:41:52,319 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 02:41:52,320 INFO L182 omatonBuilderFactory]: Interpolants [21504#(and (<= ~n 2) (<= 2 ~n)), 21505#(and (<= 3 ~n) (<= ~n 3)), 21506#(and (<= 4 ~n) (<= ~n 4)), 21507#(and (<= ~n 5) (<= 5 ~n)), 21508#(and (<= 6 ~n) (<= ~n 6)), 21509#(and (<= ~n 7) (<= 7 ~n)), 21510#(and (<= 8 ~n) (<= ~n 8)), 21511#(and (<= ~n 9) (<= 9 ~n)), 21512#(and (<= ~n 10) (<= 10 ~n)), 21513#(and (<= ~n 11) (<= 11 ~n)), 21514#(and (<= ~n 12) (<= 12 ~n)), 21515#(and (<= 13 ~n) (<= ~n 13)), 21516#(and (<= ~n 14) (<= 14 ~n)), 21517#(and (<= ~n 15) (<= 15 ~n)), 21518#(and (<= ~n 16) (<= 16 ~n)), 21519#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 16) (<= 16 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 21520#(and (= (select |#valid| ~a.base) 1) (<= ~n 16) (= 0 ~a.offset) (<= 16 ~n)), 21521#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= ~n 16) (= 0 ~a.offset) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 16 ~n)), 21522#(and (= |main_#t~post8.offset| 0) (= 4 ~b.offset) (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (<= (+ |main_#t~post8.offset| 68) (+ ~b.offset (* 4 ~n))) (= (* 4 ~n) (select |#length| ~b.base)) (= 0 ~a.offset) (<= ~n 16)), 21523#(and (<= 4 ~b.offset) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~n 16) (= 0 ~a.offset) (<= 16 ~n) (<= ~b.offset 4)), 21524#(= |#memory_int| |old(#memory_int)|), 21525#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 21526#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 21527#(and (<= (* 4 foo_~i~0) (* 4 ~n)) (or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ (* 4 foo_~i~0) 1) (* 4 ~n)))), 21528#(or (<= (+ ~a.offset 5) ~b.offset) (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21529#(or (<= (+ ~a.offset 5) ~b.offset) (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21530#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21531#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21532#(or (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 3)) (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 5) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21533#(or (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 7)) (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (<= (* 4 foo_~i~0) 16) (<= (+ ~n 9) (+ (* 4 foo_~i~0) ~b.offset)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21534#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 13) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 11)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21535#(or (<= (+ ~a.offset 5) ~b.offset) (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~n 17) (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset (+ ~a.offset 3)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 15)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21536#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 21) (+ (* 4 foo_~i~0) ~b.offset)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 19)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21537#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 23)) (<= (+ ~n 25) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21538#(or (<= (+ ~a.offset 5) ~b.offset) (<= (* 4 foo_~i~0) 36) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 27)) (<= (+ ~n 29) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21539#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40) (<= ~b.offset (+ ~a.offset 3)) (<= (+ ~n 33) (+ (* 4 foo_~i~0) ~b.offset)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 31))), 21540#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 37) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44) (<= ~b.offset (+ ~a.offset 3)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 35)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21541#(or (<= (+ ~a.offset 5) ~b.offset) (<= (* 4 foo_~i~0) 48) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 39)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~n 41) (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21542#(or (<= (+ ~n 45) (+ (* 4 foo_~i~0) ~b.offset)) (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= (* 4 foo_~i~0) 52)), 21543#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (or (= (+ (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))) 4) ~b.offset) (= ~a.base ~b.base) (<= (+ ~n 49) (select |#length| ~b.base)) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 52))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21544#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (or (= (+ (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))) 4) ~b.offset) (= ~a.base ~b.base) (<= (+ ~n 49) (select |#length| ~b.base)) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56)))), 21545#(or (<= (+ ~a.offset 5) ~b.offset) (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (or (= ~a.base ~b.base) (<= (+ ~n 49) (select |#length| ~b.base)) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~b.offset (* 3 ~n)) 51))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 21546#(and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= 4 ~b.offset))) (= (* 4 ~n) (select |#length| ~b.base)) (= 0 ~a.offset) (<= ~b.offset 4)), 21547#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= (* 4 ~n) (select |#length| ~b.base)) (= 0 ~a.offset)), 21548#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (<= |main_#t~mem11| |main_#t~mem10|) (= 0 ~a.offset)), 21501#true, 21502#false, 21503#(and (<= 1 ~n) (<= ~n 1))] [2018-02-04 02:41:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 29 proven. 887 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-02-04 02:41:52,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 02:41:52,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 02:41:52,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1892, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 02:41:52,321 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 48 states. [2018-02-04 02:41:55,413 WARN L143 SmtUtils]: Spent 125ms on a formula simplification that was a NOOP. DAG size: 149 [2018-02-04 02:41:55,851 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 156 DAG size of output 152 [2018-02-04 02:41:56,153 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 141 [2018-02-04 02:41:56,431 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 142 [2018-02-04 02:41:56,879 WARN L146 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 149 DAG size of output 145 [2018-02-04 02:41:57,179 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 134 [2018-02-04 02:41:57,478 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 133 [2018-02-04 02:41:57,885 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 140 DAG size of output 136 [2018-02-04 02:41:58,801 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 131 DAG size of output 127 [2018-02-04 02:41:59,709 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 122 DAG size of output 118 [2018-02-04 02:42:00,566 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 113 DAG size of output 109 [2018-02-04 02:42:01,465 WARN L146 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-02-04 02:42:01,632 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 107 DAG size of output 56 [2018-02-04 02:42:02,330 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 95 DAG size of output 91 [2018-02-04 02:42:02,517 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 98 DAG size of output 56 [2018-02-04 02:42:02,782 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 90 DAG size of output 57 [2018-02-04 02:42:03,163 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 86 DAG size of output 82 [2018-02-04 02:42:05,265 WARN L146 SmtUtils]: Spent 413ms on a formula simplification. DAG size of input: 148 DAG size of output 144 [2018-02-04 02:42:05,662 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 142 DAG size of output 107 [2018-02-04 02:42:05,856 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 130 [2018-02-04 02:42:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:05,937 INFO L93 Difference]: Finished difference Result 362 states and 367 transitions. [2018-02-04 02:42:05,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-02-04 02:42:05,937 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 198 [2018-02-04 02:42:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:05,938 INFO L225 Difference]: With dead ends: 362 [2018-02-04 02:42:05,938 INFO L226 Difference]: Without dead ends: 357 [2018-02-04 02:42:05,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 17 SyntacticMatches, 15 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10095 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=4811, Invalid=26695, Unknown=0, NotChecked=0, Total=31506 [2018-02-04 02:42:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-04 02:42:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 345. [2018-02-04 02:42:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-04 02:42:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 350 transitions. [2018-02-04 02:42:05,941 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 350 transitions. Word has length 198 [2018-02-04 02:42:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:05,942 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 350 transitions. [2018-02-04 02:42:05,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 02:42:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 350 transitions. [2018-02-04 02:42:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 02:42:05,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:05,942 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:05,942 INFO L371 AbstractCegarLoop]: === Iteration 65 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:05,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1775556911, now seen corresponding path program 45 times [2018-02-04 02:42:05,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:05,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 408 proven. 450 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 02:42:06,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:06,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 02:42:06,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:06,299 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 02:42:06,299 INFO L182 omatonBuilderFactory]: Interpolants [22528#(<= 11 ~n), 22529#(<= 12 ~n), 22530#(<= 13 ~n), 22531#(<= 14 ~n), 22532#(<= 15 ~n), 22533#(<= 16 ~n), 22534#(<= 17 ~n), 22535#(= foo_~i~0 0), 22536#(<= foo_~i~0 1), 22537#(<= foo_~i~0 2), 22538#(<= foo_~i~0 3), 22539#(<= foo_~i~0 4), 22540#(<= foo_~i~0 5), 22541#(<= foo_~i~0 6), 22542#(<= foo_~i~0 7), 22543#(<= foo_~i~0 8), 22544#(<= foo_~i~0 9), 22545#(<= foo_~i~0 10), 22546#(<= foo_~i~0 11), 22547#(<= foo_~i~0 12), 22548#(<= foo_~i~0 13), 22549#(<= foo_~i~0 14), 22550#(<= foo_~i~0 15), 22551#(<= ~n 16), 22516#true, 22517#false, 22518#(<= 1 ~n), 22519#(<= 2 ~n), 22520#(<= 3 ~n), 22521#(<= 4 ~n), 22522#(<= 5 ~n), 22523#(<= 6 ~n), 22524#(<= 7 ~n), 22525#(<= 8 ~n), 22526#(<= 9 ~n), 22527#(<= 10 ~n)] [2018-02-04 02:42:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 408 proven. 450 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 02:42:06,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 02:42:06,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 02:42:06,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:42:06,300 INFO L87 Difference]: Start difference. First operand 345 states and 350 transitions. Second operand 36 states. [2018-02-04 02:42:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:06,792 INFO L93 Difference]: Finished difference Result 363 states and 367 transitions. [2018-02-04 02:42:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 02:42:06,792 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 201 [2018-02-04 02:42:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:06,793 INFO L225 Difference]: With dead ends: 363 [2018-02-04 02:42:06,793 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 02:42:06,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1569, Invalid=3123, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 02:42:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 02:42:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 203. [2018-02-04 02:42:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 02:42:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2018-02-04 02:42:06,795 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 201 [2018-02-04 02:42:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:06,795 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2018-02-04 02:42:06,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 02:42:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2018-02-04 02:42:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 02:42:06,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:06,796 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:06,796 INFO L371 AbstractCegarLoop]: === Iteration 66 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash -65544597, now seen corresponding path program 46 times [2018-02-04 02:42:06,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:06,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 406 proven. 466 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 02:42:07,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:07,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 02:42:07,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:07,329 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 02:42:07,329 INFO L182 omatonBuilderFactory]: Interpolants [23232#(<= ~n 15), 23233#(<= ~n 16), 23234#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 16) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 23235#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 60))), 23236#(and (<= (* 4 ~n) (+ ~b.offset 60)) (= (* 4 ~n) (select |#length| ~b.base))), 23237#(= foo_~i~0 0), 23238#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23239#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23240#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23241#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23242#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23243#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23244#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23245#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23246#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23247#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23248#(or (<= 11 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23249#(or (<= 12 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23250#(or (<= 13 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23251#(or (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 14 foo_~i~0)), 23252#(or (<= 15 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23253#(or (<= (+ ~b.offset 64) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 23216#true, 23217#false, 23218#(<= ~n 1), 23219#(<= ~n 2), 23220#(<= ~n 3), 23221#(<= ~n 4), 23222#(<= ~n 5), 23223#(<= ~n 6), 23224#(<= ~n 7), 23225#(<= ~n 8), 23226#(<= ~n 9), 23227#(<= ~n 10), 23228#(<= ~n 11), 23229#(<= ~n 12), 23230#(<= ~n 13), 23231#(<= ~n 14)] [2018-02-04 02:42:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 406 proven. 466 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 02:42:07,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 02:42:07,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 02:42:07,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:42:07,330 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 38 states. [2018-02-04 02:42:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:08,029 INFO L93 Difference]: Finished difference Result 344 states and 347 transitions. [2018-02-04 02:42:08,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 02:42:08,030 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 202 [2018-02-04 02:42:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:08,030 INFO L225 Difference]: With dead ends: 344 [2018-02-04 02:42:08,030 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 02:42:08,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=642, Invalid=2664, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 02:42:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 02:42:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-02-04 02:42:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 02:42:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-02-04 02:42:08,032 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2018-02-04 02:42:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:08,032 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-02-04 02:42:08,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 02:42:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-02-04 02:42:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-02-04 02:42:08,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:08,033 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:08,033 INFO L371 AbstractCegarLoop]: === Iteration 67 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 39120966, now seen corresponding path program 47 times [2018-02-04 02:42:08,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:08,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 408 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 02:42:08,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:08,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 02:42:08,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:08,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 02:42:08,338 INFO L182 omatonBuilderFactory]: Interpolants [23872#(<= 11 ~n), 23873#(<= 12 ~n), 23874#(<= 13 ~n), 23875#(<= 14 ~n), 23876#(<= 15 ~n), 23877#(<= 16 ~n), 23878#(<= 17 ~n), 23879#(= foo_~i~0 0), 23880#(<= foo_~i~0 1), 23881#(<= foo_~i~0 2), 23882#(<= foo_~i~0 3), 23883#(<= foo_~i~0 4), 23884#(<= foo_~i~0 5), 23885#(<= foo_~i~0 6), 23886#(<= foo_~i~0 7), 23887#(<= foo_~i~0 8), 23888#(<= foo_~i~0 9), 23889#(<= foo_~i~0 10), 23890#(<= foo_~i~0 11), 23891#(<= foo_~i~0 12), 23892#(<= foo_~i~0 13), 23893#(<= foo_~i~0 14), 23894#(<= foo_~i~0 15), 23895#(<= foo_~i~0 16), 23896#(<= ~n 16), 23860#true, 23861#false, 23862#(<= 1 ~n), 23863#(<= 2 ~n), 23864#(<= 3 ~n), 23865#(<= 4 ~n), 23866#(<= 5 ~n), 23867#(<= 6 ~n), 23868#(<= 7 ~n), 23869#(<= 8 ~n), 23870#(<= 9 ~n), 23871#(<= 10 ~n)] [2018-02-04 02:42:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 408 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 02:42:08,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 02:42:08,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 02:42:08,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:42:08,338 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 37 states. [2018-02-04 02:42:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:08,696 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-02-04 02:42:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:42:08,697 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 205 [2018-02-04 02:42:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:08,697 INFO L225 Difference]: With dead ends: 220 [2018-02-04 02:42:08,697 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 02:42:08,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=959, Invalid=2011, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 02:42:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 02:42:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2018-02-04 02:42:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 02:42:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-02-04 02:42:08,699 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2018-02-04 02:42:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:08,699 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-02-04 02:42:08,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 02:42:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-02-04 02:42:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 02:42:08,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:08,700 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:08,700 INFO L371 AbstractCegarLoop]: === Iteration 68 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1081913935, now seen corresponding path program 48 times [2018-02-04 02:42:08,700 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:08,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1498 backedges. 496 proven. 1002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:42:12,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:12,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-02-04 02:42:12,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:12,851 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 02:42:12,851 INFO L182 omatonBuilderFactory]: Interpolants [24363#true, 24364#false, 24365#(and (<= 1 ~n) (<= ~n 1)), 24366#(and (<= ~n 2) (<= 2 ~n)), 24367#(and (<= 3 ~n) (<= ~n 3)), 24368#(and (<= 4 ~n) (<= ~n 4)), 24369#(and (<= ~n 5) (<= 5 ~n)), 24370#(and (<= 6 ~n) (<= ~n 6)), 24371#(and (<= ~n 7) (<= 7 ~n)), 24372#(and (<= 8 ~n) (<= ~n 8)), 24373#(and (<= ~n 9) (<= 9 ~n)), 24374#(and (<= ~n 10) (<= 10 ~n)), 24375#(and (<= ~n 11) (<= 11 ~n)), 24376#(and (<= ~n 12) (<= 12 ~n)), 24377#(and (<= 13 ~n) (<= ~n 13)), 24378#(and (<= ~n 14) (<= 14 ~n)), 24379#(and (<= ~n 15) (<= 15 ~n)), 24380#(and (<= ~n 16) (<= 16 ~n)), 24381#(and (<= 17 ~n) (<= ~n 17)), 24382#(and (= 0 |main_#t~malloc6.offset|) (<= 17 ~n) (<= ~n 17) (= (select |#valid| |main_#t~malloc6.base|) 1)), 24383#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 17 ~n) (<= ~n 17)), 24384#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= 17 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 17)), 24385#(and (<= (+ |main_#t~post8.offset| 72) (+ ~b.offset (* 4 ~n))) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~n 17))) (<= ~b.offset 4)), 24386#(and (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 68 (* 4 ~n)) (<= (+ ~b.offset (* 4 ~n)) 72))) (= ~a.offset 0) (<= ~b.offset 4)), 24387#(= |#memory_int| |old(#memory_int)|), 24388#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 0 (+ (* 4 foo_~i~0) ~a.offset))), 24389#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 24390#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 8 (+ (* 4 foo_~i~0) ~a.offset))), 24391#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 12 (+ (* 4 foo_~i~0) ~a.offset))), 24392#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 16 (+ (* 4 foo_~i~0) ~a.offset))), 24393#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 20 (+ (* 4 foo_~i~0) ~a.offset))), 24394#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 24 (+ (* 4 foo_~i~0) ~a.offset))), 24395#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 28 (+ (* 4 foo_~i~0) ~a.offset))), 24396#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 32 (+ (* 4 foo_~i~0) ~a.offset))), 24397#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 36 (+ (* 4 foo_~i~0) ~a.offset))), 24398#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 40 (+ (* 4 foo_~i~0) ~a.offset))), 24399#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 44 (+ (* 4 foo_~i~0) ~a.offset))), 24400#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 48 (+ (* 4 foo_~i~0) ~a.offset))), 24401#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 52 (+ (* 4 foo_~i~0) ~a.offset))), 24402#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 56 (+ (* 4 foo_~i~0) ~a.offset))), 24403#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 60 (+ (* 4 foo_~i~0) ~a.offset))), 24404#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 64 (+ (* 4 foo_~i~0) ~a.offset))), 24405#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n) (<= 64 (+ (* 4 foo_~i~0) ~a.offset))), 24406#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= 68 (+ ~a.offset (* 4 ~n)))), 24407#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (+ (* 4 foo_~i~0) 4) 0) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 24408#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 0) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 24409#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)))), 24410#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)))), 24411#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 24412#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)))), 24413#(or (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24414#(or (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 24) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24415#(or (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24416#(or (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24417#(or (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 36) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24418#(or (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24419#(or (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24420#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 48) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 24421#(or (and (or (<= 68 (+ ~a.offset (* 4 ~n))) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 52))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24422#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56)) (or (<= 73 (+ ~b.offset (* 4 ~n))) (= (+ (* 4 foo_~i~0) 8) (* 4 ~n)) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= 65 (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 24423#(or (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56)) (or (<= 69 (select |#length| ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24424#(or (and (or (<= 69 (select |#length| ~b.base)) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 foo_~i~0) 60) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 24425#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 64)) (or (<= 73 (+ ~b.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 24426#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 24427#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 24428#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-04 02:42:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1498 backedges. 496 proven. 1002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:42:12,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 02:42:12,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 02:42:12,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=3850, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 02:42:12,852 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 66 states. [2018-02-04 02:42:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:21,621 INFO L93 Difference]: Finished difference Result 387 states and 393 transitions. [2018-02-04 02:42:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-02-04 02:42:21,621 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 209 [2018-02-04 02:42:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:21,622 INFO L225 Difference]: With dead ends: 387 [2018-02-04 02:42:21,622 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 02:42:21,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9999 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3902, Invalid=29770, Unknown=0, NotChecked=0, Total=33672 [2018-02-04 02:42:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 02:42:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2018-02-04 02:42:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-04 02:42:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 369 transitions. [2018-02-04 02:42:21,626 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 369 transitions. Word has length 209 [2018-02-04 02:42:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:21,626 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 369 transitions. [2018-02-04 02:42:21,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 02:42:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 369 transitions. [2018-02-04 02:42:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 02:42:21,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:21,627 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:21,627 INFO L371 AbstractCegarLoop]: === Iteration 69 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash -46406636, now seen corresponding path program 49 times [2018-02-04 02:42:21,628 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:21,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 459 proven. 512 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 02:42:21,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:21,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 02:42:21,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:21,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 02:42:21,973 INFO L182 omatonBuilderFactory]: Interpolants [25416#true, 25417#false, 25418#(<= 1 ~n), 25419#(<= 2 ~n), 25420#(<= 3 ~n), 25421#(<= 4 ~n), 25422#(<= 5 ~n), 25423#(<= 6 ~n), 25424#(<= 7 ~n), 25425#(<= 8 ~n), 25426#(<= 9 ~n), 25427#(<= 10 ~n), 25428#(<= 11 ~n), 25429#(<= 12 ~n), 25430#(<= 13 ~n), 25431#(<= 14 ~n), 25432#(<= 15 ~n), 25433#(<= 16 ~n), 25434#(<= 17 ~n), 25435#(<= 18 ~n), 25436#(= foo_~i~0 0), 25437#(<= foo_~i~0 1), 25438#(<= foo_~i~0 2), 25439#(<= foo_~i~0 3), 25440#(<= foo_~i~0 4), 25441#(<= foo_~i~0 5), 25442#(<= foo_~i~0 6), 25443#(<= foo_~i~0 7), 25444#(<= foo_~i~0 8), 25445#(<= foo_~i~0 9), 25446#(<= foo_~i~0 10), 25447#(<= foo_~i~0 11), 25448#(<= foo_~i~0 12), 25449#(<= foo_~i~0 13), 25450#(<= foo_~i~0 14), 25451#(<= foo_~i~0 15), 25452#(<= foo_~i~0 16), 25453#(<= ~n 17)] [2018-02-04 02:42:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1549 backedges. 459 proven. 512 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 02:42:21,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 02:42:21,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 02:42:21,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:42:21,973 INFO L87 Difference]: Start difference. First operand 364 states and 369 transitions. Second operand 38 states. [2018-02-04 02:42:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:22,581 INFO L93 Difference]: Finished difference Result 382 states and 386 transitions. [2018-02-04 02:42:22,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 02:42:22,581 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 212 [2018-02-04 02:42:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:22,582 INFO L225 Difference]: With dead ends: 382 [2018-02-04 02:42:22,582 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 02:42:22,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1760, Invalid=3496, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 02:42:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 02:42:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 214. [2018-02-04 02:42:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 02:42:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2018-02-04 02:42:22,584 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 212 [2018-02-04 02:42:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:22,584 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2018-02-04 02:42:22,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 02:42:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2018-02-04 02:42:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-04 02:42:22,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:22,585 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:22,585 INFO L371 AbstractCegarLoop]: === Iteration 70 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash 556480870, now seen corresponding path program 50 times [2018-02-04 02:42:22,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:22,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 465 proven. 521 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 02:42:23,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:23,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 02:42:23,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:23,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 02:42:23,186 INFO L182 omatonBuilderFactory]: Interpolants [26176#(= foo_~i~0 0), 26177#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26178#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26179#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26180#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26181#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26182#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26183#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26184#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26185#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26186#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26187#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26188#(or (<= 11 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26189#(or (<= 12 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26190#(or (<= 13 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26191#(or (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 14 foo_~i~0)), 26192#(or (<= 15 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26193#(or (<= 16 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26194#(or (<= (+ ~b.offset 68) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 26154#true, 26155#false, 26156#(<= ~n 1), 26157#(<= ~n 2), 26158#(<= ~n 3), 26159#(<= ~n 4), 26160#(<= ~n 5), 26161#(<= ~n 6), 26162#(<= ~n 7), 26163#(<= ~n 8), 26164#(<= ~n 9), 26165#(<= ~n 10), 26166#(<= ~n 11), 26167#(<= ~n 12), 26168#(<= ~n 13), 26169#(<= ~n 14), 26170#(<= ~n 15), 26171#(<= ~n 16), 26172#(<= ~n 17), 26173#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 17)), 26174#(and (= |main_#t~post8.offset| 0) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 64)) (= (* 4 ~n) (select |#length| ~b.base))), 26175#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 64)))] [2018-02-04 02:42:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 465 proven. 521 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 02:42:23,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 02:42:23,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 02:42:23,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:42:23,186 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 41 states. [2018-02-04 02:42:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:24,414 INFO L93 Difference]: Finished difference Result 363 states and 366 transitions. [2018-02-04 02:42:24,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 02:42:24,415 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 213 [2018-02-04 02:42:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:24,415 INFO L225 Difference]: With dead ends: 363 [2018-02-04 02:42:24,415 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 02:42:24,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=3064, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 02:42:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 02:42:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-02-04 02:42:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 02:42:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2018-02-04 02:42:24,417 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 213 [2018-02-04 02:42:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:24,417 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2018-02-04 02:42:24,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 02:42:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2018-02-04 02:42:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-02-04 02:42:24,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:24,418 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:24,418 INFO L371 AbstractCegarLoop]: === Iteration 71 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 599916715, now seen corresponding path program 51 times [2018-02-04 02:42:24,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:24,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 459 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 02:42:24,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:24,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 02:42:24,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:24,770 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 02:42:24,771 INFO L182 omatonBuilderFactory]: Interpolants [26834#true, 26835#false, 26836#(<= 1 ~n), 26837#(<= 2 ~n), 26838#(<= 3 ~n), 26839#(<= 4 ~n), 26840#(<= 5 ~n), 26841#(<= 6 ~n), 26842#(<= 7 ~n), 26843#(<= 8 ~n), 26844#(<= 9 ~n), 26845#(<= 10 ~n), 26846#(<= 11 ~n), 26847#(<= 12 ~n), 26848#(<= 13 ~n), 26849#(<= 14 ~n), 26850#(<= 15 ~n), 26851#(<= 16 ~n), 26852#(<= 17 ~n), 26853#(<= 18 ~n), 26854#(= foo_~i~0 0), 26855#(<= foo_~i~0 1), 26856#(<= foo_~i~0 2), 26857#(<= foo_~i~0 3), 26858#(<= foo_~i~0 4), 26859#(<= foo_~i~0 5), 26860#(<= foo_~i~0 6), 26861#(<= foo_~i~0 7), 26862#(<= foo_~i~0 8), 26863#(<= foo_~i~0 9), 26864#(<= foo_~i~0 10), 26865#(<= foo_~i~0 11), 26866#(<= foo_~i~0 12), 26867#(<= foo_~i~0 13), 26868#(<= foo_~i~0 14), 26869#(<= foo_~i~0 15), 26870#(<= foo_~i~0 16), 26871#(<= foo_~i~0 17), 26872#(<= ~n 17)] [2018-02-04 02:42:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 459 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-02-04 02:42:24,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 02:42:24,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 02:42:24,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:42:24,771 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 39 states. [2018-02-04 02:42:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:25,173 INFO L93 Difference]: Finished difference Result 231 states and 234 transitions. [2018-02-04 02:42:25,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 02:42:25,173 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 216 [2018-02-04 02:42:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:25,174 INFO L225 Difference]: With dead ends: 231 [2018-02-04 02:42:25,174 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 02:42:25,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1069, Invalid=2237, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 02:42:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 02:42:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2018-02-04 02:42:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 02:42:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 223 transitions. [2018-02-04 02:42:25,176 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 223 transitions. Word has length 216 [2018-02-04 02:42:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:25,176 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 223 transitions. [2018-02-04 02:42:25,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 02:42:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 223 transitions. [2018-02-04 02:42:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-02-04 02:42:25,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:25,177 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:25,177 INFO L371 AbstractCegarLoop]: === Iteration 72 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 444628788, now seen corresponding path program 52 times [2018-02-04 02:42:25,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:25,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 526 proven. 631 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-02-04 02:42:27,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:27,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 02:42:27,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:42:27,970 INFO L182 omatonBuilderFactory]: Interpolants [27392#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 27393#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 27394#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 27395#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 27396#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 27397#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 27398#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 27399#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 27400#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 27401#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 27402#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 27403#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)), 27404#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44)), 27405#(or (<= (* 4 foo_~i~0) 48) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 27406#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 52)), 27407#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56)), 27408#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 60) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 27409#(or (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 60) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 27410#(or (not (= 4 ~b.offset)) (and (or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 64)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 27411#(or (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 ~n) 68) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (not (= 4 ~b.offset))), 27412#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 27413#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 27414#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|)), 27363#true, 27364#false, 27365#(<= 1 ~n), 27366#(<= 2 ~n), 27367#(<= 3 ~n), 27368#(<= 4 ~n), 27369#(<= 5 ~n), 27370#(<= 6 ~n), 27371#(<= 7 ~n), 27372#(<= 8 ~n), 27373#(<= 9 ~n), 27374#(<= 10 ~n), 27375#(<= 11 ~n), 27376#(<= 12 ~n), 27377#(<= 13 ~n), 27378#(<= 14 ~n), 27379#(<= 15 ~n), 27380#(<= 16 ~n), 27381#(<= 17 ~n), 27382#(<= 18 ~n), 27383#(and (= 0 |main_#t~malloc6.offset|) (<= 18 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 27384#(and (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= 18 ~n)), 27385#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= 18 ~n)), 27386#(and (= |main_#t~post8.offset| 0) (= ~a.offset 0) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)))) (<= (+ |main_#t~post8.offset| 76) (+ ~b.offset (* 4 ~n))) (<= ~b.offset 4)), 27387#(and (= ~a.offset 0) (or (not (= 4 ~b.offset)) (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 72 (* 4 ~n)))) (<= ~b.offset 4)), 27388#(= |#memory_int| |old(#memory_int)|), 27389#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 27390#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 27391#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n)))] [2018-02-04 02:42:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 526 proven. 631 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-02-04 02:42:27,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 02:42:27,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 02:42:27,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=2116, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 02:42:27,970 INFO L87 Difference]: Start difference. First operand 221 states and 223 transitions. Second operand 52 states. [2018-02-04 02:42:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:31,414 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2018-02-04 02:42:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 02:42:31,415 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 220 [2018-02-04 02:42:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:31,415 INFO L225 Difference]: With dead ends: 232 [2018-02-04 02:42:31,415 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 02:42:31,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 19 SyntacticMatches, 17 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4041 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3784, Invalid=11716, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 02:42:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 02:42:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-02-04 02:42:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 02:42:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2018-02-04 02:42:31,417 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 220 [2018-02-04 02:42:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:31,418 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2018-02-04 02:42:31,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 02:42:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2018-02-04 02:42:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-02-04 02:42:31,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:31,418 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:31,418 INFO L371 AbstractCegarLoop]: === Iteration 73 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1996223541, now seen corresponding path program 53 times [2018-02-04 02:42:31,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:31,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 512 proven. 595 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 02:42:31,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:31,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 02:42:31,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:31,770 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 02:42:31,770 INFO L182 omatonBuilderFactory]: Interpolants [28032#(<= ~n 13), 28033#(<= ~n 14), 28034#(<= ~n 15), 28035#(<= ~n 16), 28036#(<= ~n 17), 28037#(<= ~n 18), 28038#(= foo_~i~0 0), 28039#(<= 1 foo_~i~0), 28040#(<= 2 foo_~i~0), 28041#(<= 3 foo_~i~0), 28042#(<= 4 foo_~i~0), 28043#(<= 5 foo_~i~0), 28044#(<= 6 foo_~i~0), 28045#(<= 7 foo_~i~0), 28046#(<= 8 foo_~i~0), 28047#(<= 9 foo_~i~0), 28048#(<= 10 foo_~i~0), 28049#(<= 11 foo_~i~0), 28050#(<= 12 foo_~i~0), 28051#(<= 13 foo_~i~0), 28052#(<= 14 foo_~i~0), 28053#(<= 15 foo_~i~0), 28054#(<= 16 foo_~i~0), 28055#(<= 17 foo_~i~0), 28056#(<= 19 ~n), 28018#true, 28019#false, 28020#(<= ~n 1), 28021#(<= ~n 2), 28022#(<= ~n 3), 28023#(<= ~n 4), 28024#(<= ~n 5), 28025#(<= ~n 6), 28026#(<= ~n 7), 28027#(<= ~n 8), 28028#(<= ~n 9), 28029#(<= ~n 10), 28030#(<= ~n 11), 28031#(<= ~n 12)] [2018-02-04 02:42:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 512 proven. 595 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 02:42:31,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 02:42:31,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 02:42:31,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:42:31,771 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 39 states. [2018-02-04 02:42:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:32,260 INFO L93 Difference]: Finished difference Result 381 states and 384 transitions. [2018-02-04 02:42:32,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 02:42:32,261 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 224 [2018-02-04 02:42:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:32,261 INFO L225 Difference]: With dead ends: 381 [2018-02-04 02:42:32,261 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 02:42:32,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=728, Invalid=2578, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 02:42:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 02:42:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-02-04 02:42:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 02:42:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 230 transitions. [2018-02-04 02:42:32,263 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 230 transitions. Word has length 224 [2018-02-04 02:42:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:32,263 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 230 transitions. [2018-02-04 02:42:32,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 02:42:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 230 transitions. [2018-02-04 02:42:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 02:42:32,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:32,264 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:32,264 INFO L371 AbstractCegarLoop]: === Iteration 74 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1461483366, now seen corresponding path program 54 times [2018-02-04 02:42:32,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:32,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 513 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 02:42:32,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:32,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 02:42:32,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:32,656 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 02:42:32,657 INFO L182 omatonBuilderFactory]: Interpolants [28736#(<= 13 ~n), 28737#(<= 14 ~n), 28738#(<= 15 ~n), 28739#(<= 16 ~n), 28740#(<= 17 ~n), 28741#(<= 18 ~n), 28742#(<= 19 ~n), 28743#(= foo_~i~0 0), 28744#(<= foo_~i~0 1), 28745#(<= foo_~i~0 2), 28746#(<= foo_~i~0 3), 28747#(<= foo_~i~0 4), 28748#(<= foo_~i~0 5), 28749#(<= foo_~i~0 6), 28750#(<= foo_~i~0 7), 28751#(<= foo_~i~0 8), 28752#(<= foo_~i~0 9), 28753#(<= foo_~i~0 10), 28754#(<= foo_~i~0 11), 28755#(<= foo_~i~0 12), 28756#(<= foo_~i~0 13), 28757#(<= foo_~i~0 14), 28758#(<= foo_~i~0 15), 28759#(<= foo_~i~0 16), 28760#(<= foo_~i~0 17), 28761#(<= foo_~i~0 18), 28762#(<= ~n 18), 28722#true, 28723#false, 28724#(<= 1 ~n), 28725#(<= 2 ~n), 28726#(<= 3 ~n), 28727#(<= 4 ~n), 28728#(<= 5 ~n), 28729#(<= 6 ~n), 28730#(<= 7 ~n), 28731#(<= 8 ~n), 28732#(<= 9 ~n), 28733#(<= 10 ~n), 28734#(<= 11 ~n), 28735#(<= 12 ~n)] [2018-02-04 02:42:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 513 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 02:42:32,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 02:42:32,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 02:42:32,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 02:42:32,657 INFO L87 Difference]: Start difference. First operand 228 states and 230 transitions. Second operand 41 states. [2018-02-04 02:42:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:33,078 INFO L93 Difference]: Finished difference Result 242 states and 245 transitions. [2018-02-04 02:42:33,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:42:33,078 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 227 [2018-02-04 02:42:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:33,079 INFO L225 Difference]: With dead ends: 242 [2018-02-04 02:42:33,079 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 02:42:33,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1185, Invalid=2475, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 02:42:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 02:42:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 232. [2018-02-04 02:42:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 02:42:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2018-02-04 02:42:33,081 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 227 [2018-02-04 02:42:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:33,081 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2018-02-04 02:42:33,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 02:42:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2018-02-04 02:42:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-02-04 02:42:33,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:33,081 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:33,082 INFO L371 AbstractCegarLoop]: === Iteration 75 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash -680061073, now seen corresponding path program 55 times [2018-02-04 02:42:33,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:33,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 584 proven. 704 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-02-04 02:42:36,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:36,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 02:42:36,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:36,066 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 02:42:36,066 INFO L182 omatonBuilderFactory]: Interpolants [29312#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 29313#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 29314#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 29315#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 29316#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 29317#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 29318#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)), 29319#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44)), 29320#(or (<= (* 4 foo_~i~0) 48) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 29321#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 52)), 29322#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56)), 29323#(or (<= (* 4 foo_~i~0) 60) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 29324#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 64)), 29325#(or (and (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 64))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 29326#(or (and (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 68))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 29327#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 72)))), 29328#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 29329#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 29330#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|)), 29277#true, 29278#false, 29279#(<= 1 ~n), 29280#(<= 2 ~n), 29281#(<= 3 ~n), 29282#(<= 4 ~n), 29283#(<= 5 ~n), 29284#(<= 6 ~n), 29285#(<= 7 ~n), 29286#(<= 8 ~n), 29287#(<= 9 ~n), 29288#(<= 10 ~n), 29289#(<= 11 ~n), 29290#(<= 12 ~n), 29291#(<= 13 ~n), 29292#(<= 14 ~n), 29293#(<= 15 ~n), 29294#(<= 16 ~n), 29295#(<= 17 ~n), 29296#(<= 18 ~n), 29297#(<= 19 ~n), 29298#(and (<= 19 ~n) (= 0 |main_#t~malloc6.offset|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 29299#(and (<= 19 ~n) (= ~a.offset 0) (= (select |#valid| ~a.base) 1)), 29300#(and (not (= ~a.base |main_#t~malloc7.base|)) (<= 19 ~n) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 29301#(and (= |main_#t~post8.offset| 0) (= ~a.offset 0) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)))) (<= (+ |main_#t~post8.offset| 80) (+ ~b.offset (* 4 ~n))) (<= ~b.offset 4)), 29302#(and (= ~a.offset 0) (or (and (<= 76 (* 4 ~n)) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 29303#(= |#memory_int| |old(#memory_int)|), 29304#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 29305#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 29306#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (or (<= (+ (* 4 foo_~i~0) 1) (* 4 ~n)) (= (* 4 ~n) (* 4 foo_~i~0)))), 29307#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 29308#(or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 29309#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 29310#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 29311#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))] [2018-02-04 02:42:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 584 proven. 704 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-02-04 02:42:36,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 02:42:36,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 02:42:36,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2279, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 02:42:36,067 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 54 states. [2018-02-04 02:42:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:39,668 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-02-04 02:42:39,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 02:42:39,669 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 231 [2018-02-04 02:42:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:39,669 INFO L225 Difference]: With dead ends: 243 [2018-02-04 02:42:39,669 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 02:42:39,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 20 SyntacticMatches, 18 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4126, Invalid=12644, Unknown=0, NotChecked=0, Total=16770 [2018-02-04 02:42:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 02:42:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-02-04 02:42:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 02:42:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-02-04 02:42:39,671 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 231 [2018-02-04 02:42:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:39,672 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-02-04 02:42:39,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 02:42:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-02-04 02:42:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-02-04 02:42:39,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:39,672 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:39,672 INFO L371 AbstractCegarLoop]: === Iteration 76 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:39,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1009651334, now seen corresponding path program 56 times [2018-02-04 02:42:39,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:39,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 595 proven. 640 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 02:42:40,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:40,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 02:42:40,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:40,374 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 02:42:40,375 INFO L182 omatonBuilderFactory]: Interpolants [29962#true, 29963#false, 29964#(<= ~n 1), 29965#(<= ~n 2), 29966#(<= ~n 3), 29967#(<= ~n 4), 29968#(<= ~n 5), 29969#(<= ~n 6), 29970#(<= ~n 7), 29971#(<= ~n 8), 29972#(<= ~n 9), 29973#(<= ~n 10), 29974#(<= ~n 11), 29975#(<= ~n 12), 29976#(<= ~n 13), 29977#(<= ~n 14), 29978#(<= ~n 15), 29979#(<= ~n 16), 29980#(<= ~n 17), 29981#(<= ~n 18), 29982#(<= ~n 19), 29983#(and (= 0 |main_#t~malloc7.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 19)), 29984#(and (= |main_#t~post8.offset| 0) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 72)) (= (* 4 ~n) (select |#length| ~b.base))), 29985#(and (= (* 4 ~n) (select |#length| ~b.base)) (<= (* 4 ~n) (+ ~b.offset 72))), 29986#(= foo_~i~0 0), 29987#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29988#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29989#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29990#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29991#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29992#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29993#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29994#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29995#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29996#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29997#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29998#(or (<= 11 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 29999#(or (<= 12 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 30000#(or (<= 13 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 30001#(or (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 14 foo_~i~0)), 30002#(or (<= 15 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 30003#(or (<= 16 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 30004#(or (<= 17 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 30005#(or (<= 18 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 30006#(or (<= (+ ~b.offset 76) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-04 02:42:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 595 proven. 640 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 02:42:40,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 02:42:40,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 02:42:40,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=1566, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 02:42:40,375 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 45 states. [2018-02-04 02:42:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:41,753 INFO L93 Difference]: Finished difference Result 401 states and 404 transitions. [2018-02-04 02:42:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 02:42:41,753 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 235 [2018-02-04 02:42:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:41,754 INFO L225 Difference]: With dead ends: 401 [2018-02-04 02:42:41,754 INFO L226 Difference]: Without dead ends: 240 [2018-02-04 02:42:41,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=874, Invalid=3682, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 02:42:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-04 02:42:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2018-02-04 02:42:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 02:42:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 241 transitions. [2018-02-04 02:42:41,755 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 241 transitions. Word has length 235 [2018-02-04 02:42:41,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:41,755 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 241 transitions. [2018-02-04 02:42:41,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 02:42:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 241 transitions. [2018-02-04 02:42:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-02-04 02:42:41,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:41,756 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:41,756 INFO L371 AbstractCegarLoop]: === Iteration 77 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:41,756 INFO L82 PathProgramCache]: Analyzing trace with hash 398713867, now seen corresponding path program 57 times [2018-02-04 02:42:41,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:41,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 570 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 02:42:42,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:42,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 02:42:42,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:42,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 02:42:42,163 INFO L182 omatonBuilderFactory]: Interpolants [30720#(<= 7 ~n), 30721#(<= 8 ~n), 30722#(<= 9 ~n), 30723#(<= 10 ~n), 30724#(<= 11 ~n), 30725#(<= 12 ~n), 30726#(<= 13 ~n), 30727#(<= 14 ~n), 30728#(<= 15 ~n), 30729#(<= 16 ~n), 30730#(<= 17 ~n), 30731#(<= 18 ~n), 30732#(<= 19 ~n), 30733#(<= 20 ~n), 30734#(= foo_~i~0 0), 30735#(<= foo_~i~0 1), 30736#(<= foo_~i~0 2), 30737#(<= foo_~i~0 3), 30738#(<= foo_~i~0 4), 30739#(<= foo_~i~0 5), 30740#(<= foo_~i~0 6), 30741#(<= foo_~i~0 7), 30742#(<= foo_~i~0 8), 30743#(<= foo_~i~0 9), 30744#(<= foo_~i~0 10), 30745#(<= foo_~i~0 11), 30746#(<= foo_~i~0 12), 30747#(<= foo_~i~0 13), 30748#(<= foo_~i~0 14), 30749#(<= foo_~i~0 15), 30750#(<= foo_~i~0 16), 30751#(<= foo_~i~0 17), 30752#(<= foo_~i~0 18), 30753#(<= foo_~i~0 19), 30754#(<= ~n 19), 30712#true, 30713#false, 30714#(<= 1 ~n), 30715#(<= 2 ~n), 30716#(<= 3 ~n), 30717#(<= 4 ~n), 30718#(<= 5 ~n), 30719#(<= 6 ~n)] [2018-02-04 02:42:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 570 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 02:42:42,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 02:42:42,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 02:42:42,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:42:42,163 INFO L87 Difference]: Start difference. First operand 239 states and 241 transitions. Second operand 43 states. [2018-02-04 02:42:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:42:42,622 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2018-02-04 02:42:42,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 02:42:42,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 238 [2018-02-04 02:42:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:42:42,623 INFO L225 Difference]: With dead ends: 253 [2018-02-04 02:42:42,623 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 02:42:42,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1307, Invalid=2725, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 02:42:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 02:42:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2018-02-04 02:42:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 02:42:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 245 transitions. [2018-02-04 02:42:42,625 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 245 transitions. Word has length 238 [2018-02-04 02:42:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:42:42,625 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 245 transitions. [2018-02-04 02:42:42,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 02:42:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 245 transitions. [2018-02-04 02:42:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-04 02:42:42,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:42:42,626 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:42:42,626 INFO L371 AbstractCegarLoop]: === Iteration 78 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:42:42,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2008670060, now seen corresponding path program 58 times [2018-02-04 02:42:42,626 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:42:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:42:42,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:42:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 37 proven. 1389 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-02-04 02:42:47,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:42:47,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 02:42:47,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:42:47,189 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 02:42:47,190 INFO L182 omatonBuilderFactory]: Interpolants [31293#true, 31294#false, 31295#(and (<= 1 ~n) (<= ~n 1)), 31296#(and (<= ~n 2) (<= 2 ~n)), 31297#(and (<= 3 ~n) (<= ~n 3)), 31298#(and (<= 4 ~n) (<= ~n 4)), 31299#(and (<= ~n 5) (<= 5 ~n)), 31300#(and (<= 6 ~n) (<= ~n 6)), 31301#(and (<= ~n 7) (<= 7 ~n)), 31302#(and (<= 8 ~n) (<= ~n 8)), 31303#(and (<= ~n 9) (<= 9 ~n)), 31304#(and (<= ~n 10) (<= 10 ~n)), 31305#(and (<= ~n 11) (<= 11 ~n)), 31306#(and (<= ~n 12) (<= 12 ~n)), 31307#(and (<= 13 ~n) (<= ~n 13)), 31308#(and (<= ~n 14) (<= 14 ~n)), 31309#(and (<= ~n 15) (<= 15 ~n)), 31310#(and (<= ~n 16) (<= 16 ~n)), 31311#(and (<= 17 ~n) (<= ~n 17)), 31312#(and (<= ~n 18) (<= 18 ~n)), 31313#(and (<= 19 ~n) (<= ~n 19)), 31314#(and (<= 20 ~n) (<= ~n 20)), 31315#(and (<= 20 ~n) (= 0 |main_#t~malloc6.offset|) (<= ~n 20) (= (select |#valid| |main_#t~malloc6.base|) 1)), 31316#(and (<= 20 ~n) (= ~a.offset 0) (= (select |#valid| ~a.base) 1) (<= ~n 20)), 31317#(and (<= 20 ~n) (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 20)), 31318#(and (= ~b.base |main_#t~post8.base|) (= 4 ~b.offset) (= |main_#t~post8.offset| 0) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ |main_#t~post8.offset| 64) (+ ~b.offset (* 3 ~n))) (<= ~n 20)), 31319#(and (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 64 (+ ~b.offset (* 3 ~n))) (<= ~n 20) (<= ~b.offset 4)), 31320#(= |#memory_int| |old(#memory_int)|), 31321#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 31322#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 31323#(and (<= (* 4 foo_~i~0) (* 4 ~n)) (or (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ (* 4 foo_~i~0) 1) (* 4 ~n)))), 31324#(or (<= (+ ~a.offset 5) ~b.offset) (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31325#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31326#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31327#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31328#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31329#(or (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 3)) (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 5) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31330#(or (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 7)) (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (<= (+ ~n 9) (+ (* 4 foo_~i~0) ~b.offset)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31331#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 13) (+ (* 4 foo_~i~0) ~b.offset)) (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 11)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31332#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28) (<= (+ ~n 17) (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset (+ ~a.offset 3)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 15)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31333#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 21) (+ (* 4 foo_~i~0) ~b.offset)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 19)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31334#(or (<= (+ ~a.offset 5) ~b.offset) (<= (* 4 foo_~i~0) 36) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 23)) (<= (+ ~n 25) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31335#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 27)) (<= (+ ~n 29) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31336#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44) (<= ~b.offset (+ ~a.offset 3)) (<= (+ ~n 33) (+ (* 4 foo_~i~0) ~b.offset)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 31))), 31337#(or (<= (+ ~a.offset 5) ~b.offset) (<= (* 4 foo_~i~0) 48) (<= (+ ~n 37) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 35)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31338#(or (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 39)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ ~n 41) (+ (* 4 foo_~i~0) ~b.offset)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (<= (* 4 foo_~i~0) 52)), 31339#(or (<= (+ ~n 45) (+ (* 4 foo_~i~0) ~b.offset)) (<= (+ ~a.offset 5) ~b.offset) (= ~a.base ~b.base) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 43)) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31340#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 49) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 60) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 47)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31341#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 51)) (<= (+ ~n 53) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= ~b.offset (+ ~a.offset 3)) (<= (* 4 foo_~i~0) 64) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31342#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ ~n 57) (+ (* 4 foo_~i~0) ~b.offset)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n)) (+ (* 4 foo_~i~0) ~b.offset 3)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (+ (* 4 foo_~i~0) ~b.offset) (+ ~n 55)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31343#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (or (<= (+ ~n 61) (select |#length| ~b.base)) (= (+ (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))) 4) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 68))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31344#(or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))) (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (or (<= (+ ~n 61) (select |#length| ~b.base)) (= (+ (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))) 4) ~b.offset) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 72)))), 31345#(or (<= (+ ~a.offset 5) ~b.offset) (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (or (<= (+ ~n 61) (select |#length| ~b.base)) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 76))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 31346#(and (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= 4 ~b.offset))) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset 4)), 31347#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= (* 4 ~n) (select |#length| ~b.base))), 31348#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-04 02:42:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 37 proven. 1389 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-02-04 02:42:47,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 02:42:47,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 02:42:47,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=2557, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 02:42:47,190 INFO L87 Difference]: Start difference. First operand 243 states and 245 transitions. Second operand 56 states. [2018-02-04 02:42:51,132 WARN L143 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 179 [2018-02-04 02:42:51,710 WARN L146 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 186 DAG size of output 180 [2018-02-04 02:42:51,899 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 192 DAG size of output 56 [2018-02-04 02:42:52,125 WARN L143 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 168 [2018-02-04 02:42:52,512 WARN L143 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 172 [2018-02-04 02:42:53,058 WARN L146 SmtUtils]: Spent 330ms on a formula simplification. DAG size of input: 179 DAG size of output 173 [2018-02-04 02:42:53,424 WARN L143 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 161 [2018-02-04 02:42:53,802 WARN L143 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 163 [2018-02-04 02:42:54,305 WARN L146 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 170 DAG size of output 164 [2018-02-04 02:42:54,660 WARN L143 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 152 [2018-02-04 02:42:54,999 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 154 [2018-02-04 02:42:55,494 WARN L146 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 161 DAG size of output 155 [2018-02-04 02:42:55,842 WARN L143 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 143 [2018-02-04 02:42:56,189 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 145 [2018-02-04 02:42:56,652 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 152 DAG size of output 146 [2018-02-04 02:42:56,994 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 134 [2018-02-04 02:42:57,758 WARN L146 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 143 DAG size of output 137 [2018-02-04 02:42:58,844 WARN L146 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 134 DAG size of output 128 [2018-02-04 02:42:59,971 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 125 DAG size of output 119 [2018-02-04 02:43:01,059 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 116 DAG size of output 110 [2018-02-04 02:43:02,134 WARN L146 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 107 DAG size of output 101 [2018-02-04 02:43:03,156 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 98 DAG size of output 92 [2018-02-04 02:43:04,118 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 89 DAG size of output 83 [2018-02-04 02:43:06,529 WARN L146 SmtUtils]: Spent 522ms on a formula simplification. DAG size of input: 173 DAG size of output 169 [2018-02-04 02:43:07,005 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 174 DAG size of output 129 [2018-02-04 02:43:07,282 WARN L143 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 160 [2018-02-04 02:43:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:07,418 INFO L93 Difference]: Finished difference Result 438 states and 443 transitions. [2018-02-04 02:43:07,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-02-04 02:43:07,419 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 242 [2018-02-04 02:43:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:07,420 INFO L225 Difference]: With dead ends: 438 [2018-02-04 02:43:07,420 INFO L226 Difference]: Without dead ends: 433 [2018-02-04 02:43:07,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 21 SyntacticMatches, 19 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14837 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=7034, Invalid=38548, Unknown=0, NotChecked=0, Total=45582 [2018-02-04 02:43:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-04 02:43:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 421. [2018-02-04 02:43:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-02-04 02:43:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 426 transitions. [2018-02-04 02:43:07,424 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 426 transitions. Word has length 242 [2018-02-04 02:43:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:07,424 INFO L432 AbstractCegarLoop]: Abstraction has 421 states and 426 transitions. [2018-02-04 02:43:07,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 02:43:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 426 transitions. [2018-02-04 02:43:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-02-04 02:43:07,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:07,425 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:07,425 INFO L371 AbstractCegarLoop]: === Iteration 79 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1117586577, now seen corresponding path program 59 times [2018-02-04 02:43:07,425 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:07,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 630 proven. 722 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 02:43:07,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:07,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 02:43:07,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:07,866 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 02:43:07,866 INFO L182 omatonBuilderFactory]: Interpolants [32524#true, 32525#false, 32526#(<= 1 ~n), 32527#(<= 2 ~n), 32528#(<= 3 ~n), 32529#(<= 4 ~n), 32530#(<= 5 ~n), 32531#(<= 6 ~n), 32532#(<= 7 ~n), 32533#(<= 8 ~n), 32534#(<= 9 ~n), 32535#(<= 10 ~n), 32536#(<= 11 ~n), 32537#(<= 12 ~n), 32538#(<= 13 ~n), 32539#(<= 14 ~n), 32540#(<= 15 ~n), 32541#(<= 16 ~n), 32542#(<= 17 ~n), 32543#(<= 18 ~n), 32544#(<= 19 ~n), 32545#(<= 20 ~n), 32546#(<= 21 ~n), 32547#(= foo_~i~0 0), 32548#(<= foo_~i~0 1), 32549#(<= foo_~i~0 2), 32550#(<= foo_~i~0 3), 32551#(<= foo_~i~0 4), 32552#(<= foo_~i~0 5), 32553#(<= foo_~i~0 6), 32554#(<= foo_~i~0 7), 32555#(<= foo_~i~0 8), 32556#(<= foo_~i~0 9), 32557#(<= foo_~i~0 10), 32558#(<= foo_~i~0 11), 32559#(<= foo_~i~0 12), 32560#(<= foo_~i~0 13), 32561#(<= foo_~i~0 14), 32562#(<= foo_~i~0 15), 32563#(<= foo_~i~0 16), 32564#(<= foo_~i~0 17), 32565#(<= foo_~i~0 18), 32566#(<= foo_~i~0 19), 32567#(<= ~n 20)] [2018-02-04 02:43:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 630 proven. 722 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 02:43:07,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 02:43:07,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 02:43:07,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1407, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 02:43:07,866 INFO L87 Difference]: Start difference. First operand 421 states and 426 transitions. Second operand 44 states. [2018-02-04 02:43:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:08,693 INFO L93 Difference]: Finished difference Result 439 states and 443 transitions. [2018-02-04 02:43:08,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 02:43:08,693 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 245 [2018-02-04 02:43:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:08,694 INFO L225 Difference]: With dead ends: 439 [2018-02-04 02:43:08,694 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 02:43:08,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2399, Invalid=4741, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 02:43:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 02:43:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 247. [2018-02-04 02:43:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 02:43:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 249 transitions. [2018-02-04 02:43:08,697 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 249 transitions. Word has length 245 [2018-02-04 02:43:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:08,697 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 249 transitions. [2018-02-04 02:43:08,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 02:43:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 249 transitions. [2018-02-04 02:43:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-02-04 02:43:08,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:08,698 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:08,698 INFO L371 AbstractCegarLoop]: === Iteration 80 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1851391275, now seen corresponding path program 60 times [2018-02-04 02:43:08,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:08,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 648 proven. 722 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 02:43:09,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:09,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 02:43:09,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:09,157 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 02:43:09,157 INFO L182 omatonBuilderFactory]: Interpolants [33408#(<= 10 foo_~i~0), 33409#(<= 11 foo_~i~0), 33410#(<= 12 foo_~i~0), 33411#(<= 13 foo_~i~0), 33412#(<= 14 foo_~i~0), 33413#(<= 15 foo_~i~0), 33414#(<= 16 foo_~i~0), 33415#(<= 17 foo_~i~0), 33416#(<= 18 foo_~i~0), 33417#(<= 19 foo_~i~0), 33418#(<= 21 ~n), 33376#true, 33377#false, 33378#(<= ~n 1), 33379#(<= ~n 2), 33380#(<= ~n 3), 33381#(<= ~n 4), 33382#(<= ~n 5), 33383#(<= ~n 6), 33384#(<= ~n 7), 33385#(<= ~n 8), 33386#(<= ~n 9), 33387#(<= ~n 10), 33388#(<= ~n 11), 33389#(<= ~n 12), 33390#(<= ~n 13), 33391#(<= ~n 14), 33392#(<= ~n 15), 33393#(<= ~n 16), 33394#(<= ~n 17), 33395#(<= ~n 18), 33396#(<= ~n 19), 33397#(<= ~n 20), 33398#(= foo_~i~0 0), 33399#(<= 1 foo_~i~0), 33400#(<= 2 foo_~i~0), 33401#(<= 3 foo_~i~0), 33402#(<= 4 foo_~i~0), 33403#(<= 5 foo_~i~0), 33404#(<= 6 foo_~i~0), 33405#(<= 7 foo_~i~0), 33406#(<= 8 foo_~i~0), 33407#(<= 9 foo_~i~0)] [2018-02-04 02:43:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 648 proven. 722 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 02:43:09,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 02:43:09,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 02:43:09,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:43:09,158 INFO L87 Difference]: Start difference. First operand 247 states and 249 transitions. Second operand 43 states. [2018-02-04 02:43:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:10,168 INFO L93 Difference]: Finished difference Result 419 states and 422 transitions. [2018-02-04 02:43:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 02:43:10,168 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 246 [2018-02-04 02:43:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:10,169 INFO L225 Difference]: With dead ends: 419 [2018-02-04 02:43:10,169 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 02:43:10,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=888, Invalid=3144, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 02:43:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 02:43:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-02-04 02:43:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-04 02:43:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 252 transitions. [2018-02-04 02:43:10,171 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 252 transitions. Word has length 246 [2018-02-04 02:43:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:10,171 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 252 transitions. [2018-02-04 02:43:10,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 02:43:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 252 transitions. [2018-02-04 02:43:10,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 02:43:10,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:10,172 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:10,172 INFO L371 AbstractCegarLoop]: === Iteration 81 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1048055162, now seen corresponding path program 61 times [2018-02-04 02:43:10,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:10,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2230 backedges. 630 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 02:43:10,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:10,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 02:43:10,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:10,652 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 02:43:10,652 INFO L182 omatonBuilderFactory]: Interpolants [34176#(<= foo_~i~0 3), 34177#(<= foo_~i~0 4), 34178#(<= foo_~i~0 5), 34179#(<= foo_~i~0 6), 34180#(<= foo_~i~0 7), 34181#(<= foo_~i~0 8), 34182#(<= foo_~i~0 9), 34183#(<= foo_~i~0 10), 34184#(<= foo_~i~0 11), 34185#(<= foo_~i~0 12), 34186#(<= foo_~i~0 13), 34187#(<= foo_~i~0 14), 34188#(<= foo_~i~0 15), 34189#(<= foo_~i~0 16), 34190#(<= foo_~i~0 17), 34191#(<= foo_~i~0 18), 34192#(<= foo_~i~0 19), 34193#(<= foo_~i~0 20), 34194#(<= ~n 20), 34150#true, 34151#false, 34152#(<= 1 ~n), 34153#(<= 2 ~n), 34154#(<= 3 ~n), 34155#(<= 4 ~n), 34156#(<= 5 ~n), 34157#(<= 6 ~n), 34158#(<= 7 ~n), 34159#(<= 8 ~n), 34160#(<= 9 ~n), 34161#(<= 10 ~n), 34162#(<= 11 ~n), 34163#(<= 12 ~n), 34164#(<= 13 ~n), 34165#(<= 14 ~n), 34166#(<= 15 ~n), 34167#(<= 16 ~n), 34168#(<= 17 ~n), 34169#(<= 18 ~n), 34170#(<= 19 ~n), 34171#(<= 20 ~n), 34172#(<= 21 ~n), 34173#(= foo_~i~0 0), 34174#(<= foo_~i~0 1), 34175#(<= foo_~i~0 2)] [2018-02-04 02:43:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2230 backedges. 630 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-02-04 02:43:10,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 02:43:10,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 02:43:10,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 02:43:10,653 INFO L87 Difference]: Start difference. First operand 250 states and 252 transitions. Second operand 45 states. [2018-02-04 02:43:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:11,177 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2018-02-04 02:43:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 02:43:11,177 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 249 [2018-02-04 02:43:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:11,178 INFO L225 Difference]: With dead ends: 264 [2018-02-04 02:43:11,178 INFO L226 Difference]: Without dead ends: 264 [2018-02-04 02:43:11,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1435, Invalid=2987, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 02:43:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-04 02:43:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-02-04 02:43:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 02:43:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 256 transitions. [2018-02-04 02:43:11,180 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 256 transitions. Word has length 249 [2018-02-04 02:43:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:11,180 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 256 transitions. [2018-02-04 02:43:11,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 02:43:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 256 transitions. [2018-02-04 02:43:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 02:43:11,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:11,181 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:11,181 INFO L371 AbstractCegarLoop]: === Iteration 82 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 363688079, now seen corresponding path program 62 times [2018-02-04 02:43:11,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:11,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 709 proven. 862 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-02-04 02:43:15,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:15,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 02:43:15,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:15,012 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 02:43:15,012 INFO L182 omatonBuilderFactory]: Interpolants [34757#true, 34758#false, 34759#(<= 1 ~n), 34760#(<= 2 ~n), 34761#(<= 3 ~n), 34762#(<= 4 ~n), 34763#(<= 5 ~n), 34764#(<= 6 ~n), 34765#(<= 7 ~n), 34766#(<= 8 ~n), 34767#(<= 9 ~n), 34768#(<= 10 ~n), 34769#(<= 11 ~n), 34770#(<= 12 ~n), 34771#(<= 13 ~n), 34772#(<= 14 ~n), 34773#(<= 15 ~n), 34774#(<= 16 ~n), 34775#(<= 17 ~n), 34776#(<= 18 ~n), 34777#(<= 19 ~n), 34778#(<= 20 ~n), 34779#(<= 21 ~n), 34780#(and (= 0 |main_#t~malloc6.offset|) (<= 21 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 34781#(and (<= 21 ~n) (= ~a.offset 0) (= (select |#valid| ~a.base) 1)), 34782#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (<= 21 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 34783#(and (= |main_#t~post8.offset| 0) (= ~a.offset 0) (or (not (= 4 ~b.offset)) (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)))) (<= ~b.offset 4) (<= (+ |main_#t~post8.offset| 88) (+ ~b.offset (* 4 ~n)))), 34784#(and (= ~a.offset 0) (or (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 84 (* 4 ~n))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 34785#(= |#memory_int| |old(#memory_int)|), 34786#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 34787#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 34788#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 34789#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 34790#(or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 34791#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 34792#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 34793#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 34794#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 34795#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 34796#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 34797#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 34798#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 34799#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 34800#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)), 34801#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44)), 34802#(or (<= (* 4 foo_~i~0) 48) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 34803#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 52)), 34804#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56)), 34805#(or (<= (* 4 foo_~i~0) 60) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 34806#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 64)), 34807#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 68)), 34808#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 72)), 34809#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 72)) (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))))), 34810#(or (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 76)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))) (= ~a.base ~b.base) (not (= 4 ~b.offset))), 34811#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 ~n) 80) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))))), 34812#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))) (not (= 4 ~b.offset))) (<= ~b.offset 4)), 34813#(and (= ~n |main_#t~mem10|) (= 4 ~b.offset) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ (* 4 ~n) ~b.offset (- 8))))), 34814#(and (= 4 ~b.offset) (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-04 02:43:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 709 proven. 862 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-02-04 02:43:15,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 02:43:15,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 02:43:15,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2623, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 02:43:15,013 INFO L87 Difference]: Start difference. First operand 254 states and 256 transitions. Second operand 58 states. [2018-02-04 02:43:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:19,167 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2018-02-04 02:43:19,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-04 02:43:19,167 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 253 [2018-02-04 02:43:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:19,168 INFO L225 Difference]: With dead ends: 265 [2018-02-04 02:43:19,168 INFO L226 Difference]: Without dead ends: 260 [2018-02-04 02:43:19,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 22 SyntacticMatches, 20 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5118 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4855, Invalid=14605, Unknown=0, NotChecked=0, Total=19460 [2018-02-04 02:43:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-04 02:43:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-02-04 02:43:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-04 02:43:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 260 transitions. [2018-02-04 02:43:19,171 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 260 transitions. Word has length 253 [2018-02-04 02:43:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:19,171 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 260 transitions. [2018-02-04 02:43:19,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 02:43:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 260 transitions. [2018-02-04 02:43:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 02:43:19,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:19,172 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:19,172 INFO L371 AbstractCegarLoop]: === Iteration 83 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1465046950, now seen corresponding path program 63 times [2018-02-04 02:43:19,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:19,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 722 proven. 790 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 02:43:19,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:19,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 02:43:19,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:19,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 02:43:19,665 INFO L182 omatonBuilderFactory]: Interpolants [35520#(<= ~n 17), 35521#(<= ~n 18), 35522#(<= ~n 19), 35523#(<= ~n 20), 35524#(<= ~n 21), 35525#(= foo_~i~0 0), 35526#(<= 1 foo_~i~0), 35527#(<= 2 foo_~i~0), 35528#(<= 3 foo_~i~0), 35529#(<= 4 foo_~i~0), 35530#(<= 5 foo_~i~0), 35531#(<= 6 foo_~i~0), 35532#(<= 7 foo_~i~0), 35533#(<= 8 foo_~i~0), 35534#(<= 9 foo_~i~0), 35535#(<= 10 foo_~i~0), 35536#(<= 11 foo_~i~0), 35537#(<= 12 foo_~i~0), 35538#(<= 13 foo_~i~0), 35539#(<= 14 foo_~i~0), 35540#(<= 15 foo_~i~0), 35541#(<= 16 foo_~i~0), 35542#(<= 17 foo_~i~0), 35543#(<= 18 foo_~i~0), 35544#(<= 19 foo_~i~0), 35545#(<= 20 foo_~i~0), 35546#(<= 22 ~n), 35502#true, 35503#false, 35504#(<= ~n 1), 35505#(<= ~n 2), 35506#(<= ~n 3), 35507#(<= ~n 4), 35508#(<= ~n 5), 35509#(<= ~n 6), 35510#(<= ~n 7), 35511#(<= ~n 8), 35512#(<= ~n 9), 35513#(<= ~n 10), 35514#(<= ~n 11), 35515#(<= ~n 12), 35516#(<= ~n 13), 35517#(<= ~n 14), 35518#(<= ~n 15), 35519#(<= ~n 16)] [2018-02-04 02:43:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2394 backedges. 722 proven. 790 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 02:43:19,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 02:43:19,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 02:43:19,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 02:43:19,666 INFO L87 Difference]: Start difference. First operand 258 states and 260 transitions. Second operand 45 states. [2018-02-04 02:43:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:20,248 INFO L93 Difference]: Finished difference Result 438 states and 441 transitions. [2018-02-04 02:43:20,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 02:43:20,249 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 257 [2018-02-04 02:43:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:20,249 INFO L225 Difference]: With dead ends: 438 [2018-02-04 02:43:20,249 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 02:43:20,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=974, Invalid=3448, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 02:43:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 02:43:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-02-04 02:43:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-04 02:43:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 263 transitions. [2018-02-04 02:43:20,251 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 263 transitions. Word has length 257 [2018-02-04 02:43:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:20,251 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 263 transitions. [2018-02-04 02:43:20,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 02:43:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 263 transitions. [2018-02-04 02:43:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-02-04 02:43:20,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:20,252 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:20,252 INFO L371 AbstractCegarLoop]: === Iteration 84 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash -177239189, now seen corresponding path program 64 times [2018-02-04 02:43:20,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:20,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2457 backedges. 693 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 02:43:20,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:20,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 02:43:20,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:20,777 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 02:43:20,777 INFO L182 omatonBuilderFactory]: Interpolants [36352#(<= foo_~i~0 17), 36353#(<= foo_~i~0 18), 36354#(<= foo_~i~0 19), 36355#(<= foo_~i~0 20), 36356#(<= foo_~i~0 21), 36357#(<= ~n 21), 36311#true, 36312#false, 36313#(<= 1 ~n), 36314#(<= 2 ~n), 36315#(<= 3 ~n), 36316#(<= 4 ~n), 36317#(<= 5 ~n), 36318#(<= 6 ~n), 36319#(<= 7 ~n), 36320#(<= 8 ~n), 36321#(<= 9 ~n), 36322#(<= 10 ~n), 36323#(<= 11 ~n), 36324#(<= 12 ~n), 36325#(<= 13 ~n), 36326#(<= 14 ~n), 36327#(<= 15 ~n), 36328#(<= 16 ~n), 36329#(<= 17 ~n), 36330#(<= 18 ~n), 36331#(<= 19 ~n), 36332#(<= 20 ~n), 36333#(<= 21 ~n), 36334#(<= 22 ~n), 36335#(= foo_~i~0 0), 36336#(<= foo_~i~0 1), 36337#(<= foo_~i~0 2), 36338#(<= foo_~i~0 3), 36339#(<= foo_~i~0 4), 36340#(<= foo_~i~0 5), 36341#(<= foo_~i~0 6), 36342#(<= foo_~i~0 7), 36343#(<= foo_~i~0 8), 36344#(<= foo_~i~0 9), 36345#(<= foo_~i~0 10), 36346#(<= foo_~i~0 11), 36347#(<= foo_~i~0 12), 36348#(<= foo_~i~0 13), 36349#(<= foo_~i~0 14), 36350#(<= foo_~i~0 15), 36351#(<= foo_~i~0 16)] [2018-02-04 02:43:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2457 backedges. 693 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-02-04 02:43:20,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 02:43:20,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 02:43:20,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:43:20,777 INFO L87 Difference]: Start difference. First operand 261 states and 263 transitions. Second operand 47 states. [2018-02-04 02:43:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:21,252 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2018-02-04 02:43:21,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 02:43:21,252 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 260 [2018-02-04 02:43:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:21,253 INFO L225 Difference]: With dead ends: 275 [2018-02-04 02:43:21,253 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 02:43:21,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1569, Invalid=3261, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 02:43:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 02:43:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 265. [2018-02-04 02:43:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 02:43:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 267 transitions. [2018-02-04 02:43:21,255 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 267 transitions. Word has length 260 [2018-02-04 02:43:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:21,255 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 267 transitions. [2018-02-04 02:43:21,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 02:43:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 267 transitions. [2018-02-04 02:43:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-02-04 02:43:21,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:21,256 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:21,256 INFO L371 AbstractCegarLoop]: === Iteration 85 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1327135244, now seen corresponding path program 65 times [2018-02-04 02:43:21,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:21,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2543 backedges. 776 proven. 947 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-02-04 02:43:25,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:25,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 02:43:25,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:25,419 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 02:43:25,419 INFO L182 omatonBuilderFactory]: Interpolants [36992#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56) (not (= ~b.offset 4))), 36993#(or (<= (* 4 foo_~i~0) 60) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 36994#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)) (<= (* 4 foo_~i~0) 64)), 36995#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)) (<= (* 4 foo_~i~0) 68)), 36996#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 72) (not (= ~b.offset 4))), 36997#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 76) (not (= ~b.offset 4))), 36998#(or (= ~a.base ~b.base) (and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 76))) (not (= ~b.offset 4))), 36999#(or (= ~a.base ~b.base) (and (or (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 80)) (or (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))) (not (= ~b.offset 4))), 37000#(or (and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (<= (* 4 ~n) 84) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (= ~a.base ~b.base) (not (= ~b.offset 4))), 37001#(and (= ~a.offset 0) (or (and (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))) (not (= ~b.offset 4))) (<= ~b.offset 4)), 37002#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (= ~b.offset 4)), 37003#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|) (= ~b.offset 4)), 36944#true, 36945#false, 36946#(<= 1 ~n), 36947#(<= 2 ~n), 36948#(<= 3 ~n), 36949#(<= 4 ~n), 36950#(<= 5 ~n), 36951#(<= 6 ~n), 36952#(<= 7 ~n), 36953#(<= 8 ~n), 36954#(<= 9 ~n), 36955#(<= 10 ~n), 36956#(<= 11 ~n), 36957#(<= 12 ~n), 36958#(<= 13 ~n), 36959#(<= 14 ~n), 36960#(<= 15 ~n), 36961#(<= 16 ~n), 36962#(<= 17 ~n), 36963#(<= 18 ~n), 36964#(<= 19 ~n), 36965#(<= 20 ~n), 36966#(<= 21 ~n), 36967#(<= 22 ~n), 36968#(and (<= 22 ~n) (= 0 |main_#t~malloc6.offset|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 36969#(and (<= 22 ~n) (= ~a.offset 0) (= (select |#valid| ~a.base) 1)), 36970#(and (not (= ~a.base |main_#t~malloc7.base|)) (<= 22 ~n) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 36971#(and (= |main_#t~post8.offset| 0) (= ~a.offset 0) (<= ~b.offset 4) (or (and (= ~b.base |main_#t~post8.base|) (not (= |main_#t~post8.base| ~a.base)) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ |main_#t~post8.offset| 92) (+ ~b.offset (* 4 ~n)))) (not (= ~b.offset 4)))), 36972#(and (= ~a.offset 0) (or (and (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 88 (* 4 ~n))) (not (= ~b.offset 4))) (<= ~b.offset 4)), 36973#(= |#memory_int| |old(#memory_int)|), 36974#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 36975#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 36976#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 36977#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 36978#(or (<= (* 4 foo_~i~0) 0) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 36979#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4) (not (= ~b.offset 4))), 36980#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8) (not (= ~b.offset 4))), 36981#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 36982#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16) (not (= ~b.offset 4))), 36983#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 36984#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 36985#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28) (not (= ~b.offset 4))), 36986#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32) (not (= ~b.offset 4))), 36987#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 36988#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40) (not (= ~b.offset 4))), 36989#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44) (not (= ~b.offset 4))), 36990#(or (<= (* 4 foo_~i~0) 48) (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))), 36991#(or (= ~a.base ~b.base) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4)) (<= (* 4 foo_~i~0) 52))] [2018-02-04 02:43:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2543 backedges. 776 proven. 947 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-02-04 02:43:25,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 02:43:25,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 02:43:25,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=2826, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 02:43:25,420 INFO L87 Difference]: Start difference. First operand 265 states and 267 transitions. Second operand 60 states. [2018-02-04 02:43:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:29,753 INFO L93 Difference]: Finished difference Result 276 states and 278 transitions. [2018-02-04 02:43:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-02-04 02:43:29,753 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 264 [2018-02-04 02:43:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:29,754 INFO L225 Difference]: With dead ends: 276 [2018-02-04 02:43:29,754 INFO L226 Difference]: Without dead ends: 271 [2018-02-04 02:43:29,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 23 SyntacticMatches, 21 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5455 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5220, Invalid=15660, Unknown=0, NotChecked=0, Total=20880 [2018-02-04 02:43:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-04 02:43:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-02-04 02:43:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 02:43:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2018-02-04 02:43:29,756 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 264 [2018-02-04 02:43:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:29,756 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2018-02-04 02:43:29,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 02:43:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2018-02-04 02:43:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-02-04 02:43:29,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:29,757 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:29,757 INFO L371 AbstractCegarLoop]: === Iteration 86 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1006128501, now seen corresponding path program 66 times [2018-02-04 02:43:29,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:29,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2629 backedges. 820 proven. 841 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 02:43:30,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:30,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 02:43:30,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:30,668 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 02:43:30,668 INFO L182 omatonBuilderFactory]: Interpolants [37760#(or (<= 13 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37761#(or (not (= (* 4 ~n) (select |#length| ~b.base))) (<= 14 foo_~i~0)), 37762#(or (<= 15 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37763#(or (<= 16 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37764#(or (<= 17 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37765#(or (<= 18 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37766#(or (<= 19 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37767#(or (<= 20 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37768#(or (<= 21 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37769#(or (<= (+ ~b.offset 88) (select |#length| ~b.base)) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37719#true, 37720#false, 37721#(<= ~n 1), 37722#(<= ~n 2), 37723#(<= ~n 3), 37724#(<= ~n 4), 37725#(<= ~n 5), 37726#(<= ~n 6), 37727#(<= ~n 7), 37728#(<= ~n 8), 37729#(<= ~n 9), 37730#(<= ~n 10), 37731#(<= ~n 11), 37732#(<= ~n 12), 37733#(<= ~n 13), 37734#(<= ~n 14), 37735#(<= ~n 15), 37736#(<= ~n 16), 37737#(<= ~n 17), 37738#(<= ~n 18), 37739#(<= ~n 19), 37740#(<= ~n 20), 37741#(<= ~n 21), 37742#(<= ~n 22), 37743#(and (= 0 |main_#t~malloc7.offset|) (<= ~n 22) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 37744#(and (= |main_#t~post8.offset| 0) (= (* 4 ~n) (select |#length| ~b.base)) (<= (+ (* 4 ~n) |main_#t~post8.offset|) (+ ~b.offset 84))), 37745#(and (<= (* 4 ~n) (+ ~b.offset 84)) (= (* 4 ~n) (select |#length| ~b.base))), 37746#(= foo_~i~0 0), 37747#(or (= foo_~i~0 0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37748#(or (<= 1 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37749#(or (<= 2 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37750#(or (<= 3 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37751#(or (<= 4 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37752#(or (<= 5 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37753#(or (<= 6 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37754#(or (<= 7 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37755#(or (<= 8 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37756#(or (<= 9 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37757#(or (<= 10 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37758#(or (<= 11 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base)))), 37759#(or (<= 12 foo_~i~0) (not (= (* 4 ~n) (select |#length| ~b.base))))] [2018-02-04 02:43:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2629 backedges. 820 proven. 841 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 02:43:30,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 02:43:30,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 02:43:30,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=2007, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 02:43:30,669 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 51 states. [2018-02-04 02:43:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:32,497 INFO L93 Difference]: Finished difference Result 458 states and 461 transitions. [2018-02-04 02:43:32,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 02:43:32,497 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 268 [2018-02-04 02:43:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:32,498 INFO L225 Difference]: With dead ends: 458 [2018-02-04 02:43:32,498 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 02:43:32,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1138, Invalid=4714, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 02:43:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 02:43:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2018-02-04 02:43:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 02:43:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 274 transitions. [2018-02-04 02:43:32,500 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 274 transitions. Word has length 268 [2018-02-04 02:43:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:32,500 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 274 transitions. [2018-02-04 02:43:32,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 02:43:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 274 transitions. [2018-02-04 02:43:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-02-04 02:43:32,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:32,501 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:32,501 INFO L371 AbstractCegarLoop]: === Iteration 87 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:32,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1631493722, now seen corresponding path program 67 times [2018-02-04 02:43:32,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:32,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 759 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 02:43:33,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:33,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 02:43:33,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:33,046 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 02:43:33,046 INFO L182 omatonBuilderFactory]: Interpolants [38574#true, 38575#false, 38576#(<= 1 ~n), 38577#(<= 2 ~n), 38578#(<= 3 ~n), 38579#(<= 4 ~n), 38580#(<= 5 ~n), 38581#(<= 6 ~n), 38582#(<= 7 ~n), 38583#(<= 8 ~n), 38584#(<= 9 ~n), 38585#(<= 10 ~n), 38586#(<= 11 ~n), 38587#(<= 12 ~n), 38588#(<= 13 ~n), 38589#(<= 14 ~n), 38590#(<= 15 ~n), 38591#(<= 16 ~n), 38592#(<= 17 ~n), 38593#(<= 18 ~n), 38594#(<= 19 ~n), 38595#(<= 20 ~n), 38596#(<= 21 ~n), 38597#(<= 22 ~n), 38598#(<= 23 ~n), 38599#(= foo_~i~0 0), 38600#(<= foo_~i~0 1), 38601#(<= foo_~i~0 2), 38602#(<= foo_~i~0 3), 38603#(<= foo_~i~0 4), 38604#(<= foo_~i~0 5), 38605#(<= foo_~i~0 6), 38606#(<= foo_~i~0 7), 38607#(<= foo_~i~0 8), 38608#(<= foo_~i~0 9), 38609#(<= foo_~i~0 10), 38610#(<= foo_~i~0 11), 38611#(<= foo_~i~0 12), 38612#(<= foo_~i~0 13), 38613#(<= foo_~i~0 14), 38614#(<= foo_~i~0 15), 38615#(<= foo_~i~0 16), 38616#(<= foo_~i~0 17), 38617#(<= foo_~i~0 18), 38618#(<= foo_~i~0 19), 38619#(<= foo_~i~0 20), 38620#(<= foo_~i~0 21), 38621#(<= foo_~i~0 22), 38622#(<= ~n 22)] [2018-02-04 02:43:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 759 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 02:43:33,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 02:43:33,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 02:43:33,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 02:43:33,047 INFO L87 Difference]: Start difference. First operand 272 states and 274 transitions. Second operand 49 states. [2018-02-04 02:43:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:43:33,565 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2018-02-04 02:43:33,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 02:43:33,565 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 271 [2018-02-04 02:43:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:43:33,566 INFO L225 Difference]: With dead ends: 286 [2018-02-04 02:43:33,566 INFO L226 Difference]: Without dead ends: 286 [2018-02-04 02:43:33,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1709, Invalid=3547, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 02:43:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-04 02:43:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2018-02-04 02:43:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-04 02:43:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2018-02-04 02:43:33,568 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 271 [2018-02-04 02:43:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:43:33,568 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2018-02-04 02:43:33,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 02:43:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2018-02-04 02:43:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-02-04 02:43:33,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:43:33,569 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:43:33,569 INFO L371 AbstractCegarLoop]: === Iteration 88 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 02:43:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash -515261009, now seen corresponding path program 68 times [2018-02-04 02:43:33,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:43:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:43:33,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:43:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 846 proven. 1036 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-02-04 02:43:37,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:43:37,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 02:43:37,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:43:37,820 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 02:43:37,820 INFO L182 omatonBuilderFactory]: Interpolants [39233#true, 39234#false, 39235#(<= 1 ~n), 39236#(<= 2 ~n), 39237#(<= 3 ~n), 39238#(<= 4 ~n), 39239#(<= 5 ~n), 39240#(<= 6 ~n), 39241#(<= 7 ~n), 39242#(<= 8 ~n), 39243#(<= 9 ~n), 39244#(<= 10 ~n), 39245#(<= 11 ~n), 39246#(<= 12 ~n), 39247#(<= 13 ~n), 39248#(<= 14 ~n), 39249#(<= 15 ~n), 39250#(<= 16 ~n), 39251#(<= 17 ~n), 39252#(<= 18 ~n), 39253#(<= 19 ~n), 39254#(<= 20 ~n), 39255#(<= 21 ~n), 39256#(<= 22 ~n), 39257#(<= 23 ~n), 39258#(and (= 0 |main_#t~malloc6.offset|) (<= 23 ~n) (= (select |#valid| |main_#t~malloc6.base|) 1)), 39259#(and (= ~a.offset 0) (<= 23 ~n) (= (select |#valid| ~a.base) 1)), 39260#(and (not (= ~a.base |main_#t~malloc7.base|)) (= 0 |main_#t~malloc7.offset|) (= ~a.offset 0) (<= 23 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 39261#(and (= ~b.base |main_#t~post8.base|) (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 96) (+ ~b.offset (* 4 ~n))) (= ~a.offset 0) (not (= |main_#t~post8.base| ~a.base)) (<= ~b.offset (+ |main_#t~post8.offset| 4)) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base))), 39262#(and (<= 4 ~b.offset) (= ~a.offset 0) (not (= ~a.base ~b.base)) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (= (* 4 ~n) (select |#length| ~b.base)) (<= 92 (* 4 ~n)) (<= ~b.offset 4)), 39263#(= |#memory_int| |old(#memory_int)|), 39264#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 39265#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (+ foo_~i~0 1) ~n)), 39266#(and (= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|) (<= (* 4 foo_~i~0) (* 4 ~n))), 39267#(or (= (+ (* 4 foo_~i~0) 4) 0) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 39268#(or (= ~a.base ~b.base) (<= (* 4 foo_~i~0) 0) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 39269#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 4)), 39270#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 8)), 39271#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 12) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 39272#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 16)), 39273#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (<= (* 4 foo_~i~0) 20) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 39274#(or (<= (* 4 foo_~i~0) 24) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 39275#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 28)), 39276#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 32)), 39277#(or (<= (* 4 foo_~i~0) 36) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 39278#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 40)), 39279#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 44)), 39280#(or (<= (* 4 foo_~i~0) 48) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 39281#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 52)), 39282#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 56)), 39283#(or (<= (* 4 foo_~i~0) 60) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))), 39284#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 64)), 39285#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 68)), 39286#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 72)), 39287#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 76)), 39288#(or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 80)), 39289#(and (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 foo_~i~0) 80)) (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ (* 4 foo_~i~0) ~b.offset 5) (+ ~a.offset (* 4 ~n))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 39290#(and (or (<= (* 4 foo_~i~0) 84) (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4))))) (or (<= (+ ~a.offset 5) ~b.offset) (<= (+ (* 4 foo_~i~0) ~b.offset 1) (+ ~a.offset (* 4 ~n))) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base))))), 39291#(and (or (<= (+ ~a.offset 5) ~b.offset) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8)))) (<= (+ ~a.offset (* 4 ~n) 1) (select |#length| ~b.base)) (<= ~b.offset (+ ~a.offset 3)) (not (= (* 4 ~n) (select |#length| ~b.base)))) (or (= ~a.base ~b.base) (not (= 4 ~b.offset)) (= (select (select |old(#memory_int)| ~b.base) (+ ~b.offset (- 4))) (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (<= (* 4 ~n) 88))), 39292#(and (or (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (and (not (= 4 ~b.offset)) (<= ~b.offset 4))) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 39293#(and (= ~n |main_#t~mem10|) (= ~a.offset 0) (= ~n (select (select |#memory_int| ~b.base) (+ ~b.offset (* 4 ~n) (- 8))))), 39294#(and (<= |main_#t~mem10| |main_#t~mem11|) (= ~a.offset 0) (<= |main_#t~mem11| |main_#t~mem10|))] [2018-02-04 02:43:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 846 proven. 1036 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-02-04 02:43:37,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 02:43:37,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 02:43:37,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=2968, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 02:43:37,821 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 62 states. Received shutdown request... [2018-02-04 02:43:37,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:43:37,952 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 02:43:37,955 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 02:43:37,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:43:37 BoogieIcfgContainer [2018-02-04 02:43:37,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:43:37,956 INFO L168 Benchmark]: Toolchain (without parser) took 184183.20 ms. Allocated memory was 400.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 357.0 MB in the beginning and 1.2 GB in the end (delta: -875.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-04 02:43:37,957 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 400.6 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:43:37,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.28 ms. Allocated memory is still 400.6 MB. Free memory was 357.0 MB in the beginning and 346.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 02:43:37,957 INFO L168 Benchmark]: Boogie Preprocessor took 25.66 ms. Allocated memory is still 400.6 MB. Free memory was 346.5 MB in the beginning and 343.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:43:37,957 INFO L168 Benchmark]: RCFGBuilder took 178.09 ms. Allocated memory is still 400.6 MB. Free memory was 343.8 MB in the beginning and 324.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 02:43:37,957 INFO L168 Benchmark]: TraceAbstraction took 183831.74 ms. Allocated memory was 400.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 324.0 MB in the beginning and 1.2 GB in the end (delta: -908.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-04 02:43:37,958 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 400.6 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.28 ms. Allocated memory is still 400.6 MB. Free memory was 357.0 MB in the beginning and 346.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 25.66 ms. Allocated memory is still 400.6 MB. Free memory was 346.5 MB in the beginning and 343.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 178.09 ms. Allocated memory is still 400.6 MB. Free memory was 343.8 MB in the beginning and 324.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 183831.74 ms. Allocated memory was 400.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 324.0 MB in the beginning and 1.2 GB in the end (delta: -908.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (276states) and interpolant automaton (currently 10 states, 62 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 183.7s OverallTime, 88 OverallIterations, 24 TraceHistogramMax, 118.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3883 SDtfs, 55524 SDslu, 46072 SDs, 0 SdLazy, 67458 SolverSat, 22010 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5718 GetRequests, 804 SyntacticMatches, 293 SemanticMatches, 4620 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106274 ImplicationChecksByTransitivity, 133.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=421occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 42882/70042 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, 87 MinimizatonAttempts, 1544 StatesRemovedByMinimization, 68 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 61.7s InterpolantComputationTime, 11657 NumberOfCodeBlocks, 11657 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 11569 ConstructedInterpolants, 0 QuantifiedInterpolants, 16650124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 88 InterpolantComputations, 13 PerfectInterpolantSequences, 42882/70042 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_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-43-37-969.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-43-37-969.csv Completed graceful shutdown